pezkuwichain/pezkuwi-subxt
1
0
Fork 0
mirror of https://github.com/pezkuwichain/pezkuwi-subxt.git synced 2026-06-13 22:11:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add BoundedVec::sort_by_key (#11998)

Browse Source 
Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io>
This commit is contained in:
Oliver Tale-Yazdi
2022-08-10 10:39:24 +02:00
committed by GitHub
parent a685582bfd
commit 85e2092d8f
1 changed files with 19 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
substrate/primitives/runtime/src/bounded/bounded_vec.rs
+19
View File
@@ -319,6 +319,17 @@ impl<T, S> BoundedVec<T, S> {
self.0.sort_by(compare) self.0.sort_by(compare)
} }
/// Exactly the same semantics as [`slice::sort_by_key`].
///
/// This is safe since sorting cannot change the number of elements in the vector.
pub fn sort_by_key<K, F>(&mut self, f: F)
where
F: FnMut(&T) -> K,
K: sp_std::cmp::Ord,
{
self.0.sort_by_key(f)
}
/// Exactly the same semantics as [`slice::sort`]. /// Exactly the same semantics as [`slice::sort`].
/// ///
/// This is safe since sorting cannot change the number of elements in the vector. /// This is safe since sorting cannot change the number of elements in the vector.
@@ -1189,4 +1200,12 @@ pub mod test {
b1.iter().map(|x| x + 1).rev().take(2).try_collect(); b1.iter().map(|x| x + 1).rev().take(2).try_collect();
assert!(b2.is_err()); assert!(b2.is_err());
} }
#[test]
fn bounded_vec_sort_by_key_works() {
let mut v: BoundedVec<i32, ConstU32<5>> = bounded_vec![-5, 4, 1, -3, 2];
// Sort by absolute value.
v.sort_by_key(|k| k.abs());
assert_eq!(v, vec![1, 2, -3, 4, -5]);
}
} }