mirror of
https://github.com/correl/SleekXMPP.git
synced 2024-11-24 03:00:15 +00:00
Do a weighted choice among the highest prioritized items based on weight instead of a weighted choice based on priorities.
This commit is contained in:
parent
ccc6ab1281
commit
45412fd404
1 changed files with 11 additions and 6 deletions
|
@ -168,18 +168,23 @@ class ClientXMPP(BaseXMPP):
|
|||
|
||||
addresses = {}
|
||||
intmax = 0
|
||||
topprio = 65535
|
||||
for answer in answers:
|
||||
intmax += answer.priority
|
||||
topprio = min(topprio, answer.priority)
|
||||
for answer in answers:
|
||||
if answer.priority == topprio:
|
||||
intmax += answer.weight
|
||||
addresses[intmax] = (answer.target.to_text()[:-1],
|
||||
answer.port)
|
||||
|
||||
#python3 returns a generator for dictionary keys
|
||||
priorities = [x for x in addresses.keys()]
|
||||
priorities.sort()
|
||||
items = [x for x in addresses.keys()]
|
||||
items.sort()
|
||||
|
||||
picked = random.randint(0, intmax)
|
||||
for priority in priorities:
|
||||
for item in items:
|
||||
if picked <= priority:
|
||||
address = addresses[priority]
|
||||
address = addresses[item]
|
||||
break
|
||||
|
||||
if not address:
|
||||
|
|
Loading…
Reference in a new issue