chore: update jsonrpsee to v0.10.1 (#11173)

* fix(bin/node): remove unsed dep jsonrpsee

* chore(remote ext): update jsonrpsee v0.10.1

* chore(try runtime): update jsonrpsee v0.10.1

* Update utils/frame/try-runtime/cli/src/commands/follow_chain.rs

* cargo fmt
This commit is contained in:
Niklas Adolfsson
2022-04-07 08:47:36 +02:00
committed by GitHub
parent fc4bd3c4fd
commit 1df943cd6d
10 changed files with 54 additions and 108 deletions
+2 -2
View File
@@ -129,7 +129,7 @@ impl PeersetHandle {
/// Has no effect if the node was already a reserved peer.
///
/// > **Note**: Keep in mind that the networking has to know an address for this node,
/// > otherwise it will not be able to connect to it.
/// > otherwise it will not be able to connect to it.
pub fn add_reserved_peer(&self, set_id: SetId, peer_id: PeerId) {
let _ = self.tx.unbounded_send(Action::AddReservedPeer(set_id, peer_id));
}
@@ -232,7 +232,7 @@ pub struct SetConfig {
/// List of bootstrap nodes to initialize the set with.
///
/// > **Note**: Keep in mind that the networking has to know an address for these nodes,
/// > otherwise it will not be able to connect to them.
/// > otherwise it will not be able to connect to them.
pub bootnodes: Vec<PeerId>,
/// Lists of nodes we should always be connected to.
+4 -4
View File
@@ -25,8 +25,8 @@
//! slots.
//!
//! > Note: This module is purely dedicated to managing slots and reputations. Features such as
//! > for example connecting to some nodes in priority should be added outside of this
//! > module, rather than inside.
//! > for example connecting to some nodes in priority should be added outside of this
//! > module, rather than inside.
use libp2p::PeerId;
use log::error;
@@ -50,8 +50,8 @@ pub struct PeersState {
/// List of nodes that we know about.
///
/// > **Note**: This list should really be ordered by decreasing reputation, so that we can
/// easily select the best node to connect to. As a first draft, however, we don't
/// sort, to make the logic easier.
/// > easily select the best node to connect to. As a first draft, however, we don't sort, to
/// > make the logic easier.
nodes: HashMap<PeerId, Node>,
/// Configuration of each set. The size of this `Vec` is never modified.