toxcore-0.2.12: A Tox protocol implementation in Haskell
Safe HaskellNone
LanguageHaskell2010

Network.Tox.DHT.DhtState

Documentation

data ListStamp Source #

Constructors

ListStamp 

Fields

Instances

Instances details
Eq ListStamp Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

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

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

Read ListStamp Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

readsPrec :: Int -> ReadS ListStamp #

readList :: ReadS [ListStamp] #

readPrec :: ReadPrec ListStamp #

readListPrec :: ReadPrec [ListStamp] #

Show ListStamp Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

showsPrec :: Int -> ListStamp -> ShowS #

show :: ListStamp -> String #

showList :: [ListStamp] -> ShowS #

newListStamp :: Timestamp -> ListStamp Source #

data DhtState Source #

Constructors

DhtState 

Fields

Instances

Instances details
Eq DhtState Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

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

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

Read DhtState Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

readsPrec :: Int -> ReadS DhtState #

readList :: ReadS [DhtState] #

readPrec :: ReadPrec DhtState #

readListPrec :: ReadPrec [DhtState] #

Show DhtState Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

showsPrec :: Int -> DhtState -> ShowS #

show :: DhtState -> String #

showList :: [DhtState] -> ShowS #

Arbitrary DhtState Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

arbitrary :: Gen DhtState #

shrink :: DhtState -> [DhtState] #

NodeList DhtState Source #

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.

Instance details

Defined in Network.Tox.DHT.DhtState

Methods

addNode :: Timestamp -> NodeInfo -> DhtState -> DhtState Source #

removeNode :: PublicKey -> DhtState -> DhtState Source #

viable :: NodeInfo -> DhtState -> Bool Source #

baseKey :: DhtState -> PublicKey Source #

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

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

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

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

nodeListList :: DhtState -> [NodeInfo] Source #

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

lookupPublicKey :: PublicKey -> DhtState -> Maybe NodeInfo Source #

DhtNodeMonad TestDhtNodeMonad Source # 
Instance details

Defined in Network.Tox.DHT.Operation

_dhtKeyPair :: Lens' DhtState KeyPair Source #

_dhtCloseListStamp :: Lens' DhtState ListStamp Source #

_dhtCloseList :: Lens' DhtState KBuckets Source #

_dhtSearchList :: Lens' DhtState (Map PublicKey DhtSearchEntry) Source #

_dhtPendingReplies :: Lens' DhtState PendingReplies Source #

empty :: Timestamp -> KeyPair -> DhtState Source #

data DhtSearchEntry Source #

Constructors

DhtSearchEntry 

Fields

Instances

Instances details
Eq DhtSearchEntry Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

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

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

Read DhtSearchEntry Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

readsPrec :: Int -> ReadS DhtSearchEntry #

readList :: ReadS [DhtSearchEntry] #

readPrec :: ReadPrec DhtSearchEntry #

readListPrec :: ReadPrec [DhtSearchEntry] #

Show DhtSearchEntry Source # 
Instance details

Defined in Network.Tox.DHT.DhtState

Methods

showsPrec :: Int -> DhtSearchEntry -> ShowS #

show :: DhtSearchEntry -> String #

showList :: [DhtSearchEntry] -> ShowS #

_searchNode :: Lens' DhtSearchEntry (Maybe NodeInfo) Source #

_searchStamp :: Lens' DhtSearchEntry ListStamp Source #

_searchClientList :: Lens' DhtSearchEntry ClientList Source #

searchEntryClientListSize :: Int Source #

emptySearchEntry :: Timestamp -> PublicKey -> DhtSearchEntry Source #

addSearchKey :: Timestamp -> PublicKey -> DhtState -> DhtState Source #

removeSearchKey :: PublicKey -> DhtState -> DhtState Source #

containsSearchKey :: PublicKey -> DhtState -> Bool Source #

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

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

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

size :: DhtState -> Int Source #

addNode :: Timestamp -> NodeInfo -> DhtState -> DhtState Source #

removeNode :: PublicKey -> DhtState -> DhtState Source #

viable :: NodeInfo -> DhtState -> Bool Source #

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

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

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

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

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

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

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

containsNode :: PublicKey -> DhtState -> Bool Source #