Sorting to make it easier to read when debugging
This commit is contained in:
parent
be49ed879e
commit
4699ce9e19
|
@ -20,9 +20,12 @@ def maketree(descendants):
|
|||
reps.add(descendant.id)
|
||||
reps = getreps(descendant.in_reply_to_account_id)
|
||||
reps.add(descendant.id)
|
||||
print("REPLY", descendant.id,
|
||||
descendant.in_reply_to_id,
|
||||
descendant.in_reply_to_account_id)
|
||||
seen = set()
|
||||
def onelevel(reps):
|
||||
for rep in reps:
|
||||
for rep in sorted(reps):
|
||||
if rep in seen: continue
|
||||
seen.add(rep)
|
||||
subreps = replies.get(rep)
|
||||
|
@ -30,7 +33,7 @@ def maketree(descendants):
|
|||
yield lookup[rep], onelevel(subreps)
|
||||
else:
|
||||
yield lookup[rep], ()
|
||||
for root in roots:
|
||||
for root in sorted(roots):
|
||||
seen.add(root)
|
||||
reps = replies.get(root)
|
||||
if reps:
|
||||
|
|
Loading…
Reference in New Issue