Network.Tox.DHT.DhtState

Documentation

data ListStamp

Constructors

ListStamp

Fields

• listTime :: Timestamp
• listBootstrappedTimes :: Int

Instances

Eq ListStamp

Defined in Network.Tox.DHT.DhtState

Methods

(==) :: ListStamp -> ListStamp -> Bool

(/=) :: ListStamp -> ListStamp -> Bool

Read ListStamp

Defined in Network.Tox.DHT.DhtState

Methods

readsPrec :: Int -> ReadS ListStamp

readList :: ReadS [ListStamp]

readPrec :: ReadPrec ListStamp

readListPrec :: ReadPrec [ListStamp]

Show ListStamp

Defined in Network.Tox.DHT.DhtState

Methods

showsPrec :: Int -> ListStamp -> ShowS

show :: ListStamp -> String

showList :: [ListStamp] -> ShowS

newListStamp :: Timestamp -> ListStamp

data DhtState

Constructors

DhtState

Fields

• dhtKeyPair :: KeyPair
• dhtCloseList :: KBuckets
• dhtSearchList :: Map PublicKey DhtSearchEntry
• dhtCloseListStamp :: ListStamp
• dhtPendingReplies :: PendingReplies

Instances

Eq DhtState

Defined in Network.Tox.DHT.DhtState

Methods

(==) :: DhtState -> DhtState -> Bool

(/=) :: DhtState -> DhtState -> Bool

Read DhtState

Defined in Network.Tox.DHT.DhtState

Methods

readsPrec :: Int -> ReadS DhtState

readList :: ReadS [DhtState]

readPrec :: ReadPrec DhtState

readListPrec :: ReadPrec [DhtState]

Show DhtState

Defined in Network.Tox.DHT.DhtState

Methods

showsPrec :: Int -> DhtState -> ShowS

show :: DhtState -> String

showList :: [DhtState] -> ShowS

Arbitrary DhtState

Defined in Network.Tox.DHT.DhtState

Methods

arbitrary :: Gen DhtState

shrink :: DhtState -> [DhtState]

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

DhtNodeMonad TestDhtNodeMonad

Defined in Network.Tox.DHT.Operation

_dhtKeyPair :: Lens' DhtState KeyPair

_dhtCloseListStamp :: Lens' DhtState ListStamp

_dhtCloseList :: Lens' DhtState KBuckets

_dhtSearchList :: Lens' DhtState (Map PublicKey DhtSearchEntry)

_dhtPendingReplies :: Lens' DhtState PendingReplies

empty :: Timestamp -> KeyPair -> DhtState

data DhtSearchEntry

Constructors

DhtSearchEntry

Fields

• searchNode :: Maybe NodeInfo
• searchStamp :: ListStamp
• searchClientList :: ClientList

Instances

Eq DhtSearchEntry

Defined in Network.Tox.DHT.DhtState

Methods

(==) :: DhtSearchEntry -> DhtSearchEntry -> Bool

(/=) :: DhtSearchEntry -> DhtSearchEntry -> Bool

Read DhtSearchEntry

Defined in Network.Tox.DHT.DhtState

Methods

readsPrec :: Int -> ReadS DhtSearchEntry

readList :: ReadS [DhtSearchEntry]

readPrec :: ReadPrec DhtSearchEntry

readListPrec :: ReadPrec [DhtSearchEntry]

Show DhtSearchEntry

Defined in Network.Tox.DHT.DhtState

Methods

showsPrec :: Int -> DhtSearchEntry -> ShowS

show :: DhtSearchEntry -> String

showList :: [DhtSearchEntry] -> ShowS

_searchNode :: Lens' DhtSearchEntry (Maybe NodeInfo)

_searchStamp :: Lens' DhtSearchEntry ListStamp

_searchClientList :: Lens' DhtSearchEntry ClientList

searchEntryClientListSize :: Int

emptySearchEntry :: Timestamp -> PublicKey -> DhtSearchEntry

addSearchKey :: Timestamp -> PublicKey -> DhtState -> DhtState

removeSearchKey :: PublicKey -> DhtState -> DhtState

containsSearchKey :: PublicKey -> DhtState -> Bool

traverseNodeLists :: Applicative f => (forall l. NodeList l => l -> f l) -> DhtState -> f DhtState

foldMapNodeLists :: Monoid m => (forall l. NodeList l => l -> m) -> DhtState -> m

mapNodeLists :: (forall l. NodeList l => l -> l) -> DhtState -> DhtState

size :: DhtState -> Int

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

removeNode :: PublicKey -> DhtState -> DhtState

viable :: NodeInfo -> DhtState -> Bool

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

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

takeClosestNodesTo :: Int -> PublicKey -> DhtState -> [NodeInfo]

mapBuckets :: (KBuckets -> KBuckets) -> DhtState -> DhtState

mapSearchEntry :: (DhtSearchEntry -> DhtSearchEntry) -> DhtState -> DhtState

mapSearchClientLists :: (ClientList -> ClientList) -> DhtState -> DhtState

updateSearchNode :: PublicKey -> Maybe NodeInfo -> DhtState -> DhtState

containsNode :: PublicKey -> DhtState -> Bool