Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
taosdata
TDengine
提交
f146a81d
TDengine
项目概览
taosdata
/
TDengine
大约 1 年 前同步成功
通知
1181
Star
22014
Fork
4786
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
1
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
TDengine
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
1
Issue
1
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
f146a81d
编写于
1月 07, 2021
作者:
H
Haojun Liao
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[TD-2627]<fix>: fix crash in apercentile query.
上级
2a141587
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
55 addition
and
35 deletion
+55
-35
src/query/src/qHistogram.c
src/query/src/qHistogram.c
+3
-0
src/query/tests/histogramTest.cpp
src/query/tests/histogramTest.cpp
+52
-35
未找到文件。
src/query/src/qHistogram.c
浏览文件 @
f146a81d
...
...
@@ -143,6 +143,9 @@ SHistogramInfo* tHistogramCreateFrom(void* pBuf, int32_t numOfBins) {
SHistogramInfo
*
pHisto
=
(
SHistogramInfo
*
)
pBuf
;
pHisto
->
elems
=
(
SHistBin
*
)((
char
*
)
pBuf
+
sizeof
(
SHistogramInfo
));
for
(
int32_t
i
=
0
;
i
<
numOfBins
;
++
i
)
{
pHisto
->
elems
[
i
].
val
=
-
DBL_MAX
;
}
pHisto
->
maxEntries
=
numOfBins
;
...
...
src/query/tests/histogramTest.cpp
浏览文件 @
f146a81d
...
...
@@ -4,42 +4,9 @@
#include <iostream>
#include "taos.h"
#include "tsdb.h"
#include "tstoken.h"
#include "tutil.h"
#include "qHistogram.h"
/* test validate the names for table/database */
TEST
(
testCase
,
histogram_binary_search
)
{
SHistogramInfo
*
pHisto
=
tHistogramCreate
(
MAX_HISTOGRAM_BIN
);
pHisto
->
numOfEntries
=
10
;
for
(
int32_t
i
=
0
;
i
<
10
;
++
i
)
{
pHisto
->
elems
[
i
].
num
=
1
;
pHisto
->
elems
[
i
].
val
=
i
;
}
int32_t
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
1
);
assert
(
idx
==
1
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
9
);
assert
(
idx
==
9
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
20
);
assert
(
idx
==
10
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
-
1
);
assert
(
idx
==
0
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
3.9
);
assert
(
idx
==
4
);
free
(
pHisto
);
}
TEST
(
testCase
,
histogram_add
)
{
namespace
{
void
doHistogramAddTest
()
{
SHistogramInfo
*
pHisto
=
NULL
;
/**
...
...
@@ -99,6 +66,56 @@ TEST(testCase, histogram_add) {
tHistogramDestroy
(
&
pRes
);
free
(
res
);
}
void
doHistogramRepeatTest
()
{
SHistogramInfo
*
pHisto
=
NULL
;
struct
timeval
systemTime
;
gettimeofday
(
&
systemTime
,
NULL
);
int64_t
st
=
(
int64_t
)
systemTime
.
tv_sec
*
1000L
+
(
uint64_t
)
systemTime
.
tv_usec
/
1000
;
for
(
int32_t
i
=
0
;
i
<
1000
;
++
i
)
{
tHistogramAdd
(
&
pHisto
,
-
24
+
i
);
// tHistogramPrint(pHisto);
}
tHistogramDestroy
(
&
pHisto
);
}
}
/* test validate the names for table/database */
TEST
(
testCase
,
histogram_binary_search
)
{
SHistogramInfo
*
pHisto
=
tHistogramCreate
(
MAX_HISTOGRAM_BIN
);
pHisto
->
numOfEntries
=
10
;
for
(
int32_t
i
=
0
;
i
<
10
;
++
i
)
{
pHisto
->
elems
[
i
].
num
=
1
;
pHisto
->
elems
[
i
].
val
=
i
;
}
int32_t
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
1
);
assert
(
idx
==
1
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
9
);
assert
(
idx
==
9
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
20
);
assert
(
idx
==
10
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
-
1
);
assert
(
idx
==
0
);
idx
=
histoBinarySearch
(
pHisto
->
elems
,
pHisto
->
numOfEntries
,
3.9
);
assert
(
idx
==
4
);
free
(
pHisto
);
}
TEST
(
testCase
,
histogram_add
)
{
doHistogramAddTest
();
doHistogramRepeatTest
();
}
TEST
(
testCase
,
heapsort
)
{
// int32_t num = 20;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录