def sort_func(a, b):
ai, aj, pa = map(int, a.split(','))
bi, bj, pb = map(int, b.split(','))
if bi > ai or (bi == ai and bj > aj) or (bi == ai and bj == aj
and pb < pa):
return -1
return 1
def sort_func(
a, b
): #This guy will make sure that your baselines always show up in order.
ai, aj = map(int, a.split(','))
bi, bj = map(int, b.split(','))
if bi > ai or (bi == ai and bj > aj): return -1
return 1
def sort_func(a, b):
ai,aj,pa = map(int, a.split(','))
bi,bj,pb = map(int, b.split(','))
if bi > ai or (bi == ai and bj > aj) or (bi == ai and bj == aj and pb < pa): return -1
return 1
def sort_func(a,b): #This guy will make sure that your baselines always show up in order.
ai,aj = map(int,a.split(','))
bi,bj = map(int,b.split(','))
if bi > ai or (bi == ai and bj > aj): return -1
return 1
def sort_func(a, b):
ai, aj = map(int, a.split(','))
bi, bj = map(int, b.split(','))
if bi > ai or (bi == ai and bj > aj): return -1
return 1
def sort_func(a, b):
ai,aj = map(int, a.split(','))
bi,bj = map(int, b.split(','))
if bi > ai or (bi == ai and bj > aj): return -1
return 1
