20#include <test/csf/BasicNetwork.h>
21#include <test/csf/Scheduler.h>
23#include <xrpl/beast/unit_test.h>
50 using namespace std::chrono_literals;
54 for (
auto const link : net.links(
this))
55 net.send(
this, link.target, [&, to = link.target] {
56 to->receive(net,
this, 1);
73 for (
auto const link : net.links(
this))
74 net.send(
this, link.target, [&, mm = m, to = link.target] {
75 to->receive(net,
this, mm);
84 using namespace std::chrono_literals;
91 BEAST_EXPECT(!net.
connect(&pv[0], &pv[0]));
92 BEAST_EXPECT(net.
connect(&pv[0], &pv[1], 1s));
93 BEAST_EXPECT(net.
connect(&pv[1], &pv[2], 1s));
94 BEAST_EXPECT(!net.
connect(&pv[0], &pv[1]));
96 peer.start(scheduler, net);
97 BEAST_EXPECT(scheduler.
step_for(0s));
98 BEAST_EXPECT(scheduler.
step_for(1s));
99 BEAST_EXPECT(scheduler.
step());
100 BEAST_EXPECT(!scheduler.
step());
101 BEAST_EXPECT(!scheduler.
step_for(1s));
102 net.
send(&pv[0], &pv[1], [] {});
103 net.
send(&pv[1], &pv[0], [] {});
105 BEAST_EXPECT(!net.
disconnect(&pv[0], &pv[1]));
108 auto const links = net.
links(&pv[1]);
111 BEAST_EXPECT(net.
disconnect(&pv[1], links[0].target));
121 using namespace std::chrono_literals;
124 BEAST_EXPECT(net.
connect(0, 1, 1s));
125 BEAST_EXPECT(net.
connect(0, 2, 2s));
128 net.
send(0, 1, [&]() { delivered.
insert(1); });
129 net.
send(0, 2, [&]() { delivered.
insert(2); });
131 scheduler.
in(1000ms, [&]() { BEAST_EXPECT(net.
disconnect(0, 2)); });
132 scheduler.
in(1100ms, [&]() { BEAST_EXPECT(net.
connect(0, 2)); });
149BEAST_DEFINE_TESTSUITE(BasicNetwork, csf,
ripple);
void run() override
Runs the suite.
Peer to peer network simulator.
void send(Peer const &from, Peer const &to, Function &&f)
Send a message to a peer.
bool disconnect(Peer const &peer1, Peer const &peer2)
Break a link.
auto links(Peer const &from)
Return the range of active links.
bool connect(Peer const &from, Peer const &to, duration const &delay=std::chrono::seconds{0})
Connect two peers.
Simulated discrete-event scheduler.
bool step_for(std::chrono::duration< Period, Rep > const &amount)
Run the scheduler until time has elapsed.
bool step()
Run the scheduler until no events remain.
cancel_token in(duration const &delay, Function &&f)
Schedule an event after a specified duration passes.
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 start(csf::Scheduler &scheduler, Net &net)
Peer(Peer const &)=default
void receive(Net &net, Peer *from, int m)