Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
2dot5
ClickHouse
提交
f0800a07
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,发现更多精彩内容 >>
未验证
提交
f0800a07
编写于
12月 07, 2020
作者:
A
alexey-milovidov
提交者:
GitHub
12月 07, 2020
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #17700 from ClickHouse/tavplubix-patch-3
Fix sequential number in TestKeeper
上级
4a45874b
88bc73df
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
5 addition
and
5 deletion
+5
-5
src/Common/ZooKeeper/TestKeeper.cpp
src/Common/ZooKeeper/TestKeeper.cpp
+5
-5
未找到文件。
src/Common/ZooKeeper/TestKeeper.cpp
浏览文件 @
f0800a07
...
@@ -216,7 +216,6 @@ std::pair<ResponsePtr, Undo> TestKeeperCreateRequest::process(TestKeeper::Contai
...
@@ -216,7 +216,6 @@ std::pair<ResponsePtr, Undo> TestKeeperCreateRequest::process(TestKeeper::Contai
if
(
is_sequential
)
if
(
is_sequential
)
{
{
auto
seq_num
=
it
->
second
.
seq_num
;
auto
seq_num
=
it
->
second
.
seq_num
;
++
it
->
second
.
seq_num
;
std
::
stringstream
seq_num_str
;
// STYLE_CHECK_ALLOW_STD_STRING_STREAM
std
::
stringstream
seq_num_str
;
// STYLE_CHECK_ALLOW_STD_STRING_STREAM
seq_num_str
.
exceptions
(
std
::
ios
::
failbit
);
seq_num_str
.
exceptions
(
std
::
ios
::
failbit
);
...
@@ -225,18 +224,19 @@ std::pair<ResponsePtr, Undo> TestKeeperCreateRequest::process(TestKeeper::Contai
...
@@ -225,18 +224,19 @@ std::pair<ResponsePtr, Undo> TestKeeperCreateRequest::process(TestKeeper::Contai
path_created
+=
seq_num_str
.
str
();
path_created
+=
seq_num_str
.
str
();
}
}
/// Increment sequential number even if node is not sequential
++
it
->
second
.
seq_num
;
response
.
path_created
=
path_created
;
response
.
path_created
=
path_created
;
container
.
emplace
(
path_created
,
std
::
move
(
created_node
));
container
.
emplace
(
path_created
,
std
::
move
(
created_node
));
undo
=
[
&
container
,
path_created
,
is_sequential
=
is_sequential
,
parent_path
=
it
->
first
]
undo
=
[
&
container
,
path_created
,
parent_path
=
it
->
first
]
{
{
container
.
erase
(
path_created
);
container
.
erase
(
path_created
);
auto
&
undo_parent
=
container
.
at
(
parent_path
);
auto
&
undo_parent
=
container
.
at
(
parent_path
);
--
undo_parent
.
stat
.
cversion
;
--
undo_parent
.
stat
.
cversion
;
--
undo_parent
.
stat
.
numChildren
;
--
undo_parent
.
stat
.
numChildren
;
--
undo_parent
.
seq_num
;
if
(
is_sequential
)
--
undo_parent
.
seq_num
;
};
};
++
it
->
second
.
stat
.
cversion
;
++
it
->
second
.
stat
.
cversion
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录