Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
5945ecb1
V
vscode
项目概览
xxadev
/
vscode
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
V
vscode
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
5945ecb1
编写于
10月 04, 2017
作者:
J
Johannes Rieken
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
linkedlist - push/unshift
上级
b726d868
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
88 addition
and
22 deletion
+88
-22
src/vs/base/common/callbackList.ts
src/vs/base/common/callbackList.ts
+1
-1
src/vs/base/common/linkedList.ts
src/vs/base/common/linkedList.ts
+19
-2
src/vs/base/test/common/linkedList.test.ts
src/vs/base/test/common/linkedList.test.ts
+68
-19
未找到文件。
src/vs/base/common/callbackList.ts
浏览文件 @
5945ecb1
...
...
@@ -16,7 +16,7 @@ export default class CallbackList {
if
(
!
this
.
_callbacks
)
{
this
.
_callbacks
=
new
LinkedList
<
[
Function
,
any
]
>
();
}
const
remove
=
this
.
_callbacks
.
insert
([
callback
,
context
]);
const
remove
=
this
.
_callbacks
.
push
([
callback
,
context
]);
if
(
Array
.
isArray
(
bucket
))
{
bucket
.
push
({
dispose
:
remove
});
}
...
...
src/vs/base/common/linkedList.ts
浏览文件 @
5945ecb1
...
...
@@ -24,16 +24,33 @@ export class LinkedList<E> {
return
!
this
.
_first
;
}
insert
(
element
:
E
)
{
unshift
(
element
:
E
)
{
return
this
.
insert
(
element
,
false
);
}
push
(
element
:
E
)
{
return
this
.
insert
(
element
,
true
);
}
private
insert
(
element
:
E
,
atTheEnd
:
boolean
)
{
const
newNode
=
new
Node
(
element
);
if
(
!
this
.
_first
)
{
this
.
_first
=
newNode
;
this
.
_last
=
newNode
;
}
else
{
}
else
if
(
atTheEnd
)
{
// push
const
oldLast
=
this
.
_last
;
this
.
_last
=
newNode
;
newNode
.
prev
=
oldLast
;
oldLast
.
next
=
newNode
;
}
else
{
// unshift
const
oldFirst
=
this
.
_first
;
this
.
_first
=
newNode
;
newNode
.
next
=
oldFirst
;
oldFirst
.
prev
=
newNode
;
}
return
()
=>
{
...
...
src/vs/base/test/common/linkedList.test.ts
浏览文件 @
5945ecb1
...
...
@@ -21,43 +21,43 @@ suite('LinkedList', function () {
assert
.
equal
(
elements
.
length
,
0
);
}
test
(
'
Insert
/Iter
'
,
function
()
{
test
(
'
Push
/Iter
'
,
function
()
{
const
list
=
new
LinkedList
<
number
>
();
list
.
insert
(
0
);
list
.
insert
(
1
);
list
.
insert
(
2
);
list
.
push
(
0
);
list
.
push
(
1
);
list
.
push
(
2
);
assertElements
(
list
,
0
,
1
,
2
);
});
test
(
'
Insert
/Remove
'
,
function
()
{
test
(
'
Push
/Remove
'
,
function
()
{
let
list
=
new
LinkedList
<
number
>
();
let
disp
=
list
.
insert
(
0
);
list
.
insert
(
1
);
list
.
insert
(
2
);
let
disp
=
list
.
push
(
0
);
list
.
push
(
1
);
list
.
push
(
2
);
disp
();
assertElements
(
list
,
1
,
2
);
list
=
new
LinkedList
<
number
>
();
list
.
insert
(
0
);
disp
=
list
.
insert
(
1
);
list
.
insert
(
2
);
list
.
push
(
0
);
disp
=
list
.
push
(
1
);
list
.
push
(
2
);
disp
();
assertElements
(
list
,
0
,
2
);
list
=
new
LinkedList
<
number
>
();
list
.
insert
(
0
);
list
.
insert
(
1
);
disp
=
list
.
insert
(
2
);
list
.
push
(
0
);
list
.
push
(
1
);
disp
=
list
.
push
(
2
);
disp
();
assertElements
(
list
,
0
,
1
);
});
test
(
'
Insert
/toArray
'
,
function
()
{
test
(
'
Push
/toArray
'
,
function
()
{
let
list
=
new
LinkedList
<
string
>
();
list
.
insert
(
'
foo
'
);
list
.
insert
(
'
bar
'
);
list
.
insert
(
'
far
'
);
list
.
insert
(
'
boo
'
);
list
.
push
(
'
foo
'
);
list
.
push
(
'
bar
'
);
list
.
push
(
'
far
'
);
list
.
push
(
'
boo
'
);
assert
.
deepEqual
(
list
.
toArray
(),
...
...
@@ -69,4 +69,53 @@ suite('LinkedList', function () {
]
);
});
test
(
'
unshift/Iter
'
,
function
()
{
const
list
=
new
LinkedList
<
number
>
();
list
.
unshift
(
0
);
list
.
unshift
(
1
);
list
.
unshift
(
2
);
assertElements
(
list
,
2
,
1
,
0
);
});
test
(
'
unshift/Remove
'
,
function
()
{
let
list
=
new
LinkedList
<
number
>
();
let
disp
=
list
.
unshift
(
0
);
list
.
unshift
(
1
);
list
.
unshift
(
2
);
disp
();
assertElements
(
list
,
2
,
1
);
list
=
new
LinkedList
<
number
>
();
list
.
unshift
(
0
);
disp
=
list
.
unshift
(
1
);
list
.
unshift
(
2
);
disp
();
assertElements
(
list
,
2
,
0
);
list
=
new
LinkedList
<
number
>
();
list
.
unshift
(
0
);
list
.
unshift
(
1
);
disp
=
list
.
unshift
(
2
);
disp
();
assertElements
(
list
,
1
,
0
);
});
test
(
'
unshift/toArray
'
,
function
()
{
let
list
=
new
LinkedList
<
string
>
();
list
.
unshift
(
'
foo
'
);
list
.
unshift
(
'
bar
'
);
list
.
unshift
(
'
far
'
);
list
.
unshift
(
'
boo
'
);
assert
.
deepEqual
(
list
.
toArray
(),
[
'
boo
'
,
'
far
'
,
'
bar
'
,
'
foo
'
,
]
);
});
});
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录