Adrien Béraud
c4e75ae66c
update copyright year
2025-05-22 19:07:32 -04:00
Adrien Béraud
fafd2f0233
update copyright year
2023-06-02 23:16:04 -04:00
Adrien Béraud
c59f951e5a
update copyright
2022-03-10 19:51:25 -05:00
Adrien Béraud
95028e3770
dht: always use pseudo-RNG for non-critical random numbers
2020-02-07 00:36:42 -05:00
Adrien Béraud
616d6fe4b8
update copyright date
2020-01-03 15:14:32 -05:00
Adrien Béraud
5e92777702
fix clang-tidy warnings
2019-03-17 19:22:28 -04:00
Adrien Béraud
f418b3651f
update copyright date
2019-03-16 12:37:23 -04:00
Adrien Beraud
0e865976f9
InfoHash: unify with Hash<N>
2017-11-02 14:28:09 -04:00
Adrien Béraud
f2b9f8eeda
dht: move bucket time update to routing table
2017-10-13 01:10:09 +02:00
Adrien Béraud
97ee4b6fea
dht: move onNewNode to RoutingTable
2017-10-07 11:35:56 +02:00
Adrien Beraud
5cb5ab019f
routing table: fix invalid iterator access
...
When calling findClosestNodes with an key referencing the first bucket,
the itp iterator could point to before-begin() and dereference it.
2017-06-29 13:07:31 +02:00
Adrien Béraud
ac65ca5177
add shortcut Sp for std::shared_ptr
2017-01-24 23:38:31 -05:00
Adrien Béraud
b6dca5ccd6
dht: use new NodeStats structure to provide stats
2017-01-10 23:34:56 -05:00
Simon Désaulniers
620868b5d6
routing_table: complete connecting state resolution
...
After a connectivity change, the DHT would enter the "connecting" state in order
to try to resolve good nodes. However, the previous algorithm would
probabilistically increase time for completion each time a node would fail to
resolve. We now avoid this by prioritizing non-expired nodes in the process.
Also, a subtle error would sensibly stop the process for 30 minutes due to using
the Node::NODE_EXPIRE_TIME constant instead of Node::MAX_RESPONSE_TIME.
2017-01-03 17:48:40 -05:00
Andreas Traczyk
9e461e0960
microsoft compiler support
2016-06-02 12:17:09 -04:00
Adrien Béraud
0890ed9c4f
move routing table to a different file
2016-05-02 15:25:15 -04:00