Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
80a9769e
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,发现更多精彩内容 >>
提交
80a9769e
编写于
1月 13, 2017
作者:
B
Benjamin Pasero
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
💄
上级
920849cc
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
17 addition
and
14 deletion
+17
-14
src/vs/base/common/labels.ts
src/vs/base/common/labels.ts
+17
-14
未找到文件。
src/vs/base/common/labels.ts
浏览文件 @
80a9769e
...
...
@@ -83,47 +83,50 @@ function getPath(arg1: URI | string | IWorkspaceProvider): string {
*/
export
function
shorten
(
paths
:
string
[]):
string
[]
{
const
ellipsis
=
'
\
u2026
'
;
let
shortenedPaths
:
string
[]
=
new
Array
(
paths
.
length
);
let
match
=
false
;
const
shortenedPaths
:
string
[]
=
new
Array
(
paths
.
length
);
// for every path
for
(
let
path
=
0
;
path
<
paths
.
length
;
path
++
)
{
let
segments
:
string
[]
=
paths
[
path
].
split
(
nativeSep
);
let
match
=
false
;
for
(
let
pathIndex
=
0
;
pathIndex
<
paths
.
length
;
pathIndex
++
)
{
const
segments
:
string
[]
=
paths
[
pathIndex
].
split
(
nativeSep
);
match
=
true
;
// pick the first shortest subpath found
for
(
let
subpathLength
=
1
;
match
&&
subpathLength
<=
segments
.
length
;
subpathLength
++
)
{
for
(
let
start
=
segments
.
length
-
subpathLength
;
match
&&
start
>=
0
;
start
--
)
{
match
=
false
;
le
t
subpath
=
segments
.
slice
(
start
,
start
+
subpathLength
).
join
(
nativeSep
);
cons
t
subpath
=
segments
.
slice
(
start
,
start
+
subpathLength
).
join
(
nativeSep
);
// that is unique to any other path
for
(
let
otherPath
=
0
;
!
match
&&
otherPath
<
paths
.
length
;
otherPath
++
)
{
if
(
otherPath
!==
path
&&
paths
[
otherPath
].
indexOf
(
subpath
)
>
-
1
)
{
// suffix subpath treated specially as we consider no match 'x' and 'x/...'
let
isSubpathEnding
:
boolean
=
(
start
+
subpathLength
===
segments
.
length
);
let
isOtherPathEnding
:
boolean
=
endsWith
(
paths
[
otherPath
],
subpath
);
for
(
let
otherPathIndex
=
0
;
!
match
&&
otherPathIndex
<
paths
.
length
;
otherPathIndex
++
)
{
// suffix subpath treated specially as we consider no match 'x' and 'x/...'
if
(
otherPathIndex
!==
pathIndex
&&
paths
[
otherPathIndex
].
indexOf
(
subpath
)
>
-
1
)
{
const
isSubpathEnding
:
boolean
=
(
start
+
subpathLength
===
segments
.
length
);
const
isOtherPathEnding
:
boolean
=
endsWith
(
paths
[
otherPathIndex
],
subpath
);
match
=
!
isSubpathEnding
||
isOtherPathEnding
;
}
}
// found unique subpath
if
(
!
match
)
{
// found unique subpath
let
result
=
subpath
;
if
(
start
+
subpathLength
<
segments
.
length
)
{
result
=
result
+
nativeSep
+
ellipsis
;
}
if
(
start
>
0
)
{
result
=
ellipsis
+
nativeSep
+
result
;
}
shortenedPaths
[
path
]
=
result
;
shortenedPaths
[
pathIndex
]
=
result
;
}
}
}
if
(
match
)
{
// use full path if no unique subpaths found
shortenedPaths
[
path
]
=
paths
[
path
];
shortenedPaths
[
pathIndex
]
=
paths
[
pathIndex
];
// use full path if no unique subpaths found
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录