Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
4c0a59bf
提交
4c0a59bf
authored
7月 11, 2014
作者:
Thomas Mueller
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
A concurrent list, to replace the array list of old roots (work in progress)
上级
0817faa6
显示空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
11 行增加
和
9 行删除
+11
-9
TestConcurrentLinkedList.java
h2/src/test/org/h2/test/store/TestConcurrentLinkedList.java
+8
-7
TestMVStoreTool.java
h2/src/test/org/h2/test/store/TestMVStoreTool.java
+3
-2
没有找到文件。
h2/src/test/org/h2/test/store/TestConcurrentLinkedList.java
浏览文件 @
4c0a59bf
...
@@ -10,7 +10,7 @@ import java.util.LinkedList;
...
@@ -10,7 +10,7 @@ import java.util.LinkedList;
import
java.util.Random
;
import
java.util.Random
;
import
java.util.concurrent.atomic.AtomicInteger
;
import
java.util.concurrent.atomic.AtomicInteger
;
import
org.h2.mvstore.Concurrent
Ring
;
import
org.h2.mvstore.Concurrent
LinkedList
;
import
org.h2.test.TestBase
;
import
org.h2.test.TestBase
;
import
org.h2.util.Task
;
import
org.h2.util.Task
;
...
@@ -32,8 +32,8 @@ public class TestConcurrentLinkedList extends TestBase {
...
@@ -32,8 +32,8 @@ public class TestConcurrentLinkedList extends TestBase {
@Override
@Override
public
void
test
()
throws
Exception
{
public
void
test
()
throws
Exception
{
testConcurrent
();
testRandomized
();
testRandomized
();
testConcurrent
();
}
}
private
void
testPerformance
()
{
private
void
testPerformance
()
{
...
@@ -48,8 +48,8 @@ public class TestConcurrentLinkedList extends TestBase {
...
@@ -48,8 +48,8 @@ public class TestConcurrentLinkedList extends TestBase {
private
void
testPerformance
(
final
boolean
stock
)
{
private
void
testPerformance
(
final
boolean
stock
)
{
System
.
out
.
print
(
stock
?
"stock "
:
"custom "
);
System
.
out
.
print
(
stock
?
"stock "
:
"custom "
);
long
start
=
System
.
currentTimeMillis
();
long
start
=
System
.
currentTimeMillis
();
//
final ConcurrentLinkedList<Integer> test = new ConcurrentLinkedList<Integer>();
final
ConcurrentLinkedList
<
Integer
>
test
=
new
ConcurrentLinkedList
<
Integer
>();
final
ConcurrentRing
<
Integer
>
test
=
new
ConcurrentRing
<
Integer
>();
//
final ConcurrentRing<Integer> test = new ConcurrentRing<Integer>();
final
LinkedList
<
Integer
>
x
=
new
LinkedList
<
Integer
>();
final
LinkedList
<
Integer
>
x
=
new
LinkedList
<
Integer
>();
final
AtomicInteger
counter
=
new
AtomicInteger
();
final
AtomicInteger
counter
=
new
AtomicInteger
();
Task
task
=
new
Task
()
{
Task
task
=
new
Task
()
{
...
@@ -107,8 +107,8 @@ public class TestConcurrentLinkedList extends TestBase {
...
@@ -107,8 +107,8 @@ public class TestConcurrentLinkedList extends TestBase {
}
}
private
void
testConcurrent
()
{
private
void
testConcurrent
()
{
//
final ConcurrentLinkedList<Integer> test = new ConcurrentLinkedList<Integer>();
final
ConcurrentLinkedList
<
Integer
>
test
=
new
ConcurrentLinkedList
<
Integer
>();
final
ConcurrentRing
<
Integer
>
test
=
new
ConcurrentRing
<
Integer
>();
//
final ConcurrentRing<Integer> test = new ConcurrentRing<Integer>();
final
AtomicInteger
counter
=
new
AtomicInteger
();
final
AtomicInteger
counter
=
new
AtomicInteger
();
final
AtomicInteger
size
=
new
AtomicInteger
();
final
AtomicInteger
size
=
new
AtomicInteger
();
Task
task
=
new
Task
()
{
Task
task
=
new
Task
()
{
...
@@ -140,7 +140,8 @@ public class TestConcurrentLinkedList extends TestBase {
...
@@ -140,7 +140,8 @@ public class TestConcurrentLinkedList extends TestBase {
private
void
testRandomized
()
{
private
void
testRandomized
()
{
Random
r
=
new
Random
(
0
);
Random
r
=
new
Random
(
0
);
for
(
int
i
=
0
;
i
<
100
;
i
++)
{
for
(
int
i
=
0
;
i
<
100
;
i
++)
{
ConcurrentRing
<
Integer
>
test
=
new
ConcurrentRing
<
Integer
>();
ConcurrentLinkedList
<
Integer
>
test
=
new
ConcurrentLinkedList
<
Integer
>();
// ConcurrentRing<Integer> test = new ConcurrentRing<Integer>();
LinkedList
<
Integer
>
x
=
new
LinkedList
<
Integer
>();
LinkedList
<
Integer
>
x
=
new
LinkedList
<
Integer
>();
StringBuilder
buff
=
new
StringBuilder
();
StringBuilder
buff
=
new
StringBuilder
();
for
(
int
j
=
0
;
j
<
10000
;
j
++)
{
for
(
int
j
=
0
;
j
<
10000
;
j
++)
{
...
...
h2/src/test/org/h2/test/store/TestMVStoreTool.java
浏览文件 @
4c0a59bf
...
@@ -51,8 +51,9 @@ public class TestMVStoreTool extends TestBase {
...
@@ -51,8 +51,9 @@ public class TestMVStoreTool extends TestBase {
}
}
}
}
s
.
close
();
s
.
close
();
MVStoreTool
.
dump
(
fileName
);
;
// TODO testing
MVStoreTool
.
dump
(
fileName
+
".new"
);
// MVStoreTool.dump(fileName);
// MVStoreTool.dump(fileName + ".new");
MVStoreTool
.
compress
(
fileName
,
fileName
+
".new"
);
MVStoreTool
.
compress
(
fileName
,
fileName
+
".new"
);
MVStore
s1
=
new
MVStore
.
Builder
().
MVStore
s1
=
new
MVStore
.
Builder
().
fileName
(
fileName
).
readOnly
().
open
();
fileName
(
fileName
).
readOnly
().
open
();
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论