forked from newton-blockchain/ton
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpromiseop.hpp
72 lines (62 loc) · 2.23 KB
/
promiseop.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*
This file is part of TON Blockchain Library.
TON Blockchain Library is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
TON Blockchain Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with TON Blockchain Library. If not, see <http://www.gnu.org/licenses/>.
Copyright 2020 Telegram Systems LLP
*/
#pragma once
#include "refcnt.hpp"
#include "td/actor/PromiseFuture.h"
namespace td {
template <typename S, typename T>
class BinaryPromiseMerger : public CntObject {
Result<S> first_;
Result<T> second_;
Promise<std::pair<S, T>> promise_;
std::atomic<int> pending_;
public:
BinaryPromiseMerger(Promise<std::pair<S, T>> promise) : promise_(std::move(promise)), pending_(2) {
}
static std::pair<Promise<S>, Promise<T>> split(Promise<std::pair<S, T>> promise) {
auto ref = make_ref<BinaryPromiseMerger>(std::move(promise));
auto& obj = ref.write();
return std::make_pair(obj.left(), obj.right());
}
private:
Promise<S> left() {
return [this, self = Ref<BinaryPromiseMerger>(this)](Result<S> res) {
first_ = std::move(res);
work();
};
}
Promise<T> right() {
return [this, self = Ref<BinaryPromiseMerger>(this)](Result<T> res) {
second_ = std::move(res);
work();
};
}
void work() {
if (!--pending_) {
if (first_.is_error()) {
promise_.set_error(first_.move_as_error());
} else if (second_.is_error()) {
promise_.set_error(second_.move_as_error());
} else {
promise_.set_result(std::pair<S, T>(first_.move_as_ok(), second_.move_as_ok()));
}
}
}
};
template <typename S, typename T>
std::pair<Promise<S>, Promise<T>> split_promise(Promise<std::pair<S, T>> promise) {
return BinaryPromiseMerger<S, T>::split(std::move(promise));
}
} // namespace td