Copyright Matus Chochlik. Distributed under the Boost Software License, Version 1.0. See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt
#include <iostream>
#include <queue>
#include <set>
namespace msgbus {
struct fibonacci_server : static_subscriber<2> {
using this_class = fibonacci_server;
using base = static_subscriber<2>;
using base::bus;
: base(
ep,
this,
auto is_ready(const message_context&, stored_message& msg_in) -> bool {
return true;
}
static auto fib(std::int64_t arg) noexcept -> std::int64_t {
return arg <= 2 ? 1 : fib(arg - 2) + fib(arg - 1);
}
auto calculate(const message_context&, stored_message& msg_in) -> bool {
std::int64_t arg{0};
std::int64_t result{0};
auto tup = std::tie(arg, result);
block_data_source source(msg_in.content());
fast_deserializer_backend read_backend(source);
result = fib(arg);
EAGINE_MAYBE_UNUSED(result);
std::array<byte, 64> buffer{};
block_data_sink sink(
cover(buffer));
fast_serializer_backend write_backend(sink);
message_view msg_out{sink.done()};
msg_out.set_serializer_id(write_backend.type_id());
return true;
}
};
struct fibonacci_client : static_subscriber<2> {
using this_class = fibonacci_client;
using base = static_subscriber<2>;
using base::bus;
: base(
ep,
this,
void enqueue(std::int64_t arg) {
_remaining.push(arg);
}
if(!_remaining.empty()) {
}
}
auto dispatch(const message_context&, stored_message& msg_in) -> bool {
if(!_remaining.empty()) {
auto arg = _remaining.front();
_pending.insert(arg);
_remaining.pop();
std::array<byte, 32> buffer{};
block_data_sink sink(
cover(buffer));
fast_serializer_backend write_backend(sink);
message_view msg_out{sink.done()};
msg_out.set_serializer_id(write_backend.type_id());
}
return true;
}
auto print(const message_context&, stored_message& msg_in) -> bool {
std::int64_t arg{0};
std::int64_t result{0};
auto tup = std::tie(arg, result);
block_data_source source(msg_in.content());
fast_deserializer_backend read_backend(source);
std::cout << "fib(" << arg << ") = " << result << std::endl;
_pending.erase(arg);
return true;
}
auto is_done() const {
return _remaining.empty() && _pending.empty();
}
private:
std::queue<std::int64_t> _remaining{};
std::set<std::int64_t> _pending{};
};
}
auto main(main_ctx& ctx) -> int {
auto acceptor = std::make_unique<msgbus::direct_acceptor>(ctx);
msgbus::endpoint server_endpoint(
EAGINE_ID(Server), ctx);
msgbus::endpoint client_endpoint(
EAGINE_ID(Client), ctx);
server_endpoint.add_connection(acceptor->make_connection());
client_endpoint.add_connection(acceptor->make_connection());
router.add_acceptor(std::move(acceptor));
msgbus::fibonacci_server server(server_endpoint);
msgbus::fibonacci_client client(client_endpoint);
for(std::int64_t i = 1; i <= n; ++i) {
client.enqueue(i);
}
while(!client.is_done()) {
client_endpoint.update();
server_endpoint.update();
client.update();
client.process_one();
server.process_one();
}
return 0;
}
}