A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Cosmetics: fix "Malformed whitespace in C++" spotted by codefactor.io.
[simgrid.git]
/
examples
/
s4u
/
app-bittorrent
/
s4u-tracker.cpp
diff --git
a/examples/s4u/app-bittorrent/s4u-tracker.cpp
b/examples/s4u/app-bittorrent/s4u-tracker.cpp
index
a8a3446
..
e807d29
100644
(file)
--- a/
examples/s4u/app-bittorrent/s4u-tracker.cpp
+++ b/
examples/s4u/app-bittorrent/s4u-tracker.cpp
@@
-1,4
+1,4
@@
-/* Copyright (c) 2012-20
19
. The SimGrid Team.
+/* Copyright (c) 2012-20
20
. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
@@
-6,7
+6,6
@@
#include "s4u-tracker.hpp"
#include <algorithm>
#include "s4u-tracker.hpp"
#include <algorithm>
-#include <xbt/RngStream.h>
XBT_LOG_NEW_DEFAULT_CATEGORY(s4u_bt_tracker, "Messages specific for the tracker");
XBT_LOG_NEW_DEFAULT_CATEGORY(s4u_bt_tracker, "Messages specific for the tracker");
@@
-22,8
+21,6
@@
Tracker::Tracker(std::vector<std::string> args)
}
xbt_assert(deadline > 0, "Wrong deadline supplied");
}
xbt_assert(deadline > 0, "Wrong deadline supplied");
- stream = simgrid::s4u::this_actor::get_host()->extension<HostBittorrent>()->getStream();
-
mailbox = simgrid::s4u::Mailbox::by_name(TRACKER_MAILBOX);
XBT_INFO("Tracker launched.");
mailbox = simgrid::s4u::Mailbox::by_name(TRACKER_MAILBOX);
XBT_INFO("Tracker launched.");
@@
-55,7
+52,7
@@
void Tracker::operator()()
while (tried < max_tries) {
do {
next_peer = known_peers.begin();
while (tried < max_tries) {
do {
next_peer = known_peers.begin();
- std::advance(next_peer,
RngStream_RandInt(stream,
0, nb_known_peers - 1));
+ std::advance(next_peer,
simgrid::xbt::random::uniform_int(
0, nb_known_peers - 1));
} while (ta->getPeers().find(*next_peer) != ta->getPeers().end());
ta->addPeer(*next_peer);
tried++;
} while (ta->getPeers().find(*next_peer) != ta->getPeers().end());
ta->addPeer(*next_peer);
tried++;