lbry-sdk/lbrynet/dht/datastore.py

67 lines
2.1 KiB
Python
Raw Normal View History

2015-08-20 17:27:15 +02:00
#!/usr/bin/env python
#
# This library is free software, distributed under the terms of
# the GNU Lesser General Public License Version 3, or any later version.
# See the COPYING file included in this archive
#
# The docstrings in this module contain epytext markup; API documentation
# may be created by processing this file with epydoc: http://epydoc.sf.net
import UserDict
import time
import constants
class DataStore(UserDict.DictMixin):
""" Interface for classes implementing physical storage (for data
published via the "STORE" RPC) for the Kademlia DHT
2016-12-14 00:08:29 +01:00
2015-08-20 17:27:15 +02:00
@note: This provides an interface for a dict-like object
"""
2017-03-31 19:32:43 +02:00
2015-08-20 17:27:15 +02:00
def keys(self):
""" Return a list of the keys in this data store """
def addPeerToBlob(self, key, value, lastPublished, originallyPublished, originalPublisherID):
pass
2017-03-31 19:32:43 +02:00
2015-08-20 17:27:15 +02:00
class DictDataStore(DataStore):
""" A datastore using an in-memory Python dictionary """
2017-03-31 19:32:43 +02:00
2015-08-20 17:27:15 +02:00
def __init__(self):
# Dictionary format:
# { <key>: (<value>, <lastPublished>, <originallyPublished> <originalPublisherID>) }
self._dict = {}
def keys(self):
""" Return a list of the keys in this data store """
return self._dict.keys()
def removeExpiredPeers(self):
now = int(time.time())
2017-03-31 19:32:43 +02:00
2015-08-20 17:27:15 +02:00
def notExpired(peer):
if (now - peer[2]) > constants.dataExpireTimeout:
return False
return True
2017-03-31 19:32:43 +02:00
2015-08-20 17:27:15 +02:00
for key in self._dict.keys():
unexpired_peers = filter(notExpired, self._dict[key])
self._dict[key] = unexpired_peers
def hasPeersForBlob(self, key):
if key in self._dict and len(self._dict[key]) > 0:
return True
return False
def addPeerToBlob(self, key, value, lastPublished, originallyPublished, originalPublisherID):
if key in self._dict:
self._dict[key].append((value, lastPublished, originallyPublished, originalPublisherID))
else:
self._dict[key] = [(value, lastPublished, originallyPublished, originalPublisherID)]
def getPeersForBlob(self, key):
if key in self._dict:
return [val[0] for val in self._dict[key]]