Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
lwm1986
roslyn
提交
aa691a17
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,发现更多精彩内容 >>
未验证
提交
aa691a17
编写于
4月 27, 2020
作者:
S
Sam Harwell
提交者:
GitHub
4月 27, 2020
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #43715 from sharwell/intervaltree-any
🐇
Avoid using an ArrayBuilder for IntervalTree<T>.Any
上级
995e2628
81dbb931
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
18 addition
and
11 deletion
+18
-11
src/Workspaces/SharedUtilitiesAndExtensions/Compiler/Core/Collections/IntervalTree`1.cs
...AndExtensions/Compiler/Core/Collections/IntervalTree`1.cs
+18
-11
未找到文件。
src/Workspaces/SharedUtilitiesAndExtensions/Compiler/Core/Collections/IntervalTree`1.cs
浏览文件 @
aa691a17
...
...
@@ -140,9 +140,8 @@ public bool HasIntervalThatContains<TIntrospector>(int start, int length, in TIn
private
bool
Any
<
TIntrospector
>(
int
start
,
int
length
,
TestInterval
<
TIntrospector
>
testInterval
,
in
TIntrospector
introspector
)
where
TIntrospector
:
struct
,
IIntervalIntrospector
<
T
>
{
using
var
_
=
ArrayBuilder
<
T
>.
GetInstance
(
out
var
builder
);
FillWithIntervalsThatMatch
(
start
,
length
,
testInterval
,
builder
,
in
introspector
,
stopAfterFirst
:
true
);
return
builder
.
Count
>
0
;
var
matches
=
FillWithIntervalsThatMatch
(
start
,
length
,
testInterval
,
builder
:
null
,
in
introspector
,
stopAfterFirst
:
true
);
return
matches
>
0
;
}
private
ImmutableArray
<
T
>
GetIntervalsThatMatch
<
TIntrospector
>(
...
...
@@ -154,33 +153,38 @@ private bool Any<TIntrospector>(int start, int length, TestInterval<TIntrospecto
return
result
.
ToImmutableAndFree
();
}
private
void
FillWithIntervalsThatMatch
<
TIntrospector
>(
/// <returns>The number of matching intervals found by the method.</returns>
private
int
FillWithIntervalsThatMatch
<
TIntrospector
>(
int
start
,
int
length
,
TestInterval
<
TIntrospector
>
testInterval
,
ArrayBuilder
<
T
>
builder
,
in
TIntrospector
introspector
,
ArrayBuilder
<
T
>
?
builder
,
in
TIntrospector
introspector
,
bool
stopAfterFirst
)
where
TIntrospector
:
struct
,
IIntervalIntrospector
<
T
>
{
if
(
root
==
null
)
{
return
;
return
0
;
}
var
candidates
=
s_stackPool
.
Allocate
();
FillWithIntervalsThatMatch
(
var
matches
=
FillWithIntervalsThatMatch
(
start
,
length
,
testInterval
,
builder
,
in
introspector
,
stopAfterFirst
,
candidates
);
s_stackPool
.
ClearAndFree
(
candidates
);
return
matches
;
}
private
void
FillWithIntervalsThatMatch
<
TIntrospector
>(
/// <returns>The number of matching intervals found by the method.</returns>
private
int
FillWithIntervalsThatMatch
<
TIntrospector
>(
int
start
,
int
length
,
TestInterval
<
TIntrospector
>
testInterval
,
ArrayBuilder
<
T
>
builder
,
in
TIntrospector
introspector
,
ArrayBuilder
<
T
>
?
builder
,
in
TIntrospector
introspector
,
bool
stopAfterFirst
,
Stack
<(
Node
?
node
,
bool
firstTime
)>
candidates
)
where
TIntrospector
:
struct
,
IIntervalIntrospector
<
T
>
{
var
matches
=
0
;
var
end
=
start
+
length
;
candidates
.
Push
((
root
,
firstTime
:
true
));
...
...
@@ -199,11 +203,12 @@ private bool Any<TIntrospector>(int start, int length, TestInterval<TIntrospecto
// side of it). Now see if it matches our test, and if so return it out.
if
(
testInterval
(
currentNode
.
Value
,
start
,
length
,
in
introspector
))
{
builder
.
Add
(
currentNode
.
Value
);
matches
++;
builder
?.
Add
(
currentNode
.
Value
);
if
(
stopAfterFirst
)
{
return
;
return
1
;
}
}
}
...
...
@@ -237,6 +242,8 @@ private bool Any<TIntrospector>(int start, int length, TestInterval<TIntrospecto
}
}
}
return
matches
;
}
public
bool
IsEmpty
()
=>
this
.
root
==
null
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录