Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
be455106
V
vscode
项目概览
掘金者说
/
vscode
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
V
vscode
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
be455106
编写于
6月 19, 2018
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
splitview: better naming
上级
7edc9aad
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
13 addition
and
16 deletion
+13
-16
src/vs/base/browser/ui/splitview/splitview.ts
src/vs/base/browser/ui/splitview/splitview.ts
+13
-16
未找到文件。
src/vs/base/browser/ui/splitview/splitview.ts
浏览文件 @
be455106
...
...
@@ -356,10 +356,9 @@ export class SplitView implements IDisposable {
const
resetSashDragState
=
(
start
:
number
,
alt
:
boolean
)
=>
{
const
sizes
=
this
.
viewItems
.
map
(
i
=>
i
.
size
);
// TODO@Joao rename these guys
let
minDelta
=
Number
.
POSITIVE_INFINITY
;
let
minDelta
=
Number
.
NEGATIVE_INFINITY
;
let
maxDelta
=
Number
.
POSITIVE_INFINITY
;
if
(
this
.
inverseAltBehavior
)
{
alt
=
!
alt
;
}
...
...
@@ -372,11 +371,11 @@ export class SplitView implements IDisposable {
if
(
isLastSash
)
{
const
viewItem
=
this
.
viewItems
[
index
];
minDelta
=
(
viewItem
.
size
-
viewItem
.
view
.
minimumS
ize
)
/
2
;
minDelta
=
(
viewItem
.
view
.
minimumSize
-
viewItem
.
s
ize
)
/
2
;
maxDelta
=
(
viewItem
.
view
.
maximumSize
-
viewItem
.
size
)
/
2
;
}
else
{
const
viewItem
=
this
.
viewItems
[
index
+
1
];
minDelta
=
(
viewItem
.
view
.
maximumSize
-
viewItem
.
s
ize
)
/
2
;
minDelta
=
(
viewItem
.
size
-
viewItem
.
view
.
maximumS
ize
)
/
2
;
maxDelta
=
(
viewItem
.
size
-
viewItem
.
view
.
minimumSize
)
/
2
;
}
}
...
...
@@ -399,8 +398,8 @@ export class SplitView implements IDisposable {
const
newSizes
=
this
.
viewItems
.
map
(
i
=>
i
.
size
);
const
viewItemIndex
=
isLastSash
?
index
:
index
+
1
;
const
viewItem
=
this
.
viewItems
[
viewItemIndex
];
const
newMinDelta
=
(
viewItem
.
view
.
maximumSize
-
viewItem
.
size
)
;
const
newMaxDelta
=
(
viewItem
.
size
-
viewItem
.
view
.
minimumSize
)
;
const
newMinDelta
=
viewItem
.
size
-
viewItem
.
view
.
maximumSize
;
const
newMaxDelta
=
viewItem
.
size
-
viewItem
.
view
.
minimumSize
;
const
resizeIndex
=
isLastSash
?
index
-
1
:
index
+
1
;
this
.
resize
(
resizeIndex
,
-
newDelta
,
newSizes
,
undefined
,
undefined
,
newMinDelta
,
newMaxDelta
);
...
...
@@ -492,7 +491,7 @@ export class SplitView implements IDisposable {
sizes
=
this
.
viewItems
.
map
(
i
=>
i
.
size
),
lowPriorityIndex
?:
number
,
highPriorityIndex
?:
number
,
overloadMinDelta
:
number
=
Number
.
POSI
TIVE_INFINITY
,
overloadMinDelta
:
number
=
Number
.
NEGA
TIVE_INFINITY
,
overloadMaxDelta
:
number
=
Number
.
POSITIVE_INFINITY
):
number
{
if
(
index
<
0
||
index
>=
this
.
viewItems
.
length
)
{
...
...
@@ -518,14 +517,12 @@ export class SplitView implements IDisposable {
const
downItems
=
downIndexes
.
map
(
i
=>
this
.
viewItems
[
i
]);
const
downSizes
=
downIndexes
.
map
(
i
=>
sizes
[
i
]);
const
collapseUp
=
upIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
sizes
[
i
]
-
this
.
viewItems
[
i
].
view
.
minimumSize
),
0
);
const
expandUp
=
upIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
this
.
viewItems
[
i
].
view
.
maximumSize
-
sizes
[
i
]),
0
);
const
collapseDown
=
downIndexes
.
length
===
0
?
Number
.
POSITIVE_INFINITY
:
downIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
sizes
[
i
]
-
this
.
viewItems
[
i
].
view
.
minimumSize
),
0
);
const
expandDown
=
downIndexes
.
length
===
0
?
Number
.
POSITIVE_INFINITY
:
downIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
this
.
viewItems
[
i
].
view
.
maximumSize
-
sizes
[
i
]),
0
);
const
minDelta
=
-
Math
.
min
(
collapseUp
,
expandDown
,
overloadMinDelta
);
const
maxDelta
=
Math
.
min
(
collapseDown
,
expandUp
,
overloadMaxDelta
);
const
minDeltaUp
=
upIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
this
.
viewItems
[
i
].
view
.
minimumSize
-
sizes
[
i
]),
0
);
const
maxDeltaUp
=
upIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
this
.
viewItems
[
i
].
view
.
maximumSize
-
sizes
[
i
]),
0
);
const
maxDeltaDown
=
downIndexes
.
length
===
0
?
Number
.
POSITIVE_INFINITY
:
downIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
sizes
[
i
]
-
this
.
viewItems
[
i
].
view
.
minimumSize
),
0
);
const
minDeltaDown
=
downIndexes
.
length
===
0
?
Number
.
NEGATIVE_INFINITY
:
downIndexes
.
reduce
((
r
,
i
)
=>
r
+
(
sizes
[
i
]
-
this
.
viewItems
[
i
].
view
.
maximumSize
),
0
);
const
minDelta
=
Math
.
max
(
minDeltaUp
,
minDeltaDown
,
overloadMinDelta
);
const
maxDelta
=
Math
.
min
(
maxDeltaDown
,
maxDeltaUp
,
overloadMaxDelta
);
delta
=
clamp
(
delta
,
minDelta
,
maxDelta
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录