mirror of https://github.com/poanetwork/hbbft.git
Sort IDs before assigning them indices in NetworkInfo.
This commit is contained in:
parent
e43baa4b8b
commit
4857b7f9c7
|
@ -21,7 +21,9 @@ where
|
||||||
N: NodeIdT,
|
N: NodeIdT,
|
||||||
{
|
{
|
||||||
fn from(i: I) -> Self {
|
fn from(i: I) -> Self {
|
||||||
let indices: BTreeMap<N, usize> = i
|
let mut ids: Vec<N> = i.into_iter().map(|id| id.borrow().clone()).collect();
|
||||||
|
ids.sort();
|
||||||
|
let indices: BTreeMap<N, usize> = ids
|
||||||
.into_iter()
|
.into_iter()
|
||||||
.enumerate()
|
.enumerate()
|
||||||
.map(|(n, id)| (id.borrow().clone(), n))
|
.map(|(n, id)| (id.borrow().clone(), n))
|
||||||
|
|
Loading…
Reference in New Issue