pub struct LookupState {
pub target: Key,
pub queried: HashMap<PeerId, Instant>,
pub to_query: VecDeque<DHTNode>,
pub closest: Vec<DHTNode>,
pub started_at: Instant,
pub alpha: usize,
}
Expand description
DHT lookup state for iterative queries
Fields§
§target: Key
Target key
queried: HashMap<PeerId, Instant>
Nodes queried so far
to_query: VecDeque<DHTNode>
Nodes to query next
closest: Vec<DHTNode>
Closest nodes found
started_at: Instant
Lookup start time
alpha: usize
Maximum nodes to query in parallel
Implementations§
Source§impl LookupState
impl LookupState
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LookupState
impl RefUnwindSafe for LookupState
impl Send for LookupState
impl Sync for LookupState
impl Unpin for LookupState
impl UnwindSafe for LookupState
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more