fluencelabs/rust-libp2p
1
0
Fork 0
mirror of https://github.com/fluencelabs/rust-libp2p synced 2025-06-26 16:21:39 +00:00
Code Issues Projects Releases Wiki Activity

protocols/kad: Update arrayvec dependency to latest version 0.7.2 (#2644)

Browse Source
This commit is contained in:
hrxi
2022-05-16 18:52:19 +02:00
committed by GitHub
parent d69681b27c
commit efe9c07b34
3 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
protocols/kad/Cargo.toml
View File

@ -11,7 +11,7 @@ keywords = ["peer-to-peer", "libp2p", "networking"]
categories = ["network-programming", "asynchronous"] categories = ["network-programming", "asynchronous"]
[dependencies] [dependencies]
arrayvec = "0.5.1" arrayvec = "0.7.2"
bytes = "1" bytes = "1"
either = "1.5" either = "1.5"
fnv = "1.0" fnv = "1.0"

8
protocols/kad/src/kbucket.rs
View File

@ -248,7 +248,7 @@ where
iter: None, iter: None,
table: self, table: self,
buckets_iter: ClosestBucketsIter::new(distance), buckets_iter: ClosestBucketsIter::new(distance),
fmap: |b: &KBucket<TKey, _>| -> ArrayVec<_> { fmap: |b: &KBucket<TKey, _>| -> ArrayVec<_, { K_VALUE.get() }> {
b.iter().map(|(n, _)| n.key.clone()).collect() b.iter().map(|(n, _)| n.key.clone()).collect()
}, },
} }
@ -270,7 +270,7 @@ where
iter: None, iter: None,
table: self, table: self,
buckets_iter: ClosestBucketsIter::new(distance), buckets_iter: ClosestBucketsIter::new(distance),
fmap: |b: &KBucket<_, TVal>| -> ArrayVec<_> { fmap: |b: &KBucket<_, TVal>| -> ArrayVec<_, { K_VALUE.get() }> {
b.iter() b.iter()
.map(|(n, status)| EntryView { .map(|(n, status)| EntryView {
node: n.clone(), node: n.clone(),
@ -320,7 +320,7 @@ struct ClosestIter<'a, TTarget, TKey, TVal, TMap, TOut> {
/// distance of the local key to the target. /// distance of the local key to the target.
buckets_iter: ClosestBucketsIter, buckets_iter: ClosestBucketsIter,
/// The iterator over the entries in the currently traversed bucket. /// The iterator over the entries in the currently traversed bucket.
iter: Option<arrayvec::IntoIter<[TOut; K_VALUE.get()]>>, iter: Option<arrayvec::IntoIter<TOut, { K_VALUE.get() }>>,
/// The projection function / mapping applied on each bucket as /// The projection function / mapping applied on each bucket as
/// it is encountered, producing the next `iter`ator. /// it is encountered, producing the next `iter`ator.
fmap: TMap, fmap: TMap,
@ -425,7 +425,7 @@ where
TTarget: AsRef<KeyBytes>, TTarget: AsRef<KeyBytes>,
TKey: Clone + AsRef<KeyBytes>, TKey: Clone + AsRef<KeyBytes>,
TVal: Clone, TVal: Clone,
TMap: Fn(&KBucket<TKey, TVal>) -> ArrayVec<[TOut; K_VALUE.get()]>, TMap: Fn(&KBucket<TKey, TVal>) -> ArrayVec<TOut, { K_VALUE.get() }>,
TOut: AsRef<KeyBytes>, TOut: AsRef<KeyBytes>,
{ {
type Item = TOut; type Item = TOut;

2
protocols/kad/src/kbucket/bucket.rs
View File

@ -101,7 +101,7 @@ pub struct Position(usize);
#[derive(Debug, Clone)] #[derive(Debug, Clone)]
pub struct KBucket<TKey, TVal> { pub struct KBucket<TKey, TVal> {
/// The nodes contained in the bucket. /// The nodes contained in the bucket.
nodes: ArrayVec<[Node<TKey, TVal>; K_VALUE.get()]>, nodes: ArrayVec<Node<TKey, TVal>, { K_VALUE.get() }>,
/// The position (index) in `nodes` that marks the first connected node. /// The position (index) in `nodes` that marks the first connected node.
/// ///