Network.Tox.DHT.NodeList

Documentation

class NodeList l where

Minimal complete definition

addNode, removeNode, viable, baseKey, traverseClientLists, closeNodes

Methods

addNode :: Timestamp -> NodeInfo -> l -> l

removeNode :: PublicKey -> l -> l

viable :: NodeInfo -> l -> Bool

baseKey :: l -> PublicKey

traverseClientLists :: Applicative f => (ClientList -> f ClientList) -> l -> f l

closeNodes :: PublicKey -> l -> [(Distance, NodeInfo)]

'closeNodes pub' returns the (pub',node) pairs of the Node List in increasing order of distance of pub' from pub.

foldMapClientLists :: Monoid m => (ClientList -> m) -> l -> m

copied from Data.Traversable.foldMapDefault

foldlClientLists :: (a -> ClientList -> a) -> a -> l -> a

copied from Data.Foldable.foldl

nodeListList :: l -> [NodeInfo]

foldNodes :: (a -> NodeInfo -> a) -> a -> l -> a

lookupPublicKey :: PublicKey -> l -> Maybe NodeInfo

Instances

NodeList ClientList

Defined in Network.Tox.DHT.NodeList

Methods

addNode :: Timestamp -> NodeInfo -> ClientList -> ClientList

removeNode :: PublicKey -> ClientList -> ClientList

viable :: NodeInfo -> ClientList -> Bool

baseKey :: ClientList -> PublicKey

traverseClientLists :: Applicative f => (ClientList -> f ClientList) -> ClientList -> f ClientList

closeNodes :: PublicKey -> ClientList -> [(Distance, NodeInfo)]

foldMapClientLists :: Monoid m => (ClientList -> m) -> ClientList -> m

foldlClientLists :: (a -> ClientList -> a) -> a -> ClientList -> a

nodeListList :: ClientList -> [NodeInfo]

foldNodes :: (a -> NodeInfo -> a) -> a -> ClientList -> a

lookupPublicKey :: PublicKey -> ClientList -> Maybe NodeInfo

NodeList KBuckets

Defined in Network.Tox.DHT.NodeList

Methods

addNode :: Timestamp -> NodeInfo -> KBuckets -> KBuckets

removeNode :: PublicKey -> KBuckets -> KBuckets

viable :: NodeInfo -> KBuckets -> Bool

baseKey :: KBuckets -> PublicKey

traverseClientLists :: Applicative f => (ClientList -> f ClientList) -> KBuckets -> f KBuckets

closeNodes :: PublicKey -> KBuckets -> [(Distance, NodeInfo)]

foldMapClientLists :: Monoid m => (ClientList -> m) -> KBuckets -> m

foldlClientLists :: (a -> ClientList -> a) -> a -> KBuckets -> a

nodeListList :: KBuckets -> [NodeInfo]

foldNodes :: (a -> NodeInfo -> a) -> a -> KBuckets -> a

lookupPublicKey :: PublicKey -> KBuckets -> Maybe NodeInfo

NodeList DhtState

although it is not referred to as a Node List in the spec, we make DhtState an instance of NodeList so we can use the traversal and folding functions.

Defined in Network.Tox.DHT.DhtState

Methods

addNode :: Timestamp -> NodeInfo -> DhtState -> DhtState

removeNode :: PublicKey -> DhtState -> DhtState

viable :: NodeInfo -> DhtState -> Bool

baseKey :: DhtState -> PublicKey

traverseClientLists :: Applicative f => (ClientList -> f ClientList) -> DhtState -> f DhtState

closeNodes :: PublicKey -> DhtState -> [(Distance, NodeInfo)]

foldMapClientLists :: Monoid m => (ClientList -> m) -> DhtState -> m

foldlClientLists :: (a -> ClientList -> a) -> a -> DhtState -> a

nodeListList :: DhtState -> [NodeInfo]

foldNodes :: (a -> NodeInfo -> a) -> a -> DhtState -> a

lookupPublicKey :: PublicKey -> DhtState -> Maybe NodeInfo