void function ( int arg0 ) { ArrayList < PointDouble > loc0 = new ArrayList < > ( ) ; loc0 = generatePoints ( arg0 ) ; ConvexPolygon loc1 = new ConvexPolygon ( loc0 ) ; loc1 . sortVertices ( new AntiClockSort ( loc1 . getVertices ( ) ) ) ; Boolean loc2 = loc1 . isConvex ( ) ; }
isconvex bench : checks if the polygon with the given number of vertices is convex we test the worst case - > polygon vertices are ordered concode_field_sep PlaceHolder placeHolder concode_field_sep void testAddVertex concode_elem_sep void testSortVertices concode_elem_sep void testContain concode_elem_sep void testIntersects concode_elem_sep ArrayList<PointDouble> generatePoints concode_elem_sep void main concode_elem_sep void testConvexHull