Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
hanoi2005
redis
提交
ba0dc0be
R
redis
项目概览
hanoi2005
/
redis
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
redis
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
ba0dc0be
编写于
4月 03, 2014
作者:
A
antirez
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
PFSELFTEST improved to test the approximation error.
上级
c2cd4871
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
35 addition
and
6 deletion
+35
-6
src/hyperloglog.c
src/hyperloglog.c
+35
-6
未找到文件。
src/hyperloglog.c
浏览文件 @
ba0dc0be
...
...
@@ -628,18 +628,17 @@ void pfmergeCommand(redisClient *c) {
}
/* This command performs a self-test of the HLL registers implementation.
* Something that is not easy to test from within the outside.
*
* The test is conceived to test that the different counters of our data
* structure are accessible and that setting their values both result in
* the correct value to be retained and not affect adjacent values. */
* Something that is not easy to test from within the outside. */
#define REDIS_HLL_TEST_CYCLES 1000
void
pfselftestCommand
(
redisClient
*
c
)
{
int
j
,
i
;
sds
bitcounters
=
sdsnewlen
(
NULL
,
REDIS_HLL_SIZE
);
uint8_t
bytecounters
[
REDIS_HLL_REGISTERS
];
/* Test 1: access registers.
* The test is conceived to test that the different counters of our data
* structure are accessible and that setting their values both result in
* the correct value to be retained and not affect adjacent values. */
for
(
j
=
0
;
j
<
REDIS_HLL_TEST_CYCLES
;
j
++
)
{
/* Set the HLL counters and an array of unsigned byes of the
* same size to the same set of random values. */
...
...
@@ -663,6 +662,36 @@ void pfselftestCommand(redisClient *c) {
}
}
/* Test 2: approximation error.
* The test is adds unique elements and check that the estimated value
* is always reasonable bounds.
*
* We check that the error is smaller than 4 times than the expected
* standard error, to make it very unlikely for the test to fail because
* of a "bad" run. */
memset
(
bitcounters
,
0
,
REDIS_HLL_SIZE
);
double
relerr
=
1
.
04
/
sqrt
(
REDIS_HLL_REGISTERS
);
int64_t
checkpoint
=
1000
;
uint64_t
seed
=
(
uint64_t
)
rand
()
|
(
uint64_t
)
rand
()
<<
32
;
uint64_t
ele
;
for
(
j
=
1
;
j
<=
10000000
;
j
++
)
{
ele
=
j
^
seed
;
hllAdd
((
uint8_t
*
)
bitcounters
,(
unsigned
char
*
)
&
ele
,
sizeof
(
ele
));
if
(
j
==
checkpoint
)
{
int64_t
abserr
=
checkpoint
-
(
int64_t
)
hllCount
((
uint8_t
*
)
bitcounters
);
if
(
abserr
<
0
)
abserr
=
-
abserr
;
if
(
abserr
>
(
uint64_t
)(
relerr
*
4
*
checkpoint
))
{
addReplyErrorFormat
(
c
,
"TESTFAILED Too big error. card:%llu abserr:%llu"
,
(
unsigned
long
long
)
checkpoint
,
(
unsigned
long
long
)
abserr
);
goto
cleanup
;
}
checkpoint
*=
10
;
}
}
/* Success! */
addReply
(
c
,
shared
.
ok
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录