Enum rings_core::dht::PeerRingAction
source · pub enum PeerRingAction {
None,
SomeVNode(VirtualNode),
Some(Did),
RemoteAction(Did, RemoteAction),
MultiActions(Vec<PeerRingAction>),
}Expand description
PeerRing use this to describe the result of Chord algorithm. Sometimes it’s a
direct result, sometimes it’s an action that is continued externally.
Variants§
None
No result, the whole manipulation is done internally.
SomeVNode(VirtualNode)
Found some VirtualNode.
Some(Did)
Found some node.
RemoteAction(Did, RemoteAction)
Trigger a remote action.
MultiActions(Vec<PeerRingAction>)
Trigger multiple remote actions.
Implementations§
source§impl PeerRingAction
impl PeerRingAction
sourcepub fn is_none(&self) -> bool
pub fn is_none(&self) -> bool
Returns true if the action is a PeerRingAction::None value.
sourcepub fn is_some(&self) -> bool
pub fn is_some(&self) -> bool
Returns true if the action is a PeerRingAction::Some value.
sourcepub fn is_remote(&self) -> bool
pub fn is_remote(&self) -> bool
Returns true if the action is a PeerRingAction::RemoteAction value.
sourcepub fn is_multi(&self) -> bool
pub fn is_multi(&self) -> bool
Returns true if the action is a PeerRingAction::MultiActions value.
Trait Implementations§
source§impl Chord<PeerRingAction> for PeerRing
impl Chord<PeerRingAction> for PeerRing
source§fn join(&self, did: Did) -> Result<PeerRingAction>
fn join(&self, did: Did) -> Result<PeerRingAction>
Join a ring containing a node identified by did.
This method is usually invoked to maintain successor sequence and finger table
after connect to another node.
This method will return a RemoteAction::FindSuccessorForConnect to the caller.
The caller will send it to the node identified by did, and let the node find
the successor of current node and make current node connect to that successor.
source§fn find_successor(&self, did: Did) -> Result<PeerRingAction>
fn find_successor(&self, did: Did) -> Result<PeerRingAction>
Find the successor of a Did. May return a remote action for the successor is recorded in another node.
source§fn notify(&self, did: Did) -> Result<Option<Did>>
fn notify(&self, did: Did) -> Result<Option<Did>>
Handle notification from a node that thinks it is the predecessor of current node.
The did in parameters is the Did of that node.
If that node is closer to current node or current node has no predecessor, set it to the did.
This method will return that did if it is set to the predecessor.
source§fn fix_fingers(&self) -> Result<PeerRingAction>
fn fix_fingers(&self) -> Result<PeerRingAction>
Fix finger table by finding the successor for each finger. According to the paper, this method should be called periodically. According to the paper, only one finger should be fixed at a time.
source§fn check_predecessor(&self) -> Result<PeerRingAction>
fn check_predecessor(&self) -> Result<PeerRingAction>
called periodically. checks whether predecessor has failed.
source§impl ChordStorage<PeerRingAction> for PeerRing
impl ChordStorage<PeerRingAction> for PeerRing
source§fn vnode_lookup<'life0, 'async_trait>(
&'life0 self,
vid: Did
) -> Pin<Box<dyn Future<Output = Result<PeerRingAction>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn vnode_lookup<'life0, 'async_trait>(
&'life0 self,
vid: Did
) -> Pin<Box<dyn Future<Output = Result<PeerRingAction>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Look up a VirtualNode by its Did.
Always finds resource by finger table, ignoring the local cache.
If the vid is between current node and its successor, its resource should be
stored in current node.
source§fn vnode_operate<'life0, 'async_trait>(
&'life0 self,
op: VNodeOperation
) -> Pin<Box<dyn Future<Output = Result<PeerRingAction>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn vnode_operate<'life0, 'async_trait>(
&'life0 self,
op: VNodeOperation
) -> Pin<Box<dyn Future<Output = Result<PeerRingAction>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Handle VNodeOperation if the target vnode between current node and the successor of current node, otherwise find the responsible node and return as Action.
source§fn sync_vnode_with_successor<'life0, 'async_trait>(
&'life0 self,
new_successor: Did
) -> Pin<Box<dyn Future<Output = Result<PeerRingAction>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn sync_vnode_with_successor<'life0, 'async_trait>(
&'life0 self,
new_successor: Did
) -> Pin<Box<dyn Future<Output = Result<PeerRingAction>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
When the successor of a node is updated, it needs to check if there are
VirtualNodes that are no longer between current node and new_successor,
and sync them to the new successor.
source§fn local_cache_set(&self, vnode: VirtualNode)
fn local_cache_set(&self, vnode: VirtualNode)
Cache fetched vnode locally.
source§fn local_cache_get(&self, vid: Did) -> Option<VirtualNode>
fn local_cache_get(&self, vid: Did) -> Option<VirtualNode>
Get vnode from local cache.
source§impl Clone for PeerRingAction
impl Clone for PeerRingAction
source§fn clone(&self) -> PeerRingAction
fn clone(&self) -> PeerRingAction
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moresource§impl Debug for PeerRingAction
impl Debug for PeerRingAction
source§impl PartialEq<PeerRingAction> for PeerRingAction
impl PartialEq<PeerRingAction> for PeerRingAction
source§fn eq(&self, other: &PeerRingAction) -> bool
fn eq(&self, other: &PeerRingAction) -> bool
self and other values to be equal, and is used
by ==.