AaronFiore/electrum
1
0
Fork 0
Code Activity

Merge pull request #6740 from bitromortac/lnrater-followup

Browse Source 
lnrater: follow-up for save channel db attribute accesses
This commit is contained in:
ghost43
2020-11-17 16:05:18 +00:00
committed by GitHub
parent 59e9337be0 96c9a483d0
commit 5f39a2f29c
2 changed files with 7 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
electrum/channel_db.py
View File

@@ -762,11 +762,11 @@ class ChannelDB(SqlDB):
def get_node_infos(self) -> Dict[bytes, NodeInfo]: def get_node_infos(self) -> Dict[bytes, NodeInfo]:
with self.lock: with self.lock:
return self._nodes return self._nodes.copy()
def get_node_policies(self) -> Dict[Tuple[bytes, ShortChannelID], Policy]: def get_node_policies(self) -> Dict[Tuple[bytes, ShortChannelID], Policy]:
with self.lock: with self.lock:
return self._policies return self._policies.copy()
def to_dict(self) -> dict: def to_dict(self) -> dict:
""" Generates a graph representation in terms of a dictionary. """ Generates a graph representation in terms of a dictionary.

8
electrum/lnrater.py
View File

@@ -214,9 +214,11 @@ class LNRater(Logger):
heuristics = [] heuristics = []
heuristics_weights = [] heuristics_weights = []
# example of how we could construct a scalar score for nodes # Construct an average score which leads to recommendation of nodes
# this is probably not what we want to to, this is roughly # with low fees, large capacity and reasonable number of channels.
# preferential attachment # This is somewhat akin to preferential attachment, but low fee
# nodes are more favored. Here we make a compromise between user
# comfort and decentralization, tending towards user comfort.
# number of channels # number of channels
heuristics.append(stats.number_channels / max_num_chan) heuristics.append(stats.number_channels / max_num_chan)