1#include <test/csf/BasicNetwork.h>
2#include <test/csf/Scheduler.h>
4#include <xrpl/beast/unit_test.h>
31 using namespace std::chrono_literals;
35 for (
auto const link : net.links(
this))
36 net.send(
this, link.target, [&, to = link.target] { to->receive(net,
this, 1); });
52 for (
auto const link : net.links(
this))
53 net.send(
this, link.target, [&, mm = m, to = link.target] { to->receive(net,
this, mm); });
61 using namespace std::chrono_literals;
68 BEAST_EXPECT(!net.
connect(&pv[0], &pv[0]));
69 BEAST_EXPECT(net.
connect(&pv[0], &pv[1], 1s));
70 BEAST_EXPECT(net.
connect(&pv[1], &pv[2], 1s));
71 BEAST_EXPECT(!net.
connect(&pv[0], &pv[1]));
73 peer.start(scheduler, net);
74 BEAST_EXPECT(scheduler.
step_for(0s));
75 BEAST_EXPECT(scheduler.
step_for(1s));
76 BEAST_EXPECT(scheduler.
step());
77 BEAST_EXPECT(!scheduler.
step());
78 BEAST_EXPECT(!scheduler.
step_for(1s));
79 net.
send(&pv[0], &pv[1], [] {});
80 net.
send(&pv[1], &pv[0], [] {});
85 auto const links = net.
links(&pv[1]);
88 BEAST_EXPECT(net.
disconnect(&pv[1], links[0].target));
98 using namespace std::chrono_literals;
101 BEAST_EXPECT(net.
connect(0, 1, 1s));
102 BEAST_EXPECT(net.
connect(0, 2, 2s));
105 net.
send(0, 1, [&]() { delivered.
insert(1); });
106 net.
send(0, 2, [&]() { delivered.
insert(2); });
108 scheduler.
in(1000ms, [&]() { BEAST_EXPECT(net.
disconnect(0, 2)); });
109 scheduler.
in(1100ms, [&]() { BEAST_EXPECT(net.
connect(0, 2)); });
126BEAST_DEFINE_TESTSUITE(BasicNetwork, csf,
xrpl);
void run() override
Runs the suite.
Peer to peer network simulator.
bool connect(Peer const &from, Peer const &to, duration const &delay=std::chrono::seconds{0})
Connect two peers.
auto links(Peer const &from)
Return the range of active links.
bool disconnect(Peer const &peer1, Peer const &peer2)
Break a link.
void send(Peer const &from, Peer const &to, Function &&f)
Send a message to a peer.
Simulated discrete-event scheduler.
cancel_token in(duration const &delay, Function &&f)
Schedule an event after a specified duration passes.
bool step()
Run the scheduler until no events remain.
bool step_for(std::chrono::duration< Period, Rep > const &amount)
Run the scheduler until time has elapsed.
T emplace_back(T... args)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
bool set(T &target, std::string const &name, Section const §ion)
Set a value from a configuration Section If the named value is not found or doesn't parse as a T,...
void receive(Net &net, Peer *from, int m)
Peer(Peer const &)=default
void start(csf::Scheduler &scheduler, Net &net)