fluencelabs/rust-libp2p
1
0
Fork 0
mirror of https://github.com/fluencelabs/rust-libp2p synced 2025-06-24 07:11:38 +00:00
Code Issues Projects Releases Wiki Activity

Chore/semi colons (#799)

Browse Source 
* Add helpers for easier Transports creation (#777)

* Add helpers for easier Transports creation

* Fix doctests

* Fix ' ;' occurrences
This commit is contained in:
James Ray
2018-12-19 22:22:39 +00:00
committed by Toralf Wittner
parent 83320e0347
commit f541df391a
9 changed files with 18 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
protocols/kad/src/behaviour.rs
View File

@ -479,7 +479,7 @@ where
let (query, purpose, provider_peers) = self
.active_queries
.remove(&finished_query)
.expect("finished_query was gathered when iterating active_queries ; qed");
.expect("finished_query was gathered when iterating active_queries; QED.");
match purpose {
QueryPurpose::Initialization => {},
QueryPurpose::UserRequest => {

4
protocols/kad/src/handler.rs
View File

@ -745,8 +745,8 @@ fn process_kad_request<TUserData>(
) -> Result<KademliaHandlerEvent<TUserData>, io::Error> {
match event {
KadRequestMsg::Ping => {
// TODO: implement ; in practice the PING message is never used, so we may consider
// removing it altogether
// TODO: implement; although in practice the PING message is never
// used, so we may consider removing it altogether
Err(io::Error::new(
io::ErrorKind::InvalidData,
"the PING Kademlia message is not implemented",

6
protocols/kad/src/query.rs
View File

@ -92,8 +92,8 @@ enum QueryStage {
Iterating {
/// Number of successful query results in a row that didn't find any closer node.
// TODO: this is not great, because we don't necessarily receive responses in the order
// we made the queries ; it is possible that we query multiple far-away nodes in a
// row, and obtain results before the result of the closest nodes
// we made the queries. It is possible that we query multiple far-away nodes in a
// row, and obtain results before the result of the closest nodes.
no_closer_in_a_row: usize,
},
@ -268,7 +268,7 @@ impl QueryState {
_ => (),
};
// We have enough results ; the query is done.
// We have enough results; the query is done.
if succeeded_counter
.as_ref()
.map(|&c| c >= num_results)