List < Point > function ( ) { ArrayList < Point > loc0 = new ArrayList < Point > ( ) ; for ( Tile loc1 : this . list ) { for ( Point loc2 : loc1 . cornerPoints ) if ( ! loc0 . contains ( loc2 ) ) loc0 . add ( loc2 ) ; } return loc0 ; }
returns the points that form the tiles of this tilelist . the implementation is rather inefficient and is intended only for debugging purposes . concode_field_sep List<Expression> storedFormulasY concode_elem_sep List<Expression> storedFormulasX concode_elem_sep Tile initialTile concode_elem_sep List<TileList> storedTileLists concode_elem_sep OpsAndBoundsList opsAndBoundsList concode_elem_sep int currentProjectionIndex concode_elem_sep List<List<Expression>> storedFormulas concode_elem_sep int dim concode_elem_sep ArrayList<Tile> list concode_elem_sep double tolerance concode_field_sep void addNewPoint concode_elem_sep int getNumberOfDifferentPoints concode_elem_sep Point getCandidateHyperplane concode_elem_sep void clearStoredTileLists concode_elem_sep List<Point> getRealPoints concode_elem_sep List<List<Expression>> getStoredFormulas concode_elem_sep OpsAndBoundsList getOpsAndBoundsList concode_elem_sep List<Expression> getStoredFormulasX concode_elem_sep int getDimension concode_elem_sep List<Expression> getStoredFormulasY concode_elem_sep String toString concode_elem_sep Point getFreshRealCandidateHyperplane concode_elem_sep List<Point> getPointsWithoutCovered concode_elem_sep List<TileList> getStoredTileLists concode_elem_sep void splitTilesByPoint