Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
2dot5
ClickHouse
提交
e8049d34
C
ClickHouse
项目概览
2dot5
/
ClickHouse
通知
3
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
ClickHouse
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
e8049d34
编写于
6月 17, 2020
作者:
N
Nikolai Kochetov
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add OffsetsStep.
上级
69ff3a8f
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
50 addition
and
6 deletion
+50
-6
src/Interpreters/InterpreterSelectQuery.cpp
src/Interpreters/InterpreterSelectQuery.cpp
+3
-6
src/Processors/QueryPlan/OffsetsStep.cpp
src/Processors/QueryPlan/OffsetsStep.cpp
+25
-0
src/Processors/QueryPlan/OffsetsStep.h
src/Processors/QueryPlan/OffsetsStep.h
+21
-0
src/Processors/ya.make
src/Processors/ya.make
+1
-0
未找到文件。
src/Interpreters/InterpreterSelectQuery.cpp
浏览文件 @
e8049d34
...
@@ -94,6 +94,7 @@
...
@@ -94,6 +94,7 @@
#include <Processors/QueryPlan/CubeStep.h>
#include <Processors/QueryPlan/CubeStep.h>
#include <Processors/QueryPlan/FillingStep.h>
#include <Processors/QueryPlan/FillingStep.h>
#include <Processors/QueryPlan/ExtremesStep.h>
#include <Processors/QueryPlan/ExtremesStep.h>
#include <Processors/QueryPlan/OffsetsStep.h>
namespace
DB
namespace
DB
...
@@ -1852,12 +1853,8 @@ void InterpreterSelectQuery::executeOffset(QueryPipeline & pipeline)
...
@@ -1852,12 +1853,8 @@ void InterpreterSelectQuery::executeOffset(QueryPipeline & pipeline)
UInt64
limit_offset
;
UInt64
limit_offset
;
std
::
tie
(
limit_length
,
limit_offset
)
=
getLimitLengthAndOffset
(
query
,
*
context
);
std
::
tie
(
limit_length
,
limit_offset
)
=
getLimitLengthAndOffset
(
query
,
*
context
);
pipeline
.
addSimpleTransform
([
&
](
const
Block
&
header
,
QueryPipeline
::
StreamType
stream_type
)
->
ProcessorPtr
OffsetsStep
offsets_step
(
DataStream
{.
header
=
pipeline
.
getHeader
()},
limit_offset
);
{
offsets_step
.
transformPipeline
(
pipeline
);
if
(
stream_type
!=
QueryPipeline
::
StreamType
::
Main
)
return
nullptr
;
return
std
::
make_shared
<
OffsetTransform
>
(
header
,
limit_offset
,
1
);
});
}
}
}
}
...
...
src/Processors/QueryPlan/OffsetsStep.cpp
0 → 100644
浏览文件 @
e8049d34
#include <Processors/QueryPlan/OffsetsStep.h>
#include <Processors/OffsetTransform.h>
#include <Processors/QueryPipeline.h>
namespace
DB
{
OffsetsStep
::
OffsetsStep
(
const
DataStream
&
input_stream_
,
size_t
offsets_
)
:
ITransformingStep
(
input_stream_
,
input_stream_
)
,
offset
(
offsets_
)
{
}
void
OffsetsStep
::
transformPipeline
(
QueryPipeline
&
pipeline
)
{
pipeline
.
addSimpleTransform
([
&
](
const
Block
&
header
,
QueryPipeline
::
StreamType
stream_type
)
->
ProcessorPtr
{
if
(
stream_type
!=
QueryPipeline
::
StreamType
::
Main
)
return
nullptr
;
return
std
::
make_shared
<
OffsetTransform
>
(
header
,
offset
,
1
);
});
}
}
src/Processors/QueryPlan/OffsetsStep.h
0 → 100644
浏览文件 @
e8049d34
#pragma once
#include <Processors/QueryPlan/ITransformingStep.h>
#include <DataStreams/SizeLimits.h>
namespace
DB
{
class
OffsetsStep
:
public
ITransformingStep
{
public:
OffsetsStep
(
const
DataStream
&
input_stream_
,
size_t
offset_
);
String
getName
()
const
override
{
return
"Offsets"
;
}
void
transformPipeline
(
QueryPipeline
&
pipeline
)
override
;
private:
size_t
offset
;
};
}
src/Processors/ya.make
浏览文件 @
e8049d34
...
@@ -154,6 +154,7 @@ SRCS(
...
@@ -154,6 +154,7 @@ SRCS(
QueryPlan/MergeSortingStep.cpp
QueryPlan/MergeSortingStep.cpp
QueryPlan/MergingAggregatedStep.cpp
QueryPlan/MergingAggregatedStep.cpp
QueryPlan/MergingSortedStep.cpp
QueryPlan/MergingSortedStep.cpp
QueryPlan/OffsetsStep.cpp
QueryPlan/PartialSortingStep.cpp
QueryPlan/PartialSortingStep.cpp
QueryPlan/ReadFromPreparedSource.cpp
QueryPlan/ReadFromPreparedSource.cpp
QueryPlan/ReadFromStorageStep.cpp
QueryPlan/ReadFromStorageStep.cpp
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录