contrib/stack/topsStack/s1_select_ion.py
def overlap(group):
    '''return snwe of the overlap of all acquistions'''

    s = max([(acquistion_snwe(x))[0] for x in group])
    n = min([(acquistion_snwe(x))[1] for x in group])
    w = max([(acquistion_snwe(x))[2] for x in group])
    e = min([(acquistion_snwe(x))[3] for x in group])

    if s >= n or w >= e:
       #raise Exception('no overlap among the acquistions')
       print('WARNING: there is no overlap among the acquistions, snwe: {}'.format([s, n, w, e]))

    return [s, n, w, e]
return snwe of the overlap of all acquistions
return snwe of the overlap of all acquistions
return snwe of the overlap of all acquistions
def overlap(group):
    s = max([(acquistion_snwe(x))[0] for x in group])
    n = min([(acquistion_snwe(x))[1] for x in group])
    w = max([(acquistion_snwe(x))[2] for x in group])
    e = min([(acquistion_snwe(x))[3] for x in group])
    if s >= n or w >= e:
       print('WARNING: there is no overlap among the acquistions, snwe: {}'.format([s, n, w, e]))
    return [s, n, w, e]
def overlap ( group ) : s = max ( [ ( acquistion_snwe ( x ) ) [ 0 ] for x in group ] ) n = min ( [ ( acquistion_snwe ( x ) ) [ 1 ] for x in group ] ) w = max ( [ ( acquistion_snwe ( x ) ) [ 2 ] for x in group ] ) e = min ( [ ( acquistion_snwe ( x ) ) [ 3 ] for x in group ] ) if s >= n or w >= e : print ( 'WARNING: there is no overlap among the acquistions, snwe: {}' . format ( [ s , n , w , e ] ) ) return [ s , n , w , e ]
return snwe of the overlap of all acquistions
return snwe of the overlap of all acquistions
'''return snwe of the overlap of all acquistions''' #raise Exception('no overlap among the acquistions')
group