HashSet < Integer > function ( Rectangle arg0 ) { HashSet < Integer > loc0 = new HashSet < Integer > ( ) ; for ( Integer loc1 = 0 ; loc1 < areas . size ( ) ; loc1 ++ ) { for ( Rectangle loc2 : areas . get ( loc1 ) ) { if ( loc2 . intersects ( arg0 ) ) { loc0 . add ( loc1 ) ; } } } return loc0 ; }
return a list of areas intersecting with the given rectangle concode_field_sep List<List<Rectangle>> areas concode_elem_sep String featureName concode_field_sep HashSet<Integer> getLeftAreas concode_elem_sep HashSet<Integer> getRightAreas concode_elem_sep void saveToXml concode_elem_sep int getSingleBestIntersectingArea concode_elem_sep HashSet<Integer> getBottomAreas concode_elem_sep HashSet<Integer> getTopAreas