scans through a list of locations to find the location with the highest end concode_field_sep Location EMPTY concode_field_sep Point getStart concode_elem_sep boolean isCircular concode_elem_sep Sequence<C> getSubSequence concode_elem_sep Point getEnd concode_elem_sep List<Location> getSubLocations concode_elem_sep Location circularLocation concode_elem_sep boolean accept concode_elem_sep Strand getStrand concode_elem_sep boolean isBetweenCompounds concode_elem_sep Sequence<C> getRelevantSubSequence concode_elem_sep int modulateCircularIndex concode_elem_sep List<Location> getRelevantSubLocations concode_elem_sep int completeCircularPasses concode_elem_sep Location getMin concode_elem_sep int getLength concode_elem_sep Location location concode_elem_sep Location location concode_elem_sep Location scanLocations concode_elem_sep boolean isComplex
Location function ( List < Location > arg0 ) { return scanLocations ( arg0 , new LocationPredicate ( ) { @ Override public boolean accept ( Location arg1 , Location arg2 ) { int loc0 = arg2 . getEnd ( ) . compareTo ( arg1 . getEnd ( ) ) ; return loc0 > 0 ; } } ) ; }