Henry de Valence 027bdc8465 Rework initial crawler logic. ... This splits out the connection handling code into a try_connect closure, which could be refactored into a Service of its own. On creation, when we are likely to have very few peers, launch many concurrent connections to the first few candidates in the initial candidate set, before continuing to grow the peer set according to demand signals.		2019-10-22 19:06:08 -07:00
..
peer	bugfix: ensure the PeerServer always calls fail_with before exit	2019-10-22 17:55:09 -04:00
peer_set	Move the CandidateSet to its own file.	2019-10-22 19:06:08 -07:00
protocol	Inside tokio::spawn, loop over Iterator stream and send ClientRequest	2019-10-21 15:55:18 -04:00
address_book.rs	Add an explicit tracing span to each address book.	2019-10-22 19:06:08 -07:00
config.rs	Initial work to add a crawl-and-dial task.	2019-10-22 19:06:08 -07:00
constants.rs	Add useful docstrings	2019-10-21 15:55:18 -04:00
lib.rs	Extract `TimestampData` to `AddressBook`.	2019-10-21 14:40:03 -04:00
meta_addr.rs	Rewrite AddressBook to use a BTreeSet.	2019-10-21 14:40:03 -04:00
network.rs	Add fields to zebra-network Config.	2019-10-18 16:11:01 -07:00
peer.rs	Add a Mutex<HashSet<Nonce>> to detect self-conns.	2019-10-17 09:34:18 -07:00
peer_set.rs	Rework initial crawler logic.	2019-10-22 19:06:08 -07:00
protocol.rs	Initial tower-based peer implementation. (#17)	2019-10-07 15:36:16 -07:00
timestamp_collector.rs	Add an explicit tracing span to each address book.	2019-10-22 19:06:08 -07:00