Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Forever310
druid
提交
5f0ada92
D
druid
项目概览
Forever310
/
druid
与 Fork 源项目一致
从无法访问的项目Fork
通知
3
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
D
druid
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
5f0ada92
编写于
3月 27, 2014
作者:
X
Xavier Léauté
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
add HLL maxOverflow tests
上级
03c51518
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
51 addition
and
3 deletion
+51
-3
processing/src/test/java/io/druid/query/aggregation/hyperloglog/HyperLogLogCollectorTest.java
...ery/aggregation/hyperloglog/HyperLogLogCollectorTest.java
+51
-3
未找到文件。
processing/src/test/java/io/druid/query/aggregation/hyperloglog/HyperLogLogCollectorTest.java
浏览文件 @
5f0ada92
...
...
@@ -482,7 +482,7 @@ public class HyperLogLogCollectorTest
return
retVal
;
}
//
@Test // This test can help when finding potential combinations that are weird, but it's non-deterministic
@Ignore
@Test
// This test can help when finding potential combinations that are weird, but it's non-deterministic
public
void
testFoldingwithDifferentOffsets
()
throws
Exception
{
for
(
int
j
=
0
;
j
<
10
;
j
++)
{
...
...
@@ -511,7 +511,7 @@ public class HyperLogLogCollectorTest
}
}
//
@Test
@Ignore
@Test
public
void
testFoldingwithDifferentOffsets2
()
throws
Exception
{
MessageDigest
md
=
MessageDigest
.
getInstance
(
"SHA-1"
);
...
...
@@ -742,6 +742,54 @@ public class HyperLogLogCollectorTest
}
}
@Test
public
void
testMaxOverflow
()
{
HyperLogLogCollector
collector
=
HyperLogLogCollector
.
makeLatestCollector
();
collector
.
add
((
short
)
23
,
(
byte
)
16
);
Assert
.
assertEquals
(
23
,
collector
.
getMaxOverflowRegister
());
Assert
.
assertEquals
(
16
,
collector
.
getMaxOverflowValue
());
Assert
.
assertEquals
(
0
,
collector
.
getRegisterOffset
());
Assert
.
assertEquals
(
0
,
collector
.
getNumNonZeroRegisters
());
collector
.
add
((
short
)
56
,
(
byte
)
17
);
Assert
.
assertEquals
(
56
,
collector
.
getMaxOverflowRegister
());
Assert
.
assertEquals
(
17
,
collector
.
getMaxOverflowValue
());
collector
.
add
((
short
)
43
,
(
byte
)
16
);
Assert
.
assertEquals
(
56
,
collector
.
getMaxOverflowRegister
());
Assert
.
assertEquals
(
17
,
collector
.
getMaxOverflowValue
());
Assert
.
assertEquals
(
0
,
collector
.
getRegisterOffset
());
Assert
.
assertEquals
(
0
,
collector
.
getNumNonZeroRegisters
());
}
@Test
public
void
testMergeMaxOverflow
()
{
// no offset
HyperLogLogCollector
collector
=
HyperLogLogCollector
.
makeLatestCollector
();
collector
.
add
((
short
)
23
,
(
byte
)
16
);
HyperLogLogCollector
other
=
HyperLogLogCollector
.
makeLatestCollector
();
collector
.
add
((
short
)
56
,
(
byte
)
17
);
collector
.
fold
(
other
);
Assert
.
assertEquals
(
56
,
collector
.
getMaxOverflowRegister
());
Assert
.
assertEquals
(
17
,
collector
.
getMaxOverflowValue
());
// different offsets
// fill up all the buckets so we reach a registerOffset of 49
collector
=
HyperLogLogCollector
.
makeLatestCollector
();
fillBuckets
(
collector
,
(
byte
)
0
,
(
byte
)
49
);
collector
.
add
((
short
)
23
,
(
byte
)
65
);
other
=
HyperLogLogCollector
.
makeLatestCollector
();
fillBuckets
(
other
,
(
byte
)
0
,
(
byte
)
43
);
other
.
add
((
short
)
47
,
(
byte
)
67
);
collector
.
fold
(
other
);
Assert
.
assertEquals
(
47
,
collector
.
getMaxOverflowRegister
());
Assert
.
assertEquals
(
67
,
collector
.
getMaxOverflowValue
());
}
private
static
void
fillBuckets
(
HyperLogLogCollector
collector
,
byte
startOffset
,
byte
endOffset
)
{
...
...
@@ -756,7 +804,7 @@ public class HyperLogLogCollectorTest
}
// Provides a nice printout of error rates as a function of cardinality
//
@Test
@Ignore
@Test
public
void
showErrorRate
()
throws
Exception
{
HashFunction
fn
=
Hashing
.
murmur3_128
();
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录