pub fn within_range<T: CryptoRng + Rng>(start: &XorName, end: &XorName, rng: &mut T) -> Self {
        let mut ed25519 = Ed25519Keypair::generate(rng);
        loop {
            let name: XorName = PublicKey::Ed25519(ed25519.public).into();
            if name >= *start && name <= *end {
                return Self { ed25519, bls: None };
            }
            ed25519 = Ed25519Keypair::generate(rng);
        }
    }
/// Constructs a `NodeKeypairs` whose name is in the interval [start, end] (both endpoints inclusive).
Constructs a `NodeKeypairs` whose name is in the interval [start, end] (both endpoints inclusive).
Constructs a ` NodeKeypairs ` whose name is in the interval [ start end ] ( both endpoints inclusive ) .
pub fn within_range<T: CryptoRng + Rng>(start: &XorName, end: &XorName, rng: &mut T) -> Self {
        let mut ed25519 = Ed25519Keypair::generate(rng);
        loop {
            let name: XorName = PublicKey::Ed25519(ed25519.public).into();
            if name >= *start && name <= *end {
                return Self { ed25519, bls: None };
            }
            ed25519 = Ed25519Keypair::generate(rng);
        }
    }
pub fn within_range < T : CryptoRng + Rng > ( start : & XorName , end : & XorName , rng : & mut T ) -> Self { let mut ed25519 = Ed25519Keypair :: generate ( rng ) ; loop { let name : XorName = PublicKey :: Ed25519 ( ed25519 . public ) . into ( ) ; if name >= * start && name <= * end { return Self { ed25519 , bls : None } ; } ed25519 = Ed25519Keypair :: generate ( rng ) ; } }
Constructs a `NodeKeypairs` whose name is in the interval [start, end] (both endpoints inclusive).
Constructs a ` NodeKeypairs ` whose name is in the interval [ start end ] ( both endpoints inclusive ) .
start
&XorName
end
&XorName
rng
&mut T
start
&XorName
end
&XorName
rng
&mut T