Flawfinder version 2.0.10, (C) 2001-2019 David A. Wheeler.
Number of rules (primarily dangerous function names) in C/C++ ruleset: 223
Examining data/cgal-5.1.1/examples/Convex_decomposition_3/list_of_convex_parts.cpp
Examining data/cgal-5.1.1/examples/Polytope_distance_d/all_furthest_neighbors_2.cpp
Examining data/cgal-5.1.1/examples/Polytope_distance_d/polytope_distance_d.cpp
Examining data/cgal-5.1.1/examples/Polytope_distance_d/width_simplex.cpp
Examining data/cgal-5.1.1/examples/Polytope_distance_d/polytope_distance_d_fast_exact.cpp
Examining data/cgal-5.1.1/examples/Set_movable_separability_2/is_pullout_direction_single_mold_trans_cast.cpp
Examining data/cgal-5.1.1/examples/Set_movable_separability_2/top_edges_single_mold_trans_cast.cpp
Examining data/cgal-5.1.1/examples/Set_movable_separability_2/pullout_directions_single_mold_trans_cast.cpp
Examining data/cgal-5.1.1/examples/Snap_rounding_2/snap_rounding_data.cpp
Examining data/cgal-5.1.1/examples/Snap_rounding_2/snap_rounding_to_integer.cpp
Examining data/cgal-5.1.1/examples/Snap_rounding_2/snap_rounding.cpp
Examining data/cgal-5.1.1/examples/BGL_surface_mesh/surface_mesh_partition.cpp
Examining data/cgal-5.1.1/examples/BGL_surface_mesh/prim.cpp
Examining data/cgal-5.1.1/examples/BGL_surface_mesh/surface_mesh_dual.cpp
Examining data/cgal-5.1.1/examples/BGL_surface_mesh/seam_mesh.cpp
Examining data/cgal-5.1.1/examples/BGL_surface_mesh/connected_components.cpp
Examining data/cgal-5.1.1/examples/BGL_surface_mesh/gwdwg.cpp
Examining data/cgal-5.1.1/examples/BGL_surface_mesh/write_inp.cpp
Examining data/cgal-5.1.1/examples/Skin_surface_3/skin_surface_subdiv.cpp
Examining data/cgal-5.1.1/examples/Skin_surface_3/skin_surface_subdiv_with_normals.cpp
Examining data/cgal-5.1.1/examples/Skin_surface_3/union_of_balls_simple.cpp
Examining data/cgal-5.1.1/examples/Skin_surface_3/skin_surface_retrieve_defining_weighted_points.cpp
Examining data/cgal-5.1.1/examples/Skin_surface_3/skin_surface_writer.h
Examining data/cgal-5.1.1/examples/Skin_surface_3/include/extract_balls_from_pdb.h
Examining data/cgal-5.1.1/examples/Skin_surface_3/skin_surface_simple.cpp
Examining data/cgal-5.1.1/examples/Skin_surface_3/union_of_balls_subdiv.cpp
Examining data/cgal-5.1.1/examples/Skin_surface_3/skin_surface_pdb_reader.cpp
Examining data/cgal-5.1.1/examples/Modular_arithmetic/modular_filter.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/transform_iterator.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/copy_polyhedron.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/distance.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/kruskal_with_stored_id.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/normals.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/range.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/incident_vertices.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/polyhedron_partition.cpp
Examining data/cgal-5.1.1/examples/BGL_polyhedron_3/kruskal.cpp
Examining data/cgal-5.1.1/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
Examining data/cgal-5.1.1/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
Examining data/cgal-5.1.1/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape_with_features.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape_with_subdomains.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_multi_domain.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape_with_optimizers.cpp
Examining data/cgal-5.1.1/examples/Interval_skip_list/isl_terrain.cpp
Examining data/cgal-5.1.1/examples/Interval_skip_list/intervals.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/repair_polygon_soup_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/stitch_borders_example_OM.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/detect_features_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/stitch_borders_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/triangulate_polyline_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/self_intersections_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/orient_polygon_soup_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_mesh_union_with_attributes.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_polyhedron_union.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_consecutive_bool_op.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/point_inside_example_OM.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/isotropic_remeshing_of_patch_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/mesh_slicer_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_mesh_union_and_intersection.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/hole_filling_example_OM.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/refine_fair_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_SM.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/locate_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/shape_smoothing_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/volume_connected_components.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/manifoldness_repair_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/hole_filling_example_LCC.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/compute_normals_example_OM.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/mesh_smoothing_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/triangulate_faces_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/triangulate_faces_example_OM.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/connected_components_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/random_perturbation_SM_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/isotropic_remeshing_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_LCC.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/face_filtered_graph_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_mesh_union.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/hausdorff_distance_remeshing_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/compute_normals_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/hole_filling_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/surface_mesh_intersection.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/hole_filling_example_SM.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/point_inside_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/orientation_pipeline_example.cpp
Examining data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_difference_remeshed.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/color.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/regular_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/parallel_insertion_and_removal_in_regular_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/adding_handles_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/info_insert_with_transform_iterator.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/find_conflicts_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/info_insert_with_zip_iterator.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/draw_triangulation_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/info_insert_with_pair_iterator_regular.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/fast_location_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/info_insert_with_pair_iterator.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/copy_triangulation_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/sequential_parallel.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/regular_with_info_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/for_loop.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/simple_triangulation_3.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/simplex.cpp
Examining data/cgal-5.1.1/examples/Triangulation_3/parallel_insertion_in_delaunay_3.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_with_symbols_2.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/map_2_constructor.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/open_path_homotopy.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/edgewidth_lcc.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/shortest_noncontractible_cycle.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_torus.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/unsew_edgewidth_repeatedly.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_double_torus.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/draw_facewidth.h
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/facewidth.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_with_symbols.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/shortest_noncontractible_cycle_2.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_with_sm_and_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_topology/edgewidth_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Filtered_kernel/Filtered_predicate.cpp
Examining data/cgal-5.1.1/examples/Filtered_kernel/Cartesian_I.h
Examining data/cgal-5.1.1/examples/Polynomial/swap_move.cpp
Examining data/cgal-5.1.1/examples/Polynomial/construction.cpp
Examining data/cgal-5.1.1/examples/Polynomial/subresultants.cpp
Examining data/cgal-5.1.1/examples/Polynomial/degree.cpp
Examining data/cgal-5.1.1/examples/Polynomial/coefficient_access.cpp
Examining data/cgal-5.1.1/examples/Polynomial/substitute.cpp
Examining data/cgal-5.1.1/examples/Polynomial/gcd_up_to_constant_factor.cpp
Examining data/cgal-5.1.1/examples/Interpolation/linear_interpolation_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/interpolation_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/nn_coordinates_with_info_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/surface_neighbor_coordinates_3.cpp
Examining data/cgal-5.1.1/examples/Interpolation/nn_coordinates_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/interpolation_vertex_with_info_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/linear_interpolation_of_vector_3.cpp
Examining data/cgal-5.1.1/examples/Interpolation/sibson_interpolation_vertex_with_info_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/rn_coordinates_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/sibson_interpolation_rn_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/nn_coordinates_3.cpp
Examining data/cgal-5.1.1/examples/Interpolation/sibson_interpolation_2.cpp
Examining data/cgal-5.1.1/examples/Interpolation/sibson_interpolation_rn_vertex_with_info_2.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-red-blue-info-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-voronoi-edges-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-count-sites-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-fast-sp-polygon-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-fast-sp-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-filtered-traits-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/print-sdg-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-voronoi-edges-exact-linf.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_Linf_2/sdg-info-set-linf.cpp
Examining data/cgal-5.1.1/examples/Polyline_simplification_2/points_and_vertices.cpp
Examining data/cgal-5.1.1/examples/Polyline_simplification_2/simplify.cpp
Examining data/cgal-5.1.1/examples/Polyline_simplification_2/simplify_polygon.cpp
Examining data/cgal-5.1.1/examples/Polyline_simplification_2/simplify_polyline.cpp
Examining data/cgal-5.1.1/examples/Polyline_simplification_2/simplify_terrain.cpp
Examining data/cgal-5.1.1/examples/BGL_LCC/normals_lcc.cpp
Examining data/cgal-5.1.1/examples/BGL_LCC/transform_iterator_lcc.cpp
Examining data/cgal-5.1.1/examples/BGL_LCC/kruskal_lcc.cpp
Examining data/cgal-5.1.1/examples/BGL_LCC/range_lcc.cpp
Examining data/cgal-5.1.1/examples/BGL_LCC/incident_vertices_lcc.cpp
Examining data/cgal-5.1.1/examples/BGL_LCC/copy_lcc.cpp
Examining data/cgal-5.1.1/examples/BGL_LCC/distance_lcc.cpp
Examining data/cgal-5.1.1/examples/Advancing_front_surface_reconstruction/reconstruction_class.cpp
Examining data/cgal-5.1.1/examples/Advancing_front_surface_reconstruction/boundaries.cpp
Examining data/cgal-5.1.1/examples/Advancing_front_surface_reconstruction/reconstruction_fct.cpp
Examining data/cgal-5.1.1/examples/Advancing_front_surface_reconstruction/reconstruction_structured.cpp
Examining data/cgal-5.1.1/examples/Advancing_front_surface_reconstruction/reconstruction_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_join.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/check_orientation.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_aabbtree.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_iterators.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_do_intersect.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_properties.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_derivation.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_kruskal.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_circulators.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_memory.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_draw_small_faces.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/draw_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh/draw_surface_mesh_small_faces.h
Examining data/cgal-5.1.1/examples/Surface_mesh/sm_bgl.cpp
Examining data/cgal-5.1.1/examples/BGL_graphcut/alpha_expansion_example.cpp
Examining data/cgal-5.1.1/examples/BGL_graphcut/face_selection_borders_regularization_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_2/nearest_neighbor.cpp
Examining data/cgal-5.1.1/examples/Point_set_2/range_search.cpp
Examining data/cgal-5.1.1/examples/Stream_lines_2/stl_regular_field.cpp
Examining data/cgal-5.1.1/examples/Stream_lines_2/stl_triangular_field.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/polylines.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/rational_functions_rational_coefficients.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/conics.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/algebraic_segments.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/io_curve_history.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/point_location_utils.h
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/bgl_primal_adapter.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/circular_arcs.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/Bezier_curves.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/vertical_ray_shooting.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/curve_history.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/io.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/tracing_counting.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/arr_inexact_construction_segments.h
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/overlay.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/dcel_extension.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/algebraic_curves.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/dual_with_data.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/incremental_insertion.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/face_extension_overlay.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/predefined_kernel.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/special_edge_insertion.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/global_removal.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/unbounded_rational_functions.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/bgl_dual_adapter.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/io_unbounded.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/conic_multiplicities.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/generic_curve_data.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/dual_lines.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/unbounded_non_intersecting.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/edge_manipulation.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/global_insertion.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/dcel_extension_io.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/polycurve_conic.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/isolated_vertices.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/arr_print.h
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/batched_point_location.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/circles.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/rational_functions.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/observer.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/spherical_insert.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/polycurve_geodesic.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/overlay_unbounded.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/polycurves_basic.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/polycurve_circular_arc.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/face_extension.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/consolidated_curve_data.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/point_location_example.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/aggregated_insertion.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/edge_insertion.cpp
Examining data/cgal-5.1.1/examples/Arrangement_on_surface_2/bounded_planar_vertical_decomposition.cpp
Examining data/cgal-5.1.1/examples/Approximate_min_ellipsoid_d/ellipsoid.cpp
Examining data/cgal-5.1.1/examples/Approximate_min_ellipsoid_d/ellipsoid_for_maple.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/ch_from_cin_to_cout.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/ch_timing.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/convex_hull_yz.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/ch_graham_anderson.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/convex_hull_indices_2.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/iostream_convex_hull_2.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/vector_convex_hull_2.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/array_convex_hull_2.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_2/include/CGAL/ch_timing_2.h
Examining data/cgal-5.1.1/examples/Convex_hull_2/include/CGAL/ch_timing_2_impl.h
Examining data/cgal-5.1.1/examples/Generalized_map/gmap_3_marks.cpp
Examining data/cgal-5.1.1/examples/Generalized_map/gmap_3_with_colored_facets.cpp
Examining data/cgal-5.1.1/examples/Generalized_map/gmap_3_simple_example.cpp
Examining data/cgal-5.1.1/examples/Generalized_map/comparison_gmap_cmap.cpp
Examining data/cgal-5.1.1/examples/Generalized_map/gmap_4_simple_example.cpp
Examining data/cgal-5.1.1/examples/Generalized_map/gmap_3_operations.cpp
Examining data/cgal-5.1.1/examples/Generalized_map/gmap_3_dynamic_onmerge.cpp
Examining data/cgal-5.1.1/examples/Generalized_map/gmap_2_moebius.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_adding_handles.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/draw_periodic_2_triangulation_2.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_simple_example.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_find_conflicts.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_info_insert_with_pair_iterator_2.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_info_insert_with_zip_iterator_2.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_large_point_set.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_colored_vertices.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_info_insert_with_transform_iterator_2.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_geometric_access.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_covering.cpp
Examining data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_hierarchy.cpp
Examining data/cgal-5.1.1/examples/QP_solver/print_first_nonnegative_lp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/solve_convex_hull_containment_lp.h
Examining data/cgal-5.1.1/examples/QP_solver/solve_convex_hull_containment_lp3.h
Examining data/cgal-5.1.1/examples/QP_solver/first_nonnegative_lp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_qp_from_mps.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_lp_from_iterators.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_qp_from_iterators.cpp
Examining data/cgal-5.1.1/examples/QP_solver/optimality_certificate.cpp
Examining data/cgal-5.1.1/examples/QP_solver/solve_convex_hull_containment_lp2.h
Examining data/cgal-5.1.1/examples/QP_solver/first_lp_from_mps.cpp
Examining data/cgal-5.1.1/examples/QP_solver/infeasibility_certificate.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_nonnegative_qp_from_mps.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_qp_basic_constraints.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_nonnegative_qp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/print_first_nonnegative_qp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_lp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/cycling.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_nonnegative_lp_from_iterators.cpp
Examining data/cgal-5.1.1/examples/QP_solver/important_variables.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_nonnegative_lp_from_mps.cpp
Examining data/cgal-5.1.1/examples/QP_solver/invert_matrix.cpp
Examining data/cgal-5.1.1/examples/QP_solver/print_first_lp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_qp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/convex_hull_containment.cpp
Examining data/cgal-5.1.1/examples/QP_solver/unboundedness_certificate.cpp
Examining data/cgal-5.1.1/examples/QP_solver/first_nonnegative_qp_from_iterators.cpp
Examining data/cgal-5.1.1/examples/QP_solver/print_first_qp.cpp
Examining data/cgal-5.1.1/examples/QP_solver/convex_hull_containment_benchmarks.cpp
Examining data/cgal-5.1.1/examples/QP_solver/convex_hull_containment2.cpp
Examining data/cgal-5.1.1/examples/Mesh_2/mesh_class.cpp
Examining data/cgal-5.1.1/examples/Mesh_2/mesh_global.cpp
Examining data/cgal-5.1.1/examples/Mesh_2/mesh_with_seeds.cpp
Examining data/cgal-5.1.1/examples/Mesh_2/mesh_optimization.cpp
Examining data/cgal-5.1.1/examples/Mesh_2/conforming.cpp
Examining data/cgal-5.1.1/examples/BGL_OpenMesh/TriMesh.cpp
Examining data/cgal-5.1.1/examples/Min_circle_2/min_circle_2.cpp
Examining data/cgal-5.1.1/examples/Min_ellipse_2/min_ellipse_2.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/segmentation_via_sdf_values_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/sdf_values_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/segmentation_from_sdf_values_OpenMesh_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/segmentation_from_sdf_values_LCC_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/segmentation_with_facet_ids_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/extract_segmentation_into_mesh_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/segmentation_from_sdf_values_SM_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_segmentation/segmentation_from_sdf_values_example.cpp
Examining data/cgal-5.1.1/examples/Nef_3/shell_exploration.cpp
Examining data/cgal-5.1.1/examples/Nef_3/point_set_operations.cpp
Examining data/cgal-5.1.1/examples/Nef_3/handling_double_coordinates.cpp
Examining data/cgal-5.1.1/examples/Nef_3/polyline_construction.cpp
Examining data/cgal-5.1.1/examples/Nef_3/extended_kernel.cpp
Examining data/cgal-5.1.1/examples/Nef_3/nef_3_to_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Nef_3/interface_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Nef_3/draw_nef_3.cpp
Examining data/cgal-5.1.1/examples/Nef_3/comparison.cpp
Examining data/cgal-5.1.1/examples/Nef_3/topological_operations.cpp
Examining data/cgal-5.1.1/examples/Nef_3/set_operations.cpp
Examining data/cgal-5.1.1/examples/Nef_3/offIO.cpp
Examining data/cgal-5.1.1/examples/Nef_3/nef_3_construction.cpp
Examining data/cgal-5.1.1/examples/Nef_3/exploration_SM.cpp
Examining data/cgal-5.1.1/examples/Nef_3/complex_construction.cpp
Examining data/cgal-5.1.1/examples/Nef_3/nef_3_simple.cpp
Examining data/cgal-5.1.1/examples/Nef_3/nefIO.cpp
Examining data/cgal-5.1.1/examples/Nef_3/surface_mesh_to_nef.cpp
Examining data/cgal-5.1.1/examples/Nef_3/nef_3_point_location.cpp
Examining data/cgal-5.1.1/examples/Nef_3/transformation.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_2/sdg-red-blue-info.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_2/sdg-filtered-traits.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_2/sdg-voronoi-edges.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_2/sdg-count-sites.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_2/sdg-fast-sp.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_2/sdg-fast-sp-polygon.cpp
Examining data/cgal-5.1.1/examples/Segment_Delaunay_graph_2/sdg-info-set.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_optimization_lloyd_example.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_3D_image_with_custom_initialization.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_implicit_domains_2.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_3D_image.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_3D_image_with_features.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_3D_image_variable_size.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/read_polylines.h
Examining data/cgal-5.1.1/examples/Mesh_3/remesh_polyhedral_surface_sm.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_3D_gray_image_multiple_values.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_two_implicit_spheres_with_balls.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain_with_lipschitz_sizing.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain_with_features.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_implicit_sphere.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain_sm.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_implicit_ellipsoid.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_3D_gray_vtk_image.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/random_labeled_image.h
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain_with_features_sm.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/implicit_functions.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_optimization_example.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_3D_gray_image.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_complex.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_cubes_intersection.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_implicit_sphere_variable_size.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/remesh_polyhedral_surface.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_complex_sm.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_hybrid_mesh_domain.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_cubes_intersection_with_features.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_implicit_domains.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain_with_surface_inside.cpp
Examining data/cgal-5.1.1/examples/Mesh_3/debug.h
Examining data/cgal-5.1.1/examples/Mesh_3/implicit_functions.h
Examining data/cgal-5.1.1/examples/Triangulation_2/print_cropped_voronoi.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/adding_handles.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/triangulation_prog1.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/terrain.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/hierarchy.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/info_insert_with_zip_iterator_2.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/info_insert_with_pair_iterator_regular_2.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/segment_soup_to_polylines.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/polylines_triangulation.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/for_loop_2.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/voronoi.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/copy_triangulation_2.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/info_insert_with_pair_iterator_2.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/draw_triangulation_2.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/constrained_plus.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/constrained_hierarchy_plus.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/constrained.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/polygon_triangulation.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/regular.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/info_insert_with_transform_iterator_2.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/terrain_with_info.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/low_dimensional.cpp
Examining data/cgal-5.1.1/examples/Triangulation_2/colored_face.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/conic_traits_adapter.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/bezier_traits_adapter.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/set_union.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/simple_join_intersect.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/connect_polygon.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/do_intersect.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/symmetric_difference.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/sequence.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/print_utils.h
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/dxf_union.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/bso_rational_nt.h
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/circle_segment.cpp
Examining data/cgal-5.1.1/examples/Boolean_set_operations_2/bezier_traits_adapter2.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/triangle_self_intersect_pointers.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/triangle_self_intersect.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/box_d_do_intersect_polylines.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/minimal_self.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/minimal.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/box_grid.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/proximity_custom_box_traits.cpp
Examining data/cgal-5.1.1/examples/Box_intersection_d/custom_box_grid.cpp
Examining data/cgal-5.1.1/examples/Poisson_surface_reconstruction_3/tutorial_example.cpp
Examining data/cgal-5.1.1/examples/Poisson_surface_reconstruction_3/poisson_reconstruction.cpp
Examining data/cgal-5.1.1/examples/Poisson_surface_reconstruction_3/poisson_reconstruction_function.cpp
Examining data/cgal-5.1.1/examples/Poisson_surface_reconstruction_3/poisson_reconstruction_example.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/segment_tree_1.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/range_tree_map_2.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/segment_tree_set_2.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/segment_tree_set_3.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/range_tree_1.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/range_tree_set_2.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/segment_tree_map_2.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/software_design_rgs.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/segment_tree_4.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/range_tree_3.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/range_tree_2.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/segment_tree_2.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/segment_tree_3.cpp
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/include/Tree_Traits.h
Examining data/cgal-5.1.1/examples/RangeSegmentTrees/range_tree_4.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/all_roi_assign_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/custom_weight_for_edges_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/deform_polyhedron_with_custom_pmap_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/deform_mesh_for_botsch08_format_sre_arap.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/k_ring_roi_translate_rotate_Surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/all_roi_assign_example_Surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/all_roi_assign_example_with_OpenMesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/all_roi_assign_example_custom_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_deformation/k_ring_roi_translate_rotate_example.cpp
Examining data/cgal-5.1.1/examples/Nef_2/nef_2_exploration.cpp
Examining data/cgal-5.1.1/examples/Nef_2/nef_2_construction.cpp
Examining data/cgal-5.1.1/examples/Nef_2/nef_2_polylines.cpp
Examining data/cgal-5.1.1/examples/Nef_2/nef_2_intersection.cpp
Examining data/cgal-5.1.1/examples/Surface_sweep_2/plane_sweep.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/registration_with_opengr_pointmatcher_pipeline.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/jet_smoothing_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/hierarchy_simplification_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/structuring_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/read_las_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/wlop_simplify_and_regularize_point_set_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/normal_estimation.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/scale_estimation_2d_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/normals_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/property_map.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/scale_estimation_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/registration_with_pointmatcher.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/edges_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/read_write_xyz_point_set_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/edge_aware_upsample_point_set_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/random_simplification_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/remove_outliers_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/registration_with_OpenGR.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/callback_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/read_ply_points_with_colors_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/grid_simplification_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/bilateral_smooth_point_set_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/average_spacing_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/clustering_example.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/grid_simplify_indices.cpp
Examining data/cgal-5.1.1/examples/Point_set_processing_3/write_ply_points_example.cpp
Examining data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp
Examining data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
Examining data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_from_mesh.cpp
Examining data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
Examining data/cgal-5.1.1/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
Examining data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp
Examining data/cgal-5.1.1/examples/Envelope_2/convex_hull_2.cpp
Examining data/cgal-5.1.1/examples/Envelope_2/envelope_circles.cpp
Examining data/cgal-5.1.1/examples/Envelope_2/envelope_segments.cpp
Examining data/cgal-5.1.1/examples/Point_set_3/point_set.cpp
Examining data/cgal-5.1.1/examples/Point_set_3/point_set_read_ply.cpp
Examining data/cgal-5.1.1/examples/Point_set_3/draw_point_set_3.cpp
Examining data/cgal-5.1.1/examples/Point_set_3/point_set_advanced.cpp
Examining data/cgal-5.1.1/examples/Point_set_3/point_set_property.cpp
Examining data/cgal-5.1.1/examples/Point_set_3/point_set_algo.cpp
Examining data/cgal-5.1.1/examples/Point_set_3/point_set_read_xyz.cpp
Examining data/cgal-5.1.1/examples/Barycentric_coordinates_2/Discrete_harmonic_coordinates_example.cpp
Examining data/cgal-5.1.1/examples/Barycentric_coordinates_2/Segment_coordinates_example.cpp
Examining data/cgal-5.1.1/examples/Barycentric_coordinates_2/Triangle_coordinates_speed_test.cpp
Examining data/cgal-5.1.1/examples/Barycentric_coordinates_2/Triangle_coordinates_example.cpp
Examining data/cgal-5.1.1/examples/Barycentric_coordinates_2/Terrain_height_modeling.cpp
Examining data/cgal-5.1.1/examples/Barycentric_coordinates_2/Mean_value_coordinates_example.cpp
Examining data/cgal-5.1.1/examples/Barycentric_coordinates_2/Wachspress_coordinates_example.cpp
Examining data/cgal-5.1.1/examples/Optimal_transportation_reconstruction_2/otr2_simplest_example_with_tolerance.cpp
Examining data/cgal-5.1.1/examples/Optimal_transportation_reconstruction_2/otr2_list_output_example.cpp
Examining data/cgal-5.1.1/examples/Optimal_transportation_reconstruction_2/otr2_mass_example.cpp
Examining data/cgal-5.1.1/examples/Optimal_transportation_reconstruction_2/otr2_indexed_output_example.cpp
Examining data/cgal-5.1.1/examples/Optimal_transportation_reconstruction_2/otr2_simplest_example.cpp
Examining data/cgal-5.1.1/examples/Ridges_3/compute_normals.h
Examining data/cgal-5.1.1/examples/Ridges_3/Compute_Ridges_Umbilics.cpp
Examining data/cgal-5.1.1/examples/Ridges_3/PolyhedralSurf_rings.h
Examining data/cgal-5.1.1/examples/Ridges_3/PolyhedralSurf.h
Examining data/cgal-5.1.1/examples/Ridges_3/Ridges_Umbilics_SM.cpp
Examining data/cgal-5.1.1/examples/Ridges_3/Ridges_Umbilics_LCC.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_skeletonization/simple_mcfskel_sm_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_skeletonization/MCF_Skeleton_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_skeletonization/segmentation_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_skeletonization/simple_mcfskel_LCC_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_skeletonization/MCF_Skeleton_sm_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_skeletonization/simple_mcfskel_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_skeletonization/MCF_Skeleton_LCC_example.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off2wav.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off_bbox.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off_glue.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/polyhedron2vrml.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off2vrml.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off_transform.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/iv2off.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/polyhedron_copy.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/terr_trian.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off2iv.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off2off.cpp
Examining data/cgal-5.1.1/examples/Polyhedron_IO/triangulation_print_OFF.h
Examining data/cgal-5.1.1/examples/Polyhedron_IO/off2stl.cpp
Examining data/cgal-5.1.1/examples/BGL_arrangement_2/primal.cpp
Examining data/cgal-5.1.1/examples/BGL_arrangement_2/arr_rational_nt.h
Examining data/cgal-5.1.1/examples/BGL_arrangement_2/arr_print.h
Examining data/cgal-5.1.1/examples/BGL_arrangement_2/arrangement_dual.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/bops_circular.h
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/bops_linear.h
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/exact_offset.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/sum_with_holes.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/print_utils.h
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/approx_offset.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/arr_conics.h
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/sum_triangle_square.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/sum_of_holes.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/ms_rational_nt.h
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/sum_by_decomposition.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/approx_inset.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/exact_inset.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_2/pgn_print.h
Examining data/cgal-5.1.1/examples/Solver_interface/mixed_integer_program.cpp
Examining data/cgal-5.1.1/examples/Solver_interface/diagonalize_matrix.cpp
Examining data/cgal-5.1.1/examples/Solver_interface/sparse_solvers.cpp
Examining data/cgal-5.1.1/examples/Solver_interface/singular_value_decomposition.cpp
Examining data/cgal-5.1.1/examples/CGAL_ipelets/test_grabbers.cpp
Examining data/cgal-5.1.1/examples/Circular_kernel_3/functor_has_on_3.cpp
Examining data/cgal-5.1.1/examples/Circular_kernel_3/functor_compare_theta_3.cpp
Examining data/cgal-5.1.1/examples/Circular_kernel_3/intersecting_spheres.cpp
Examining data/cgal-5.1.1/examples/Rectangular_p_center_2/rectangular_p_center_2.cpp
Examining data/cgal-5.1.1/examples/Classification/example_generation_and_training.cpp
Examining data/cgal-5.1.1/examples/Classification/example_opencv_random_forest.cpp
Examining data/cgal-5.1.1/examples/Classification/example_cluster_classification.cpp
Examining data/cgal-5.1.1/examples/Classification/gis_tutorial_example.cpp
Examining data/cgal-5.1.1/examples/Classification/example_feature.cpp
Examining data/cgal-5.1.1/examples/Classification/example_ethz_random_forest.cpp
Examining data/cgal-5.1.1/examples/Classification/example_mesh_classification.cpp
Examining data/cgal-5.1.1/examples/Classification/example_classification.cpp
Examining data/cgal-5.1.1/examples/Classification/example_tensorflow_neural_network.cpp
Examining data/cgal-5.1.1/examples/Classification/include/Color_ramp.h
Examining data/cgal-5.1.1/examples/Profiling_tools/Profile_histogram_counter.cpp
Examining data/cgal-5.1.1/examples/Profiling_tools/Profile_timer.cpp
Examining data/cgal-5.1.1/examples/Profiling_tools/Profile_counter.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_edge_iterator.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_color.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_graph2.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_graph.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_vector.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_compact2.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_default.cpp
Examining data/cgal-5.1.1/examples/HalfedgeDS/hds_prog_compact.cpp
Examining data/cgal-5.1.1/examples/Property_map/dynamic_properties.cpp
Examining data/cgal-5.1.1/examples/Property_map/custom_property_map.cpp
Examining data/cgal-5.1.1/examples/Envelope_3/envelope_spheres.cpp
Examining data/cgal-5.1.1/examples/Envelope_3/envelope_planes.cpp
Examining data/cgal-5.1.1/examples/Envelope_3/envelope_triangles.cpp
Examining data/cgal-5.1.1/examples/Cone_spanners_2/theta_io.cpp
Examining data/cgal-5.1.1/examples/Cone_spanners_2/dijkstra_theta.cpp
Examining data/cgal-5.1.1/examples/Cone_spanners_2/compute_cones.cpp
Examining data/cgal-5.1.1/examples/Algebraic_foundations/fraction_traits.cpp
Examining data/cgal-5.1.1/examples/Algebraic_foundations/implicit_interoperable_dispatch.cpp
Examining data/cgal-5.1.1/examples/Algebraic_foundations/interoperable.cpp
Examining data/cgal-5.1.1/examples/Algebraic_foundations/algebraic_structure_dispatch.cpp
Examining data/cgal-5.1.1/examples/Algebraic_foundations/integralize.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_3/cube_offset.cpp
Examining data/cgal-5.1.1/examples/Minkowski_sum_3/glide.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/cartesian_converter.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/MyPointC2_iostream.h
Examining data/cgal-5.1.1/examples/Kernel_23/intersection_get.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/intersection_visitor.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/MyKernel.h
Examining data/cgal-5.1.1/examples/Kernel_23/MyConstruct_bbox_2.h
Examining data/cgal-5.1.1/examples/Kernel_23/intersections.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/MyConstruct_coord_iterator.h
Examining data/cgal-5.1.1/examples/Kernel_23/surprising.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/MyPointC2.h
Examining data/cgal-5.1.1/examples/Kernel_23/exact.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/points_and_segment.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/MyKernel.cpp
Examining data/cgal-5.1.1/examples/Kernel_23/MySegmentC2.h
Examining data/cgal-5.1.1/examples/Kernel_23/MyConstruct_point_2.h
Examining data/cgal-5.1.1/examples/Heat_method_3/heat_method_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Heat_method_3/heat_method_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Heat_method_3/heat_method_surface_mesh_direct.cpp
Examining data/cgal-5.1.1/examples/Heat_method_3/heat_method.cpp
Examining data/cgal-5.1.1/examples/Triangulation/triangulation_data_structure_dynamic.cpp
Examining data/cgal-5.1.1/examples/Triangulation/regular_triangulation.cpp
Examining data/cgal-5.1.1/examples/Triangulation/triangulation.cpp
Examining data/cgal-5.1.1/examples/Triangulation/barycentric_subdivision.cpp
Examining data/cgal-5.1.1/examples/Triangulation/triangulation_data_structure_static.cpp
Examining data/cgal-5.1.1/examples/Triangulation/convex_hull.cpp
Examining data/cgal-5.1.1/examples/Triangulation/triangulation1.cpp
Examining data/cgal-5.1.1/examples/Triangulation/triangulation2.cpp
Examining data/cgal-5.1.1/examples/Triangulation/delaunay_triangulation.cpp
Examining data/cgal-5.1.1/examples/Circulator/circulator_prog2.cpp
Examining data/cgal-5.1.1/examples/Circulator/circulator_prog1.cpp
Examining data/cgal-5.1.1/examples/Circulator/circulator_prog3.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_cube.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_simple.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_vertex_color.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_vertex_normal.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_off.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_subdiv.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_self_intersection.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_traits.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_planes.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_normals.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_cut_cube.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_tetra.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/draw_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_color.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_incr_builder.cpp
Examining data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_vector.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_in_triangles_2.cpp
Examining data/cgal-5.1.1/examples/Generator/cube_d.cpp
Examining data/cgal-5.1.1/examples/Generator/random_segments2.cpp
Examining data/cgal-5.1.1/examples/Generator/random_convex_hull_2.cpp
Examining data/cgal-5.1.1/examples/Generator/random_degenerate_point_set.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_on_triangle_mesh_3.cpp
Examining data/cgal-5.1.1/examples/Generator/sphere_d.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_triangle_2.cpp
Examining data/cgal-5.1.1/examples/Generator/random_polygon.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_on_triangle_mesh_2.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_on_tetrahedral_mesh_3.cpp
Examining data/cgal-5.1.1/examples/Generator/random_grid.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_tetrahedron_and_triangle_3.cpp
Examining data/cgal-5.1.1/examples/Generator/ball_d.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_in_triangles_3.cpp
Examining data/cgal-5.1.1/examples/Generator/random_segments1.cpp
Examining data/cgal-5.1.1/examples/Generator/random_polygon2.cpp
Examining data/cgal-5.1.1/examples/Generator/random_points_in_tetrahedral_mesh_3.cpp
Examining data/cgal-5.1.1/examples/Generator/random_convex_set.cpp
Examining data/cgal-5.1.1/examples/Generator/grid_d.cpp
Examining data/cgal-5.1.1/examples/Generator/combination_enumerator.cpp
Examining data/cgal-5.1.1/examples/Generator/name_pairs.cpp
Examining data/cgal-5.1.1/examples/Periodic_4_hyperbolic_triangulation_2/p4ht2_example_insertion.cpp
Examining data/cgal-5.1.1/examples/Polygonal_surface_reconstruction/polyfit_example_model_complexty_control.cpp
Examining data/cgal-5.1.1/examples/Polygonal_surface_reconstruction/polyfit_example_user_provided_planes.cpp
Examining data/cgal-5.1.1/examples/Polygonal_surface_reconstruction/polyfit_example_with_region_growing.cpp
Examining data/cgal-5.1.1/examples/Polygonal_surface_reconstruction/polyfit_example_without_input_planes.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_approximation/vsa_approximation_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_approximation/vsa_isotropic_metric_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_approximation/vsa_segmentation_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_approximation/vsa_simple_approximation_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_approximation/vsa_class_interface_example.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_approximation/vsa_approximation_2_example.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/shape_detection_basic_deprecated.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/efficient_RANSAC_with_custom_shape.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/efficient_RANSAC_with_point_access.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/efficient_RANSAC_with_parameters.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/region_growing_with_custom_classes.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/region_growing_on_point_set_2.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/efficient_RANSAC_with_callback.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/region_growing_on_point_set_3.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/region_growing_on_polygon_mesh.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/include/efficient_RANSAC_with_custom_shape.h
Examining data/cgal-5.1.1/examples/Shape_detection/efficient_RANSAC_and_plane_regularization.cpp
Examining data/cgal-5.1.1/examples/Shape_detection/efficient_RANSAC_basic.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/dynamic_hull_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/extreme_points_3_sm.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/lloyd_algorithm.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/dynamic_hull_LCC_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/halfspace_intersection_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/dynamic_hull_SM_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/quickhull_OM_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/quickhull_any_dim_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/quickhull_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/dynamic_hull_OM_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/graph_hull_3.cpp
Examining data/cgal-5.1.1/examples/Convex_hull_3/extreme_indices_3.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_parameterization/square_border_parameterizer.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_parameterization/simple_parameterization.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_parameterization/discrete_authalic.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_parameterization/orbifold.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_parameterization/lscm.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_parameterization/seam_Polyhedron_3.cpp
Examining data/cgal-5.1.1/examples/Surface_mesher/mesh_an_implicit_function.cpp
Examining data/cgal-5.1.1/examples/Surface_mesher/mesh_a_3d_gray_image.cpp
Examining data/cgal-5.1.1/examples/Principal_component_analysis/linear_least_squares_fitting_points_2.cpp
Examining data/cgal-5.1.1/examples/Principal_component_analysis/centroid.cpp
Examining data/cgal-5.1.1/examples/Principal_component_analysis/bounding_box.cpp
Examining data/cgal-5.1.1/examples/Principal_component_analysis/barycenter.cpp
Examining data/cgal-5.1.1/examples/Principal_component_analysis/linear_least_squares_fitting_triangles_3.cpp
Examining data/cgal-5.1.1/examples/Polygon/draw_polygon.cpp
Examining data/cgal-5.1.1/examples/Polygon/Example.cpp
Examining data/cgal-5.1.1/examples/Polygon/projected_polygon.cpp
Examining data/cgal-5.1.1/examples/Polygon/draw_polygon_with_holes.cpp
Examining data/cgal-5.1.1/examples/Polygon/polygon_algorithms.cpp
Examining data/cgal-5.1.1/examples/Polygon/Polygon.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/print.h
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Show_offset_polygon.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_with_holes_2.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Create_offset_polygons_2.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Create_straight_skeleton_2.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/dump_to_eps.h
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Show_straight_skeleton.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_2.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Create_straight_skeleton_from_polygon_with_holes_2.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Low_level_API.cpp
Examining data/cgal-5.1.1/examples/Straight_skeleton_2/Create_saop_from_polygon_with_holes_2.cpp
Examining data/cgal-5.1.1/examples/BGL_triangulation_2/emst_cdt_plus_hierarchy.cpp
Examining data/cgal-5.1.1/examples/BGL_triangulation_2/dijkstra.cpp
Examining data/cgal-5.1.1/examples/BGL_triangulation_2/face_graph.cpp
Examining data/cgal-5.1.1/examples/BGL_triangulation_2/emst.cpp
Examining data/cgal-5.1.1/examples/BGL_triangulation_2/emst_regular.cpp
Examining data/cgal-5.1.1/examples/BGL_triangulation_2/dijkstra_with_internal_properties.cpp
Examining data/cgal-5.1.1/examples/Min_sphere_d/min_sphere_d.cpp
Examining data/cgal-5.1.1/examples/Min_sphere_of_spheres_d/benchmark.cpp
Examining data/cgal-5.1.1/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_3.cpp
Examining data/cgal-5.1.1/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_d.cpp
Examining data/cgal-5.1.1/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp
Examining data/cgal-5.1.1/examples/Combinatorial_map/map_3_operations.cpp
Examining data/cgal-5.1.1/examples/Combinatorial_map/map_3_with_colored_facets.cpp
Examining data/cgal-5.1.1/examples/Combinatorial_map/map_3_simple_example.cpp
Examining data/cgal-5.1.1/examples/Combinatorial_map/map_3_foreach.cpp
Examining data/cgal-5.1.1/examples/Combinatorial_map/map_3_dynamic_onmerge.cpp
Examining data/cgal-5.1.1/examples/Combinatorial_map/map_3_marks.cpp
Examining data/cgal-5.1.1/examples/Combinatorial_map/map_4_simple_example.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/p3rt3_hidden_points.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/p3rt3_insert_point_with_bad_weight.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/covering.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/simple_example.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/colored_vertices.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/find_conflicts.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/p3rt3_insert_remove.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/simple_regular_example.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/large_point_set.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/geometric_access.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/p3rt3_insert_only.cpp
Examining data/cgal-5.1.1/examples/Periodic_3_triangulation_3/periodic_adding_handles.cpp
Examining data/cgal-5.1.1/examples/Hyperbolic_triangulation_2/ht2_example.cpp
Examining data/cgal-5.1.1/examples/Hyperbolic_triangulation_2/ht2_example_color.cpp
Examining data/cgal-5.1.1/examples/Scale_space_reconstruction_3/scale_space_advancing_front.cpp
Examining data/cgal-5.1.1/examples/Scale_space_reconstruction_3/scale_space.cpp
Examining data/cgal-5.1.1/examples/Scale_space_reconstruction_3/scale_space_manifold.cpp
Examining data/cgal-5.1.1/examples/Scale_space_reconstruction_3/scale_space_incremental.cpp
Examining data/cgal-5.1.1/examples/Core/delaunay.cpp
Examining data/cgal-5.1.1/examples/Algebraic_kernel_d/Sign_at_1.cpp
Examining data/cgal-5.1.1/examples/Algebraic_kernel_d/Solve_1.cpp
Examining data/cgal-5.1.1/examples/Algebraic_kernel_d/Isolate_1.cpp
Examining data/cgal-5.1.1/examples/Algebraic_kernel_d/Construct_algebraic_real_1.cpp
Examining data/cgal-5.1.1/examples/Algebraic_kernel_d/Compare_1.cpp
Examining data/cgal-5.1.1/examples/Min_annulus_d/min_annulus_d.cpp
Examining data/cgal-5.1.1/examples/Min_annulus_d/min_annulus_d_fast_exact.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_2/ex_alpha_projection_traits.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_2/ex_alpha_shapes_2.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_2/ex_weighted_alpha_shapes_2.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_2/ex_periodic_alpha_shapes_2.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_visitor_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_enriched_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_constrained_border_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_linear_cell_complex.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_OpenMesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_bounded_normal_change.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_garland_heckbert.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_constrain_sharp_edges.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_constrained_border_polyhedron.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_simplification/edge_collapse_all_short_edges.cpp
Examining data/cgal-5.1.1/examples/STL_Extension/min_max_element_example.cpp
Examining data/cgal-5.1.1/examples/STL_Extension/Default.cpp
Examining data/cgal-5.1.1/examples/STL_Extension/in_place_list_prog.cpp
Examining data/cgal-5.1.1/examples/STL_Extension/Dispatch_output_iterator.cpp
Examining data/cgal-5.1.1/examples/STL_Extension/min_element_if_example.cpp
Examining data/cgal-5.1.1/examples/STL_Extension/unordered_map.cpp
Examining data/cgal-5.1.1/examples/Jet_fitting_3/PolyhedralSurf_rings.h
Examining data/cgal-5.1.1/examples/Jet_fitting_3/PolyhedralSurf.h
Examining data/cgal-5.1.1/examples/Jet_fitting_3/Mesh_estimation.cpp
Examining data/cgal-5.1.1/examples/Jet_fitting_3/Single_estimation.cpp
Examining data/cgal-5.1.1/examples/Jet_fitting_3/PolyhedralSurf_operations.h
Examining data/cgal-5.1.1/examples/Voronoi_diagram_2/draw_voronoi_diagram_2.cpp
Examining data/cgal-5.1.1/examples/Voronoi_diagram_2/vd_2_point_location_sdg_linf.cpp
Examining data/cgal-5.1.1/examples/Voronoi_diagram_2/vd_2_point_location.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_shortest_path/shortest_paths.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_shortest_path/shortest_paths_multiple_sources.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_shortest_path/shortest_path_with_locate.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_shortest_path/shortest_paths_with_id.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_shortest_path/shortest_paths_OpenMesh.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_shortest_path/shortest_paths_no_id.cpp
Examining data/cgal-5.1.1/examples/Surface_mesh_shortest_path/shortest_path_sequence.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_sphere_orthogonally.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/user_defined_point_and_distance.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/using_fair_splitting_rule.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_with_point_with_info_inplace.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/iso_rectangle_2_query.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/distance_browsing.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_polyhedron_vertices.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/general_neighbor_searching.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/parallel_kdtree.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_with_point_with_info.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/circular_query.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/Distance.h
Examining data/cgal-5.1.1/examples/Spatial_searching/weighted_Minkowski_distance.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_polyhedron_vertices_with_fuzzy_sphere.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_with_circular_query.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/nearest_neighbor_searching.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_surface_mesh_vertices.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/searching_with_point_with_info_pmap.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/Point.h
Examining data/cgal-5.1.1/examples/Spatial_searching/fuzzy_range_query.cpp
Examining data/cgal-5.1.1/examples/Spatial_searching/splitter_worst_cases.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/linear_cell_complex_3_operations.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/linear_cell_complex_3_with_mypoint.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/linear_cell_complex_3_with_colored_vertices.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/linear_cell_complex_3.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/linear_cell_complex_4.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/draw_linear_cell_complex.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/voronoi_2.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/basic_viewer.h
Examining data/cgal-5.1.1/examples/Linear_cell_complex/linear_cell_complex_3_attributes_management.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/gmap_linear_cell_complex_3.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/voronoi_3.cpp
Examining data/cgal-5.1.1/examples/Linear_cell_complex/plane_graph_to_lcc_2.cpp
Examining data/cgal-5.1.1/examples/Stream_support/read_WKT.cpp
Examining data/cgal-5.1.1/examples/Stream_support/Linestring_WKT.cpp
Examining data/cgal-5.1.1/examples/Stream_support/read_xml.cpp
Examining data/cgal-5.1.1/examples/Stream_support/Point_WKT.cpp
Examining data/cgal-5.1.1/examples/Stream_support/Polygon_WKT.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_custom_triangle_soup_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_polyhedron_facet_distance_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_custom_indexed_triangle_set_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_polyhedron_edge_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_custom_indexed_triangle_set_array_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_triangle_3_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_ray_shooting_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_cached_bbox_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_custom_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_halfedge_graph_edge_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_segment_3_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_insertion_example.cpp
Examining data/cgal-5.1.1/examples/AABB_tree/AABB_face_graph_triangle_example.cpp
Examining data/cgal-5.1.1/examples/TDS_3/tds.cpp
Examining data/cgal-5.1.1/examples/TDS_3/linking_2d_and_3d.cpp
Examining data/cgal-5.1.1/examples/Visibility_2/simple_polygon_visibility_2.cpp
Examining data/cgal-5.1.1/examples/Visibility_2/general_polygon_example.cpp
Examining data/cgal-5.1.1/examples/Nef_S2/nef_s2_simple.cpp
Examining data/cgal-5.1.1/examples/Nef_S2/nef_s2_construction.cpp
Examining data/cgal-5.1.1/examples/Nef_S2/nef_s2_exploration.cpp
Examining data/cgal-5.1.1/examples/Nef_S2/include/CGAL/Nef_S2/create_random_Nef_S2.h
Examining data/cgal-5.1.1/examples/Nef_S2/nef_s2_point_location.cpp
Examining data/cgal-5.1.1/examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp
Examining data/cgal-5.1.1/examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp
Examining data/cgal-5.1.1/examples/Apollonius_graph_2/ag2_hierarchy.cpp
Examining data/cgal-5.1.1/examples/Apollonius_graph_2/ag2_exact_traits.cpp
Examining data/cgal-5.1.1/examples/CGALimageIO/extract_a_sub_image.cpp
Examining data/cgal-5.1.1/examples/CGALimageIO/convert_raw_image_to_inr.cpp
Examining data/cgal-5.1.1/examples/CGALimageIO/test_imageio.cpp
Examining data/cgal-5.1.1/examples/Partition_2/greene_approx_convex_partition_2.cpp
Examining data/cgal-5.1.1/examples/Partition_2/y_monotone_partition_indices_2.cpp
Examining data/cgal-5.1.1/examples/Partition_2/approx_convex_partition_2.cpp
Examining data/cgal-5.1.1/examples/Partition_2/optimal_convex_partition_2.cpp
Examining data/cgal-5.1.1/examples/Partition_2/y_monotone_partition_2.cpp
Examining data/cgal-5.1.1/examples/Inscribed_areas/largest_empty_rectangle.cpp
Examining data/cgal-5.1.1/examples/Inscribed_areas/extremal_polygon_2_perimeter.cpp
Examining data/cgal-5.1.1/examples/Inscribed_areas/extremal_polygon_2_area.cpp
Examining data/cgal-5.1.1/examples/Optimal_bounding_box/rotated_aabb_tree_example.cpp
Examining data/cgal-5.1.1/examples/Optimal_bounding_box/obb_example.cpp
Examining data/cgal-5.1.1/examples/Optimal_bounding_box/obb_with_point_maps_example.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/hilbert.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/hilbert_sort_on_sphere.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/hilbert_policies.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/spatial_sort_on_sphere.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/example_delaunay_2.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/sp_sort_using_property_map_d.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/sp_sort_using_property_map_3.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/myPoint.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/sp_sort_using_property_map_2.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/sort_indices.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/small_example_delaunay_2.cpp
Examining data/cgal-5.1.1/examples/Spatial_sorting/parallel_spatial_sort_3.cpp
Examining data/cgal-5.1.1/examples/Subdivision_method_3/Customized_subdivision.cpp
Examining data/cgal-5.1.1/examples/Subdivision_method_3/CatmullClark_subdivision.cpp
Examining data/cgal-5.1.1/examples/Subdivision_method_3/Loop_subdivision.cpp
Examining data/cgal-5.1.1/examples/Subdivision_method_3/Sqrt3_subdivision.cpp
Examining data/cgal-5.1.1/examples/Subdivision_method_3/DooSabin_subdivision.cpp
Examining data/cgal-5.1.1/examples/Circular_kernel_2/functor_has_on_2.cpp
Examining data/cgal-5.1.1/examples/Circular_kernel_2/intersecting_arcs.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/ex_periodic_alpha_shapes_3.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/ex_alpha_shapes_3.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/ex_alpha_shapes_exact_alpha.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/ex_weighted_alpha_shapes_3.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/visible_alpha_shape_facets_to_OFF.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/ex_weighted_periodic_alpha_shapes_3.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/ex_fixed_weighted_alpha_shapes_3.cpp
Examining data/cgal-5.1.1/examples/Alpha_shapes_3/ex_alpha_shapes_with_fast_location_3.cpp
Examining data/cgal-5.1.1/examples/Matrix_search/sorted_matrix_search.cpp
Examining data/cgal-5.1.1/auxiliary/gdb/test.cpp
Examining data/cgal-5.1.1/demo/Snap_rounding_2/Snap_rounding_2.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3/Viewer.h
Examining data/cgal-5.1.1/demo/Triangulation_3/typedefs.h
Examining data/cgal-5.1.1/demo/Triangulation_3/Scene.h
Examining data/cgal-5.1.1/demo/Triangulation_3/MainWindow.h
Examining data/cgal-5.1.1/demo/Triangulation_3/Scene.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3/PreferenceDlg.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3/Viewer.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3/MainWindow.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3/PreferenceDlg.h
Examining data/cgal-5.1.1/demo/Triangulation_3/T3_demo.cpp
Examining data/cgal-5.1.1/demo/Interpolation/interpolation_2_demo.cpp
Examining data/cgal-5.1.1/demo/Interpolation/surface_voronoi.cpp
Examining data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp
Examining data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/svd-typedefs.h
Examining data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/include/CGAL/Constraints_loader.h
Examining data/cgal-5.1.1/demo/Polyline_simplification_2/Polyline_simplification_2.cpp
Examining data/cgal-5.1.1/demo/Polyline_simplification_2/include/CGAL/Qt/Polyline_simplification_2_graphics_item.h
Examining data/cgal-5.1.1/demo/Polyline_simplification_2/include/CGAL/Qt/TriangulationArrangementGraphicsItem.h
Examining data/cgal-5.1.1/demo/Stream_lines_2/Stream_lines_2.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/CurveGraphicsItem.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoTab.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/GraphicsViewSegmentInput.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ColorItemEditor.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementSegmentInputCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/VerticalRayShootCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/NewTabDialog.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoPropertiesDialog.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoPropertiesDialog.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/FillFaceCallback.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/SplitEdgeCallback.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/VerticalRayGraphicsItem.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ISnappable.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementGraphicsItem.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/GraphicsViewSegmentInput.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/EnvelopeCallback.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/FillFaceCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoGraphicsView.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/PointLocationCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/DeleteCurveModeItemEditor.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/PropertyValueDelegate.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/GraphicsViewCurveInput.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/DeleteCurveMode.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/DeleteCurveMode.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/Callback.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoTab.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/DeleteCurveModeItemEditor.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/NewTabDialog.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/PropertyValueDelegate.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/OverlayDialog.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoWindow.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/VerticalRayGraphicsItem.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/VerticalRayShootCallback.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/Utils.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/PointsGraphicsItem.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/GraphicsViewCurveInput.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ColorItemEditor.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoGraphicsView.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/Conic_reader.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/DeleteCurveCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/SplitEdgeCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoWindow.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/PointsGraphicsItem.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/EnvelopeCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/OverlayDialog.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/Callback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementCurveInputCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/MergeEdgeCallback.h
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/arrangement_2.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/Utils.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/tests/Test.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/tests/TestAlgebraic.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/tests/TestRayPL.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementGraphicsItem.cpp
Examining data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementTypes.h
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/TriangulationRemoveVertex.h
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/TriangulationCircumcircle.h
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/TriangulationMovingPoint.h
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/TriangulationConflictZone.h
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/TriangulationPointInputAndConflictZone.h
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/include/CGAL/Qt/PeriodicTriangulationGraphicsItem.h
Examining data/cgal-5.1.1/demo/Periodic_2_triangulation_2/include/CGAL/Qt/PeriodicVoronoiGraphicsItem.h
Examining data/cgal-5.1.1/demo/Mesh_2/conform.cpp
Examining data/cgal-5.1.1/demo/Mesh_2/mesh.cpp
Examining data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h
Examining data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/include/CGAL/Qt/ArrangementPointInput.h
Examining data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/include/CGAL/Qt/ArrangementGraphicsItem.h
Examining data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/include/CGAL/Qt/SetGraphicsItem.h
Examining data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp
Examining data/cgal-5.1.1/demo/GraphicsView/min.cpp
Examining data/cgal-5.1.1/demo/Segment_Delaunay_graph_2/svd-typedefs.h
Examining data/cgal-5.1.1/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp
Examining data/cgal-5.1.1/demo/Segment_Delaunay_graph_2/include/CGAL/Constraints_loader.h
Examining data/cgal-5.1.1/demo/Spatial_searching_2/Spatial_searching_2.cpp
Examining data/cgal-5.1.1/demo/Spatial_searching_2/NearestNeighbor.h
Examining data/cgal-5.1.1/demo/Triangulation_2/TriangulationRemoveVertex.h
Examining data/cgal-5.1.1/demo/Triangulation_2/TriangulationCircumcircle.h
Examining data/cgal-5.1.1/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp
Examining data/cgal-5.1.1/demo/Triangulation_2/TriangulationMovingPoint.h
Examining data/cgal-5.1.1/demo/Triangulation_2/Regular_triangulation_2.cpp
Examining data/cgal-5.1.1/demo/Triangulation_2/Delaunay_triangulation_2.cpp
Examining data/cgal-5.1.1/demo/Triangulation_2/TriangulationConflictZone.h
Examining data/cgal-5.1.1/demo/Triangulation_2/TriangulationPointInputAndConflictZone.h
Examining data/cgal-5.1.1/demo/Triangulation_2/include/CGAL/Lipschitz_sizing_field_criteria_2.h
Examining data/cgal-5.1.1/demo/Triangulation_2/DelaunayMeshInsertSeeds.h
Examining data/cgal-5.1.1/demo/Triangulation_2/RegularTriangulationRemoveVertex.h
Examining data/cgal-5.1.1/demo/Periodic_Lloyd_3/Viewer.h
Examining data/cgal-5.1.1/demo/Periodic_Lloyd_3/typedefs.h
Examining data/cgal-5.1.1/demo/Periodic_Lloyd_3/Scene.h
Examining data/cgal-5.1.1/demo/Periodic_Lloyd_3/MainWindow.h
Examining data/cgal-5.1.1/demo/Periodic_Lloyd_3/Periodic_Lloyd_3.cpp
Examining data/cgal-5.1.1/demo/Periodic_Lloyd_3/Viewer.cpp
Examining data/cgal-5.1.1/demo/Periodic_Lloyd_3/MainWindow.cpp
Examining data/cgal-5.1.1/demo/Surface_mesh_deformation/deform_mesh_for_botsch08_format.cpp
Examining data/cgal-5.1.1/demo/Geomview/input.cpp
Examining data/cgal-5.1.1/demo/Geomview/kernel.cpp
Examining data/cgal-5.1.1/demo/Geomview/gv_terrain.cpp
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/Otr2_kerneled.h
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/glviewer.h
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/window.cpp
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/glviewer.cpp
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/window.h
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.cpp
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/render.cpp
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/Otr2_demo.cpp
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/dialog_options.h
Examining data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.h
Examining data/cgal-5.1.1/demo/Bounding_volumes/Bounding_volumes.cpp
Examining data/cgal-5.1.1/demo/Bounding_volumes/Ellipse.h
Examining data/cgal-5.1.1/demo/Polyhedron_IO/geomview_demo.cpp
Examining data/cgal-5.1.1/demo/Polyhedron_IO/viewpoint2off.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/hull.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/triangulation.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/pca.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/cone_spanners.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/simple_triangulation.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/distance.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/alpha_shapes.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/multi_regular.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/bbox_restriction.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/hilbert_sort.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/diagrams.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/skeleton.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/generator.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/arrangement.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/multi_delaunay.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/svdlinf.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/minkowski.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/include/CGAL_ipelets/pencils.h
Examining data/cgal-5.1.1/demo/CGAL_ipelets/include/CGAL_ipelets/k_delaunay.h
Examining data/cgal-5.1.1/demo/CGAL_ipelets/hyperbolic.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/circle_pencils.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/mst.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/mesh_2.cpp
Examining data/cgal-5.1.1/demo/CGAL_ipelets/partition.cpp
Examining data/cgal-5.1.1/demo/Circular_kernel_3/Viewer.h
Examining data/cgal-5.1.1/demo/Circular_kernel_3/Viewer.cpp
Examining data/cgal-5.1.1/demo/Circular_kernel_3/Circular_kernel_3.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Server_ws.h
Examining data/cgal-5.1.1/demo/Polyhedron/Point_dialog_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Primitive_container.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_facegraph_transform_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_to_mesh_distance_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_upsampling_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_wlop_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Register_point_sets_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_outliers_removal_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_normal_estimation_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_average_spacing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_simplification_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_interference_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Surface_reconstruction_poisson_impl.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_bilateral_smoothing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Features_detection_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Merge_point_sets_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Surface_reconstruction_advancing_front_impl.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Surface_reconstruction_polygonal_impl.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Surface_reconstruction_scale_space_impl.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Surface_reconstruction_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_clustering_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Point_set/Point_set_smoothing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Convex_decomposition/Nef_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Mesh_simplification_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Parameterization_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Scene_polyhedron_shortest_path_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Surface_mesh_approximation_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/VSA_wrapper.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Mesh_segmentation_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Scene_polyhedron_shortest_path_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Shortest_path_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/VSA_wrapper.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Scene_facegraph_transform_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Scene_facegraph_transform_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Create_bbox_mesh_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Edit_box_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Create_obb_mesh_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PCA/Pca_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_2/Mesh_2_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Optimizer_thread.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin_cgal_code.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Raw_image_dialog.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Volume_plane_thread.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Meshing_thread.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Volume_plane.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Optimization_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin_cgal_code.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/config_mesh_3.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Meshing_thread.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/split_polylines.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/split_polylines.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Io_implicit_function_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Raw_image_dialog.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/C3t3_rib_exporter_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Facet_extra_criterion.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Optimization_plugin_cgal_code.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Volume_plane_interface.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Optimizer_thread.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Volume_plane_intersection.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Volume_plane_intersection.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Hole_filling_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Degenerated_faces_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Hole_filling_polyline_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Orient_soup_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Fairing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Polyhedron_stitching_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Detect_sharp_edges_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Scene_mcf_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Jet_fitting_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Triangulate_facets_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Scene_mcf_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Polyhedron_slicer_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Corefinement_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Mean_curvature_flow_skeleton_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Smoothing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Classification_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Surface_mesh_item_classification.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Surface_mesh_item_classification.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Cluster_classification.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Item_classification_base.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/Nef_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/OFF_to_nef_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/3mf_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/WKT_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/XYZ_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/lcc_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/STL_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/Implicit_function_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/GOCAD_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/Surf_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/OFF_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/IO/LAS_io_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Operations_on_polyhedra/Diff_between_meshes_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Operations_on_polyhedra/Clip_polyhedron_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_vertices_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Operations_on_polyhedra/Partition_graph_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Camera_position/Camera_positions_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Convex_hull/Convex_hull_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Convex_hull/Kernel_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/AABB_tree/Scene_movable_sm_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/AABB_tree/Scene_movable_sm_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Three_examples/Example_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Three_examples/Basic_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Three_examples/Basic_item_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Three_examples/Dock_widget_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Plugins/Three_examples/Group_item_plugin.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Nef_type.h
Examining data/cgal-5.1.1/demo/Polyhedron/File_loader_dialog.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_nef_polyhedron_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/MainWindow_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Triangle_container.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/CGAL_double_edit.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_nef_polyhedron_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/texture.h
Examining data/cgal-5.1.1/demo/Polyhedron/Viewer.h
Examining data/cgal-5.1.1/demo/Polyhedron/config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polylines_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Polyhedron_demo_plugin_helper.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_points_with_normal_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/C3t3_type.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_item_rendering_helper.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Image_type.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_image_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Show_point_dialog.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polyhedron_item_decorator_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/properties.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_implicit_function_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/create_sphere.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polylines_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_plane_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_group_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Kernel_type.h
Examining data/cgal-5.1.1/demo/Polyhedron/PMP.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_points_with_normal_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polygon_soup_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_surface_mesh_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Color_map.h
Examining data/cgal-5.1.1/demo/Polyhedron/Nef_type_fwd.h
Examining data/cgal-5.1.1/demo/Polyhedron/triangulate_primitive.h
Examining data/cgal-5.1.1/demo/Polyhedron/CGAL_double_edit.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_find_items.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_nef_polyhedron_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Messages_interface.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_spheres_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/MainWindow.h
Examining data/cgal-5.1.1/demo/Polyhedron/Classification.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Point_container.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polyhedron_shortest_path_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Callback_signaler.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Polyhedron_demo.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_lcc_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_spheres_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_image_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_points_with_normal_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polyhedron_selection_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/SMesh_type.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_image_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polyhedron_selection_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/One_ring_iterators.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_basic_objects_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polylines_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_textured_polyhedron_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polygon_soup_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_c3t3_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polygon_soup_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Viewer.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/C2t3_type.h
Examining data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Color_ramp.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Edge_container.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/texture.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Use_ssh.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Three.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_implicit_function_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_surface_mesh_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Polyhedron_demo_detect_sharp_edges.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_textured_surface_mesh_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Server_ws.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Image_type_fwd.h
Examining data/cgal-5.1.1/demo/Polyhedron/Show_point_dialog.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_c3t3_item_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Color_ramp.h
Examining data/cgal-5.1.1/demo/Polyhedron/Travel_isolated_components.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_surface_mesh_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/Polyhedron_3.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Polyhedron_demo_config.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polyhedron_item_decorator.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_plane_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/include/QMultipleInputDialog.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/Progress_bar_callback.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/run_with_qprogressdialog.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/Qt_progress_bar_callback.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/statistics_helpers.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Make_bar.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Textured_polyhedron_builder.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Facet_with_id_pmap.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Dualizer.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Make_quad_soup.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Polyhedron_kernel.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Make_triangle_soup.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/Use_ssh.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/translate.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/IO/read_surf_trianglemesh.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/textured_polyhedron.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/CGAL/gocad_io.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/Point_set_3.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/id_printing.h
Examining data/cgal-5.1.1/demo/Polyhedron/include/UI_point_3.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_textured_surface_mesh_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/implicit_functions/Klein_implicit_function.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/implicit_functions/Implicit_function_interface.h
Examining data/cgal-5.1.1/demo/Polyhedron/implicit_functions/Sphere_implicit_function.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/implicit_functions/Tanglecube_implicit_function.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Mesh_3.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Polyhedron_demo.h
Examining data/cgal-5.1.1/demo/Polyhedron/Callback_signaler.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_implicit_function_item.h
Examining data/cgal-5.1.1/demo/Polyhedron/TextRenderer.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_c3t3_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polyhedron_item_decorator.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
Examining data/cgal-5.1.1/demo/Polyhedron/Selection_visualizer.h
Examining data/cgal-5.1.1/demo/Polyhedron/Scene_lcc_item.cpp
Examining data/cgal-5.1.1/demo/Generator/Generator_2.cpp
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/P4HDT2.cpp
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/hyperbolic_free_motion_animation.h
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/TriangulationCircumcircle.h
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/VoronoiGraphicsItem.h
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/TriangulationPointInput.h
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/TriangulationConflictZone.h
Examining data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/TriangulationGraphicsItem.h
Examining data/cgal-5.1.1/demo/Convex_hull_3/quickhull_3_demo.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/colorlisteditor.h
Examining data/cgal-5.1.1/demo/Surface_mesher/Surface_mesher.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/Raw_image_dialog.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/values_list.h
Examining data/cgal-5.1.1/demo/Surface_mesher/colorlisteditor.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/values_list.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/binary_image.h
Examining data/cgal-5.1.1/demo/Surface_mesher/surface.h
Examining data/cgal-5.1.1/demo/Surface_mesher/viewer.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/File_XT.h
Examining data/cgal-5.1.1/demo/Surface_mesher/mainwindow.h
Examining data/cgal-5.1.1/demo/Surface_mesher/mainwindow.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/polyhedral_surface.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/volume.cpp
Examining data/cgal-5.1.1/demo/Surface_mesher/volume.h
Examining data/cgal-5.1.1/demo/Surface_mesher/polyhedral_surface.h
Examining data/cgal-5.1.1/demo/Surface_mesher/Raw_image_dialog.h
Examining data/cgal-5.1.1/demo/Surface_mesher/viewer.h
Examining data/cgal-5.1.1/demo/Surface_mesher/get_polyhedral_surface.h
Examining data/cgal-5.1.1/demo/Principal_component_analysis/Viewer.h
Examining data/cgal-5.1.1/demo/Principal_component_analysis/PCA_demo.cpp
Examining data/cgal-5.1.1/demo/Principal_component_analysis/Scene.h
Examining data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.h
Examining data/cgal-5.1.1/demo/Principal_component_analysis/Scene.cpp
Examining data/cgal-5.1.1/demo/Principal_component_analysis/types.h
Examining data/cgal-5.1.1/demo/Principal_component_analysis/Viewer.cpp
Examining data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.cpp
Examining data/cgal-5.1.1/demo/Polygon/Polygon_2.cpp
Examining data/cgal-5.1.1/demo/Periodic_3_triangulation_3/Viewer.h
Examining data/cgal-5.1.1/demo/Periodic_3_triangulation_3/Scene.h
Examining data/cgal-5.1.1/demo/Periodic_3_triangulation_3/MainWindow.h
Examining data/cgal-5.1.1/demo/Periodic_3_triangulation_3/Scene.cpp
Examining data/cgal-5.1.1/demo/Periodic_3_triangulation_3/Viewer.cpp
Examining data/cgal-5.1.1/demo/Periodic_3_triangulation_3/Scene_utils.h
Examining data/cgal-5.1.1/demo/Periodic_3_triangulation_3/periodic_3_triangulation_3_demo.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3_Geomview_demos/Triangulation_3_voronoi_demo.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3_Geomview_demos/Triangulation_3_demo.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3_Geomview_demos/Triangulation_3_color_demo.cpp
Examining data/cgal-5.1.1/demo/Triangulation_3_Geomview_demos/Triangulation_3_remove_demo.cpp
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/HDT2.cpp
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/TriangulationRemoveVertex.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicVoronoiGraphicsItem.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/TriangulationCircumcircle.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/TriangulationMovingPoint.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/TriangulationGraphicsItemWithColorInfo.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/TriangulationConflictZone.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/TriangulationPointInputAndConflictZone.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h
Examining data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/include/internal/Qt/TriangulationGraphicsItem.h
Examining data/cgal-5.1.1/demo/Alpha_shapes_2/Alpha_shapes_2.cpp
Examining data/cgal-5.1.1/demo/Linear_cell_complex/Viewer.h
Examining data/cgal-5.1.1/demo/Linear_cell_complex/Linear_cell_complex_pqq_subdivision.cpp
Examining data/cgal-5.1.1/demo/Linear_cell_complex/import_moka.h
Examining data/cgal-5.1.1/demo/Linear_cell_complex/typedefs.h
Examining data/cgal-5.1.1/demo/Linear_cell_complex/MainWindow.h
Examining data/cgal-5.1.1/demo/Linear_cell_complex/Linear_cell_complex_3_demo.cpp
Examining data/cgal-5.1.1/demo/Linear_cell_complex/Linear_cell_complex_3_subdivision.cpp
Examining data/cgal-5.1.1/demo/Linear_cell_complex/Viewer.cpp
Examining data/cgal-5.1.1/demo/Linear_cell_complex/MainWindow.cpp
Examining data/cgal-5.1.1/demo/AABB_tree/Refiner.h
Examining data/cgal-5.1.1/demo/AABB_tree/Viewer.h
Examining data/cgal-5.1.1/demo/AABB_tree/AABB_demo.cpp
Examining data/cgal-5.1.1/demo/AABB_tree/Scene.h
Examining data/cgal-5.1.1/demo/AABB_tree/MainWindow.h
Examining data/cgal-5.1.1/demo/AABB_tree/Scene.cpp
Examining data/cgal-5.1.1/demo/AABB_tree/types.h
Examining data/cgal-5.1.1/demo/AABB_tree/Viewer.cpp
Examining data/cgal-5.1.1/demo/AABB_tree/MainWindow.cpp
Examining data/cgal-5.1.1/demo/AABB_tree/benchmarks.cpp
Examining data/cgal-5.1.1/demo/AABB_tree/Color_ramp.h
Examining data/cgal-5.1.1/demo/Largest_empty_rect_2/Largest_empty_rectangle_2.cpp
Examining data/cgal-5.1.1/demo/Apollonius_graph_2/Apollonius_graph_2.cpp
Examining data/cgal-5.1.1/demo/Circular_kernel_2/Circular_kernel_2.cpp
Examining data/cgal-5.1.1/demo/Circular_kernel_2/ArcsGraphicsItem.h
Examining data/cgal-5.1.1/demo/Alpha_shapes_3/Viewer.h
Examining data/cgal-5.1.1/demo/Alpha_shapes_3/typedefs.h
Examining data/cgal-5.1.1/demo/Alpha_shapes_3/MainWindow.h
Examining data/cgal-5.1.1/demo/Alpha_shapes_3/Viewer.cpp
Examining data/cgal-5.1.1/demo/Alpha_shapes_3/MainWindow.cpp
Examining data/cgal-5.1.1/demo/Alpha_shapes_3/Alpha_shape_3.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/fgetns.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/Image_3.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/recline.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/gis.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/recbuffer.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/bmpendian.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/gif.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/iris.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/convert.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/analyze.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/inr.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/pnm.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/bmp.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/reech4x4.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/ImageIO.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/bmpread.cpp
Examining data/cgal-5.1.1/src/CGAL_ImageIO/mincio.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/GraphicsViewNavigation.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/GraphicsViewPolylineInput.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/manipulatedCameraFrame.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/manipulatedFrame.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/mouseGrabber.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/resources.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/debug.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/camera.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/frame.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/vec.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/constraint.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/quaternion.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/utility.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/keyFrameInterpolator.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/DemosMainWindow.cpp
Examining data/cgal-5.1.1/src/CGAL_Qt5/qglviewer.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/GmpIO.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/Real.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/extLong.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/CoreAux.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/CoreIO.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/CoreDefs.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/BigFloat.cpp
Examining data/cgal-5.1.1/src/CGAL_Core/Expr.cpp
Examining data/cgal-5.1.1/src/CGAL/Timer.cpp
Examining data/cgal-5.1.1/src/CGAL/File_scanner_OFF.cpp
Examining data/cgal-5.1.1/src/CGAL/Real_timer.cpp
Examining data/cgal-5.1.1/src/CGAL/io.cpp
Examining data/cgal-5.1.1/src/CGAL/File_writer_VRML_2.cpp
Examining data/cgal-5.1.1/src/CGAL/File_header_extended_OFF.cpp
Examining data/cgal-5.1.1/src/CGAL/Interval_arithmetic.cpp
Examining data/cgal-5.1.1/src/CGAL/Random.cpp
Examining data/cgal-5.1.1/src/CGAL/kernel.cpp
Examining data/cgal-5.1.1/src/CGAL/File_writer_inventor.cpp
Examining data/cgal-5.1.1/src/CGAL/test_FPU_rounding_mode.cpp
Examining data/cgal-5.1.1/src/CGAL/assertions.cpp
Examining data/cgal-5.1.1/src/CGAL/Geomview_stream.cpp
Examining data/cgal-5.1.1/src/CGAL/File_header_OFF.cpp
Examining data/cgal-5.1.1/src/CGAL/File_writer_wavefront.cpp
Examining data/cgal-5.1.1/src/CGAL/Color.cpp
Examining data/cgal-5.1.1/src/CGAL/File_writer_OFF.cpp
Examining data/cgal-5.1.1/cmake/modules/test_MPFI.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_MATCHING_BUG_6.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_MATCHING_BUG_8.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_ISTREAM_INT_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_NO_STL.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_NUMERIC_LIMITS_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_DENORMALS_COMPILE_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_MATCHING_BUG_7.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_USING_BASE_MEMBER_BUG_2.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_NO_NEXTAFTER.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_MATCHING_BUG_5.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_NO_LIMITS.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/testfiles/CGAL_CFG_IEEE_754_BUG.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_GCC_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_X11.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_ZLIB_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_MPFI_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_IntelCompiler_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_OPENGL_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_BOOST_PROGRAM_OPTIONS.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_BOOST_THREAD.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_GMP.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_ZLIB.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/CGAL_test_cpp_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_OPENGL.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_LEDAWIN.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_MPFR_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_LEDA_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_BOOST_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_syntaxonly.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_QT4_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_LEDA.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_GMP_version.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_QT.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_BOOST.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_MPFR.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_LIDIA.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/test_GMPXX.cpp
Examining data/cgal-5.1.1/cmake/modules/config/support/print_QT_version.cpp
Examining data/cgal-5.1.1/include/CGAL/poisson_surface_reconstruction.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Ray_hit_generator2.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/External_structure_builder.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/YVertical_wall_builder.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Single_wall_creator2.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Reflex_vertex_searcher.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Single_wall_creator3.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Ray_hit_generator.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/SFace_separator.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/is_reflex_sedge.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Edge_sorter.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Reflex_edge_searcher.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/SM_walls.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Insert_vertex_into_edge.h
Examining data/cgal-5.1.1/include/CGAL/Convex_decomposition_3/Single_wall_creator.h
Examining data/cgal-5.1.1/include/CGAL/leda_bigfloat.h
Examining data/cgal-5.1.1/include/CGAL/Polytope_distance_d_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_euclidean_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Robust_weighted_circumcenter_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_hierarchy_3.h
Examining data/cgal-5.1.1/include/CGAL/read_vtk_image_data.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_circles/internal_functions_comparison_root_for_circles_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_circles/function_objects_on_roots_and_polynomials_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_circles/internal_functions_on_roots_and_polynomial_1_2_and_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_circles/internal_functions_on_roots_and_polynomials_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Pair_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/simple_objects.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Kernel_classesHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/DirectionHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/HyperplaneHd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Iso_box_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Aff_transformationCd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Cartesian_const_iterator_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/PointHd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Vector__.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/intersection_objectsCd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/function_objectsHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Line_d_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Tuple_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Sphere_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Interval_linear_algebra.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Point_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/VectorHd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/PointCd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Aff_transformation_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Interface_classes.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Line_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/VectorHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Matrix__.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Cartesian_converter_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Hyperplane_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Direction_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/DirectionCd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Kernel_classesCd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Vector_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/PointCd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Aff_transformationHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/interface_macros_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/function_objectsCd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/function_objects.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Ray_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/DirectionHd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/VectorCd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/HyperplaneHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/DirectionCd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/PointHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/debug.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/intersection_objects_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/HyperplaneCd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Segment_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/intersection_objectsHd.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/Linear_algebraCd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/HyperplaneCd_impl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_d/VectorCd.h
Examining data/cgal-5.1.1/include/CGAL/subdivide_union_of_balls_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/transforming_pair_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Enum_converter.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_conformer_2.h
Examining data/cgal-5.1.1/include/CGAL/rectangular_3_center_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_hierarchy_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/vcm_estimate_edges.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/CORE_BigFloat.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_base.h
Examining data/cgal-5.1.1/include/CGAL/Image_3_impl.h
Examining data/cgal-5.1.1/include/CGAL/Filter_circulator.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/Dynamic_matrix.h
Examining data/cgal-5.1.1/include/CGAL/Has_conversion.h
Examining data/cgal-5.1.1/include/CGAL/copy_n.h
Examining data/cgal-5.1.1/include/CGAL/Circle_type.h
Examining data/cgal-5.1.1/include/CGAL/Arr_walk_along_line_point_location.h
Examining data/cgal-5.1.1/include/CGAL/ch_jarvis.h
Examining data/cgal-5.1.1/include/CGAL/GMap_cell_iterators.h
Examining data/cgal-5.1.1/include/CGAL/Set_movable_separability_2/Single_mold_translational_casting/pullout_directions.h
Examining data/cgal-5.1.1/include/CGAL/Set_movable_separability_2/Single_mold_translational_casting/is_pullout_direction.h
Examining data/cgal-5.1.1/include/CGAL/Set_movable_separability_2/Single_mold_translational_casting/top_edges.h
Examining data/cgal-5.1.1/include/CGAL/Set_movable_separability_2/internal/Utils.h
Examining data/cgal-5.1.1/include/CGAL/Set_movable_separability_2/internal/Circle_arrangment.h
Examining data/cgal-5.1.1/include/CGAL/Min_circle_2.h
Examining data/cgal-5.1.1/include/CGAL/Sorted_matrix_search_traits_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_zone_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_vertex.h
Examining data/cgal-5.1.1/include/CGAL/is_y_monotone_2.h
Examining data/cgal-5.1.1/include/CGAL/random_convex_hull_in_disc_2.h
Examining data/cgal-5.1.1/include/CGAL/make_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_projective_xz_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian_converter_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Modifier_base.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_copy_3.h
Examining data/cgal-5.1.1/include/CGAL/Umbilics.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_points_d_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_tetrahedra_3.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension.h
Examining data/cgal-5.1.1/include/CGAL/minkowski_sum_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Alpha_expansion_MaxFlow_tag.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Regular_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/METIS/partition_graph.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/METIS/partition_dual_graph.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_OpenMesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/io.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/convert_nef_polyhedron_to_polygon_mesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_PolyMesh_ArrayKernelT.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/visitor.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/alpha_expansion_graphcut.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Euler_operations.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_OpenMesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Graph_with_descriptor_with_graph_fwd.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/backward_compatibility_functions.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/selection.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/copy_face_graph.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/halfedge_graph_traits_HalfedgeDS.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Dual.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Polyhedron_3_features.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/dijkstra_shortest_paths.hpp
Examining data/cgal-5.1.1/include/CGAL/boost/graph/split_graph_into_polylines.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/dijkstra_shortest_paths.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/partition.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_HalfedgeDS.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_TriMesh_ArrayKernelT.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Arrangement_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_concepts.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/helpers.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_TriMesh_ArrayKernelT.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Surface_mesh_features.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Seam_mesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Graph_with_descriptor_with_graph.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/generators.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Seam_mesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/halfedge_graph_traits.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/Has_member_clear.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/properties_2D_triangulation.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/helpers.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/initialized_index_maps_helpers.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/OM_iterator_from_circulator.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/internal/Has_member_id.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/parameters_interface.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Face_filtered_graph.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Linear_cell_complex_for_combinatorial_map.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Seam_mesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/Named_function_parameters.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/iterator.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/named_params_helper.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/properties_PolyMesh_ArrayKernelT.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/property_maps.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_HalfedgeDS_default.h
Examining data/cgal-5.1.1/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/boost/bimap.hpp
Examining data/cgal-5.1.1/include/CGAL/boost/parameter.h
Examining data/cgal-5.1.1/include/CGAL/boost/bimap/multiset_of.hpp
Examining data/cgal-5.1.1/include/CGAL/boost/iterator/counting_iterator.hpp
Examining data/cgal-5.1.1/include/CGAL/boost/iterator/transform_iterator.hpp
Examining data/cgal-5.1.1/include/CGAL/Polygon_nop_decomposition_2.h
Examining data/cgal-5.1.1/include/CGAL/pointmatcher/compute_registration_transformation.h
Examining data/cgal-5.1.1/include/CGAL/pointmatcher/register_point_sets.h
Examining data/cgal-5.1.1/include/CGAL/lloyd_optimize_mesh_2.h
Examining data/cgal-5.1.1/include/CGAL/enum.h
Examining data/cgal-5.1.1/include/CGAL/Parabola_segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Uncertain.h
Examining data/cgal-5.1.1/include/CGAL/Counted_number.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_tags.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_complex_3_in_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_optimization_return_code.h
Examining data/cgal-5.1.1/include/CGAL/Arithmetic_kernel/Arithmetic_kernel_base.h
Examining data/cgal-5.1.1/include/CGAL/Modular_arithmetic/Residue_type.h
Examining data/cgal-5.1.1/include/CGAL/vcm_estimate_normals.h
Examining data/cgal-5.1.1/include/CGAL/number_type_config.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_using_list_2.h
Examining data/cgal-5.1.1/include/CGAL/vector.h
Examining data/cgal-5.1.1/include/CGAL/perturb_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesh_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/draw_polygon_with_holes_2.h
Examining data/cgal-5.1.1/include/CGAL/Eigen_diagonalize_traits.h
Examining data/cgal-5.1.1/include/CGAL/Triangular_field_2.h
Examining data/cgal-5.1.1/include/CGAL/Spatial_sort_traits_adapter_d.h
Examining data/cgal-5.1.1/include/CGAL/Range_tree_d.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_median_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_circular_line_arc_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2.h
Examining data/cgal-5.1.1/include/CGAL/Scale_space_surface_reconstruction_3.h
Examining data/cgal-5.1.1/include/CGAL/basic.h
Examining data/cgal-5.1.1/include/CGAL/Union_of_balls_3.h
Examining data/cgal-5.1.1/include/CGAL/Threetuple.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_triangulation_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher_generator.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_mesh_3/config.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_mesh_3/IO/File_medit.h
Examining data/cgal-5.1.1/include/CGAL/Mesher_level_visitors.h
Examining data/cgal-5.1.1/include/CGAL/gmp.h
Examining data/cgal-5.1.1/include/CGAL/rational_rotation.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_simplicity.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_edge_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2/polygon_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_algorithms_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_edge_circulator.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_vertex_circulator.h
Examining data/cgal-5.1.1/include/CGAL/CMap_linear_cell_complex_storages.h
Examining data/cgal-5.1.1/include/CGAL/hilbert_sort.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/CORE_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map.h
Examining data/cgal-5.1.1/include/CGAL/SCIP_mixed_integer_program_traits.h
Examining data/cgal-5.1.1/include/CGAL/Exact_predicates_exact_constructions_kernel_with_kth_root.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_items_2.h
Examining data/cgal-5.1.1/include/CGAL/point_set_processing_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Cell_attribute.h
Examining data/cgal-5.1.1/include/CGAL/N_step_adaptor_derived.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_cuboids_3.h
Examining data/cgal-5.1.1/include/CGAL/Fixed_alpha_shape_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_offset_2.h
Examining data/cgal-5.1.1/include/CGAL/config.h
Examining data/cgal-5.1.1/include/CGAL/Exact_spherical_kernel_3.h
Examining data/cgal-5.1.1/include/CGAL/Env_triangle_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/CC_safe_handle.h
Examining data/cgal-5.1.1/include/CGAL/make_periodic_3_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_arc_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Index_property_map.h
Examining data/cgal-5.1.1/include/CGAL/GMap_dart_iterators.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/orientation.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/merge_border_vertices.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/self_intersections.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/smooth_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/random_perturbation.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/locate.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/corefinement.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/distance.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/bbox.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/Weights.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/smooth_shape.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/refine.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/clip.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/fair.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/transform.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/detect_features.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/connected_components.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/extrude.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/border.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/mesh_to_point_set_hausdorff_distance.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/named_function_params.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Snapping/helper.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/repair_extra.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/AABB_filtered_projection_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/do_no_use_CDT2.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Side_of_triangle_mesh/Ray_3_Triangle_3_traversal_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Side_of_triangle_mesh/Point_inside_vertical_ray_cast.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polygon_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/do_not_use_DT3.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/experimental/experimental_code.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Traversal_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Smoothing/smoothing_evaluation.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Smoothing/ceres_support.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Smoothing/mesh_smoothing_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/named_params_helper.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_transformation.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Intersection_type.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Face_graph_output_builder.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/predicates.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Output_builder_for_autorefinement.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Visitor.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_callbacks.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/repair.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/intersection.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/repair_polygon_soup.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/triangulate_hole.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/remesh.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/shape_predicates.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/compute_normal.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/triangulate_faces.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/manifoldness.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/measure.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/stitch_borders.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/orient_polygon_soup.h
Examining data/cgal-5.1.1/include/CGAL/random_polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Generic_map_selector.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Shortest_noncontractible_cycle.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_on_surface_with_rle.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Facewidth.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Iterators_for_face_graph_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Minimal_quadrangulation.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Edge_weight_functor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Functors_for_face_graph_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Fourtuple.h
Examining data/cgal-5.1.1/include/CGAL/create_offset_polygons_from_polygon_with_holes_2.h
Examining data/cgal-5.1.1/include/CGAL/Cell_iterators.h
Examining data/cgal-5.1.1/include/CGAL/graph_traits_dual_arrangement_with_history_2.h
Examining data/cgal-5.1.1/include/CGAL/BOOST_MP_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_incremental_builder.h
Examining data/cgal-5.1.1/include/CGAL/Fixed_alpha_shape_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Exact_kernel_selector.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbolic_triangulation_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_2.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_3.h
Examining data/cgal-5.1.1/include/CGAL/cartesian_homogeneous_conversion.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_refinement_policy_3.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Cached_extended_euclidean_algorithm.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/polynomial_gcd_ntl.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/fwd.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Chinese_remainder_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/polynomial_gcd.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Monomial_representation.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Scalar_factor_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/prs_resultant.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/modular_gcd.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Polynomial_type.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/hgdelta_update.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Modular_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/square_free_factorize.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/modular_gcd_utcf_dfai.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Algebraic_structure_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Degree.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/bezout_matrix.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/modular_filter.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/polynomial_gcd_implementations.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/modular_gcd_utils.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/subresultants.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Interpolator.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Real_embeddable_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Get_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/resultant.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/sturm_habicht_sequence.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/determinant.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/misc.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/modular_gcd_utcf_algorithm_M.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial/Fraction_traits.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_iterators_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/No_intersection_surface_sweep_2.h
Examining data/cgal-5.1.1/include/CGAL/Polygonal_schema_min_items.h
Examining data/cgal-5.1.1/include/CGAL/draw_nef_3.h
Examining data/cgal-5.1.1/include/CGAL/Generalized_map_save_load.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_3_1.h
Examining data/cgal-5.1.1/include/CGAL/Inverse_index.h
Examining data/cgal-5.1.1/include/CGAL/Residue.h
Examining data/cgal-5.1.1/include/CGAL/Advancing_front_surface_reconstruction.h
Examining data/cgal-5.1.1/include/CGAL/Interpolation_gradient_fitting_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_utils_2.h
Examining data/cgal-5.1.1/include/CGAL/Search_traits.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_converter_2.h
Examining data/cgal-5.1.1/include/CGAL/Constrained_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_middle_3.h
Examining data/cgal-5.1.1/include/CGAL/Dummy_tds_2.h
Examining data/cgal-5.1.1/include/CGAL/Weighted_alpha_shape_euclidean_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/offset_polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/Profile_counter.h
Examining data/cgal-5.1.1/include/CGAL/GMap_linear_cell_complex_storages.h
Examining data/cgal-5.1.1/include/CGAL/Interpolation/internal/helpers.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_data_structure.h
Examining data/cgal-5.1.1/include/CGAL/Handle_hash_function.h
Examining data/cgal-5.1.1/include/CGAL/predicates_on_lines_2.h
Examining data/cgal-5.1.1/include/CGAL/distance_predicates_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Orientation_Linf_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/basic.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Oriented_side_of_bisector_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Voronoi_vertex_sqrt_field_new_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Filtered_traits_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Traits_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Bisector_Linf.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Oriented_side_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Constructions_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Voronoi_vertex_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Segment_Delaunay_graph_Linf_hierarchy_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Basic_predicates_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Predicates_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Finite_edge_interior_conflict_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Infinite_edge_interior_conflict_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Voronoi_vertex_ring_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Vertex_conflict_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2/Segment_Delaunay_graph_Linf_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_points_d_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/Random_polygon_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/PCA_util.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_spheres/internal_functions_on_roots_and_polynomial_1_3_and_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_spheres/internal_functions_on_roots_and_polynomials_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_spheres/function_objects_on_roots_and_polynomials_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_spheres/internal_functions_comparison_root_for_spheres_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_spheres/internal_functions_on_roots_and_polynomials_1_3.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_projective_yz_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/make_union_of_balls_3.h
Examining data/cgal-5.1.1/include/CGAL/exude_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Snap_rounding_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Modifiable_priority_queue.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_circles_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_face_base_with_info_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_overlay_2.h
Examining data/cgal-5.1.1/include/CGAL/Compact_container.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/Vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/simplify.h
Examining data/cgal-5.1.1/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_storage_traits_with_info_2.h
Examining data/cgal-5.1.1/include/CGAL/all_furthest_neighbors_2.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_list.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/surface_mesh_parameterization.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_Delaunay_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Min_annulus_d.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/AABB_triangulation_3_cell_primitive.h
Examining data/cgal-5.1.1/include/CGAL/CGAL_Ipelet_base.h
Examining data/cgal-5.1.1/include/CGAL/Dimension.h
Examining data/cgal-5.1.1/include/CGAL/Sweep_line_2_algorithms.h
Examining data/cgal-5.1.1/include/CGAL/Projection_traits_xy_3.h
Examining data/cgal-5.1.1/include/CGAL/Cell_attribute_with_point_and_id.h
Examining data/cgal-5.1.1/include/CGAL/Object.h
Examining data/cgal-5.1.1/include/CGAL/mpq_class.h
Examining data/cgal-5.1.1/include/CGAL/Search_traits_adapter.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_annulus_d_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/Arr_naive_point_location.h
Examining data/cgal-5.1.1/include/CGAL/gnuplot_output_2.h
Examining data/cgal-5.1.1/include/CGAL/GMap_dart_const_iterators.h
Examining data/cgal-5.1.1/include/CGAL/apply_to_range.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Fig_stream_Curve_renderer_2.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
Examining data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_face_map.h
Examining data/cgal-5.1.1/include/CGAL/Complexity_tags.h
Examining data/cgal-5.1.1/include/CGAL/Kd_tree_rectangle.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Env_surface_data_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Snap_rounding_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_type_equality_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_traits_generator_3.h
Examining data/cgal-5.1.1/include/CGAL/Spherical_kernel_intersections.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_facet_criteria_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_tree_k.h
Examining data/cgal-5.1.1/include/CGAL/Origin.h
Examining data/cgal-5.1.1/include/CGAL/demangle.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_3_2.h
Examining data/cgal-5.1.1/include/CGAL/kernel_assertions.h
Examining data/cgal-5.1.1/include/CGAL/polygon_function_objects.h
Examining data/cgal-5.1.1/include/CGAL/Quotient.h
Examining data/cgal-5.1.1/include/CGAL/OTR_2/Reconstruction_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/OTR_2/Reconstruction_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/OTR_2/Sample.h
Examining data/cgal-5.1.1/include/CGAL/OTR_2/Reconstruction_edge_2.h
Examining data/cgal-5.1.1/include/CGAL/OTR_2/Reconstruction_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/OTR_2/Cost.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_basic_operations.h
Examining data/cgal-5.1.1/include/CGAL/Tools/chained_map.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian_d.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_construction.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_storage_site_with_info_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_tree_d.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_polyhedral_items_3.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_vertical_decomposition_2.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_triangulation.h
Examining data/cgal-5.1.1/include/CGAL/Image_3_vtk_interface.h
Examining data/cgal-5.1.1/include/CGAL/Interval_traits.h
Examining data/cgal-5.1.1/include/CGAL/primes.h
Examining data/cgal-5.1.1/include/CGAL/Simple_homogeneous.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh/IO/PLY.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh/IO/3mf.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh/Properties.h
Examining data/cgal-5.1.1/include/CGAL/MSVC_compiler_config.h
Examining data/cgal-5.1.1/include/CGAL/assertions.h
Examining data/cgal-5.1.1/include/CGAL/FPU.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_hierarchy_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/GMP/Gmpfr_type.h
Examining data/cgal-5.1.1/include/CGAL/GMP/Gmpfi_type_static.h
Examining data/cgal-5.1.1/include/CGAL/GMP/Gmpz_type.h
Examining data/cgal-5.1.1/include/CGAL/GMP/Gmpfi_type.h
Examining data/cgal-5.1.1/include/CGAL/GMP/Gmpzf_type.h
Examining data/cgal-5.1.1/include/CGAL/GMP/Gmpfr_type_static.h
Examining data/cgal-5.1.1/include/CGAL/GMP/Gmpq_type.h
Examining data/cgal-5.1.1/include/CGAL/Handle_for_virtual.h
Examining data/cgal-5.1.1/include/CGAL/Regular_complex_d.h
Examining data/cgal-5.1.1/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Dart.h
Examining data/cgal-5.1.1/include/CGAL/Min_quadrilateral_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_4_hyperbolic_triangulation_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/PolyhedralSurf_neighbors.h
Examining data/cgal-5.1.1/include/CGAL/Polygonal_schema.h
Examining data/cgal-5.1.1/include/CGAL/Random_access_value_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/Robust_construction.h
Examining data/cgal-5.1.1/include/CGAL/Cell_attribute_with_id.h
Examining data/cgal-5.1.1/include/CGAL/Arr_enums.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_predicate.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_triangles_3.h
Examining data/cgal-5.1.1/include/CGAL/Arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Buffer_for_vao.h
Examining data/cgal-5.1.1/include/CGAL/use.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_3.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_vertex_max_base_with_id.h
Examining data/cgal-5.1.1/include/CGAL/Chinese_remainder_traits.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation.h
Examining data/cgal-5.1.1/include/CGAL/cluster_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Number_types/internal_functions_comparison_root_of_2.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_configure.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation_impl.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_debug.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_traits_adapter_2.h
Examining data/cgal-5.1.1/include/CGAL/argument_swaps.h
Examining data/cgal-5.1.1/include/CGAL/number_type_basic.h
Examining data/cgal-5.1.1/include/CGAL/Gray_level_image_3.h
Examining data/cgal-5.1.1/include/CGAL/create_offset_polygons_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_circular_arc_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian_matrix.h
Examining data/cgal-5.1.1/include/CGAL/Fuzzy_sphere.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_bykat_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_eddy_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_selected_extreme_points_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_melkman_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_akl_toussaint_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_graham_andrew_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/convexity_check_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_2/ch_jarvis_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_dcel_base.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_vertex_base.h
Examining data/cgal-5.1.1/include/CGAL/structure_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Combination_enumerator.h
Examining data/cgal-5.1.1/include/CGAL/envelope_2.h
Examining data/cgal-5.1.1/include/CGAL/Side_of_triangle_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Line_3.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Poisson_reconstruction_function.h
Examining data/cgal-5.1.1/include/CGAL/distance_predicates_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_non_caching_segment_basic_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Eigen_vector.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_face_min_base.h
Examining data/cgal-5.1.1/include/CGAL/kernel_config.h
Examining data/cgal-5.1.1/include/CGAL/Gmpzf.h
Examining data/cgal-5.1.1/include/CGAL/predicates_d.h
Examining data/cgal-5.1.1/include/CGAL/convex_hull_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_spheres_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Bbox_3.h
Examining data/cgal-5.1.1/include/CGAL/Random_access_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/sorted_matrix_search.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_ds_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_points_2.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Line_2.h
Examining data/cgal-5.1.1/include/CGAL/ch_graham_andrew.h
Examining data/cgal-5.1.1/include/CGAL/Classification.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_constant_domain_field_3.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesher_no_edge_refinement_2.h
Examining data/cgal-5.1.1/include/CGAL/Weighted_alpha_shape_euclidean_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_for_bgl_combinatorial_map_helper.h
Examining data/cgal-5.1.1/include/CGAL/Width_3.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_halfedge_max_base_with_id.h
Examining data/cgal-5.1.1/include/CGAL/Stream_lines_2.h
Examining data/cgal-5.1.1/include/CGAL/convexity_check_3.h
Examining data/cgal-5.1.1/include/CGAL/MP_Float.h
Examining data/cgal-5.1.1/include/CGAL/Scalar_factor_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polytope_distance_d.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_solution_impl.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/Unbounded_direction.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/basic.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_partial_filtered_pricing.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_basis_inverse.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/assertions.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_basis_inverse_impl.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_partial_exact_pricing.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_full_exact_pricing.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/Initialization.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP__filtered_base.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/functors.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_solver_impl.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_full_filtered_pricing.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_functions_impl.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP__filtered_base_impl.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_solver.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_pricing_strategy.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_solver_bounds_impl.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/debug.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP__partial_base.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_exact_bland_pricing.h
Examining data/cgal-5.1.1/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Refine_edges.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Mesh_sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Uniform_sizing_field_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Output_stream.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Lloyd_move_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Do_not_refine_edges.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Refine_edges_with_clusters.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Mesh_global_optimizer_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Sizing_field_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Lipschitz_sizing_field_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Refine_faces.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Face_badness.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Clusters.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_2/Refine_edges_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_iterators_base.h
Examining data/cgal-5.1.1/include/CGAL/Spherical_kernel_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_site_2.h
Examining data/cgal-5.1.1/include/CGAL/optimize_periodic_3_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/AABB_polyhedron_segment_primitive.h
Examining data/cgal-5.1.1/include/CGAL/Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_items_with_id_3.h
Examining data/cgal-5.1.1/include/CGAL/Width_polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Rectangular_p_center_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_middle_2.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_euclidean_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/float.h
Examining data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Parabola_2.h
Examining data/cgal-5.1.1/include/CGAL/Generalized_map.h
Examining data/cgal-5.1.1/include/CGAL/draw_point_set_3.h
Examining data/cgal-5.1.1/include/CGAL/Join_input_iterator.h
Examining data/cgal-5.1.1/include/CGAL/radial_orient_normals.h
Examining data/cgal-5.1.1/include/CGAL/subdivide_skin_surface_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Identity_policy_2.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_3.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_rectangles_2.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_insertions.h
Examining data/cgal-5.1.1/include/CGAL/convex_hull_3.h
Examining data/cgal-5.1.1/include/CGAL/to_rational.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_partition_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_vertex_base_with_id_2.h
Examining data/cgal-5.1.1/include/CGAL/boost_mp.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_3_to_lcc.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_conic_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_items_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_2.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/Iso_rectangle_d.h
Examining data/cgal-5.1.1/include/CGAL/Env_plane_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterC2.h
Examining data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterH2.h
Examining data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_circle_2/Optimisation_circle_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_circle_2/Optimisation_circle_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_accessor.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_extended_homogeneous.h
Examining data/cgal-5.1.1/include/CGAL/functional.h
Examining data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Min_ellipse_2_adapterC2.h
Examining data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Min_ellipse_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2.h
Examining data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Min_ellipse_2_adapterH2.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_d.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_default_data_structure_2.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/In_place_list.h
Examining data/cgal-5.1.1/include/CGAL/Eigen_matrix.h
Examining data/cgal-5.1.1/include/CGAL/polyhedron_cut_plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Circle_2.h
Examining data/cgal-5.1.1/include/CGAL/draw_voronoi_diagram_2.h
Examining data/cgal-5.1.1/include/CGAL/Cell_const_iterators.h
Examining data/cgal-5.1.1/include/CGAL/AABB_face_graph_triangle_primitive.h
Examining data/cgal-5.1.1/include/CGAL/mesh_segmentation.h
Examining data/cgal-5.1.1/include/CGAL/PCA_util_Eigen.h
Examining data/cgal-5.1.1/include/CGAL/Multi_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_operations.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_fwd.h
Examining data/cgal-5.1.1/include/CGAL/arrange_offset_polygons_2.h
Examining data/cgal-5.1.1/include/CGAL/version_macros.h
Examining data/cgal-5.1.1/include/CGAL/global_functions_on_root_for_sphere_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Bounded_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Polynomials_1_2.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/grabbers.h
Examining data/cgal-5.1.1/include/CGAL/utils.h
Examining data/cgal-5.1.1/include/CGAL/Diagonalize_traits.h
Examining data/cgal-5.1.1/include/CGAL/Extremal_polygon_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/draw_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/Gps_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_SM_visualizor.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Pluecker_line_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_list.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_point_locator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/ID_support_handler.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SFace.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/binop_intersection_tests.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/polygon_mesh_to_nef_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/quotient_coordinates_to_homogeneous_point.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_decorator_traits.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Default_items.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Binary_operation.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Vertex.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_structure.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SM_visualizor.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Infimaximal_box.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Bounding_box_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_simplify.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_sphere_map.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Halffacet.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Halfedge.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/OGL_helper.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_constructor.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/shell_to_nef_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SHalfloop.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_k3_tree_traits.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Volume.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_iteration.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_const_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Edge_edge_overlay.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_SM_overlayer.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/K3_tree.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_items.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Mark_bounded_volumes.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Nef_box.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_FM_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Combine_with_halfspace.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_external_structure.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SHalfedge.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/bounded_side_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/vertex_cycle_to_nef_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_indexed_items.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_SM_explorer.h
Examining data/cgal-5.1.1/include/CGAL/Nef_3/SNC_io_parser.h
Examining data/cgal-5.1.1/include/CGAL/representation_tags.h
Examining data/cgal-5.1.1/include/CGAL/Eigen_svd.h
Examining data/cgal-5.1.1/include/CGAL/Constrained_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/mst_orient_normals.h
Examining data/cgal-5.1.1/include/CGAL/Conic_2.h
Examining data/cgal-5.1.1/include/CGAL/Range_segment_tree_traits.h
Examining data/cgal-5.1.1/include/CGAL/width_assertions.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO.h
Examining data/cgal-5.1.1/include/CGAL/spatial_sort.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous_converter.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_edge_criteria_3.h
Examining data/cgal-5.1.1/include/CGAL/mesh_union_of_balls_3.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_regular_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Iterator_transform.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_polyhedral_items_with_face_information.h
Examining data/cgal-5.1.1/include/CGAL/OFF_to_nef_3.h
Examining data/cgal-5.1.1/include/CGAL/spatial_sort_on_sphere.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_with_info_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_non_intersecting_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/basic.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Compare_y_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_of_bisector_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_sqrt_field_new_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Filtered_traits_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Orientation_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Sqrt_extension_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_hierarchy_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Filtered_traits_concept_check_tags.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Is_degenerate_edge_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_sqrt_field_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Traits_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Constructions_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Cartesian_converter.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Triangulation_face_base_with_edges_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Arrangement_enum.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Are_same_segments_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Basic_predicates_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Predicates_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Finite_edge_interior_conflict_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/in_place_edge_list.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Infinite_edge_interior_conflict_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Compare_x_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_ring_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Are_same_points_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Kernel_wrapper_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Traits_wrapper_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2/Are_parallel_C2.h
Examining data/cgal-5.1.1/include/CGAL/surface_reconstruction_points_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Spatial_sort_traits_adapter_2.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_constructors.h
Examining data/cgal-5.1.1/include/CGAL/make_surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Point_3.h
Examining data/cgal-5.1.1/include/CGAL/Env_tracing_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Manhattan_distance_iso_box_point.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_traits_with_normals_3.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_storages.h
Examining data/cgal-5.1.1/include/CGAL/Circular_arc_point_3.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_for_generalized_map.h
Examining data/cgal-5.1.1/include/CGAL/Simple_cartesian.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesh_criteria_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_observer.h
Examining data/cgal-5.1.1/include/CGAL/Labeled_image_mesh_domain_3.h
Examining data/cgal-5.1.1/include/CGAL/FPU_extension.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_items_3.h
Examining data/cgal-5.1.1/include/CGAL/Tree_traits.h
Examining data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_regular_triangulation_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/wlop_simplify_and_regularize_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_storage_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/link_to_face_graph.h
Examining data/cgal-5.1.1/include/CGAL/constructions_d.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_traits_adapter.h
Examining data/cgal-5.1.1/include/CGAL/is_convertible.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_circulators_2.h
Examining data/cgal-5.1.1/include/CGAL/export/ImageIO.h
Examining data/cgal-5.1.1/include/CGAL/export/Qt.h
Examining data/cgal-5.1.1/include/CGAL/export/helpers.h
Examining data/cgal-5.1.1/include/CGAL/export/CGAL.h
Examining data/cgal-5.1.1/include/CGAL/export/CORE.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/io_signature.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Refine_cells_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/search_for_connected_components_in_labeled_image.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Refine_facets_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/radius_ratio.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Robust_intersection_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Sliver_perturber.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/config.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesher_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/vertex_perturbation.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Profile_counter.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesh_sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Triangle_accessor_primitive.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/sliver_criteria.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/mesh_standard_criteria.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Dump_c3t3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Lloyd_move.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesh_surface_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesh_global_optimizer.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesh_complex_3_in_triangulation_3_base.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Null_perturber_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Slivers_exuder.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/tet_soup_to_c3t3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Implicit_surface_mesher_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Profiling_tools.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Polyline_with_context.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Facet_criteria_visitor_with_balls.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Has_features.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Slivers_exuder_cell_attributes_traits.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Cell_criteria_visitor_with_balls.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Image_to_labeled_function_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Null_exuder_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/min_dihedral_angle.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/utilities.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Triangulation_sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Uniform_sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Is_mesh_domain_field_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Triangulation_helpers.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesher_level_default_implementations.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesh_complex_3_in_triangulation_3_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Null_global_optimizer_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/dihedral_angle_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/polylines_to_protect.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Mesher_level.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/polyhedral_to_labeled_function_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Refine_tets_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Poisson_refine_cells_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Facet_topological_criterion_with_adjacency.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/AABB_filtered_projection_traits.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Lipschitz_sizing_parameters.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Get_curve_index.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Get_facet_patch_id.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Sizing_field_minimum.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Lipschitz_sizing_polyhedron.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/experimental/Lipschitz_sizing_experimental.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Concurrent_mesher_config.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Odt_move.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Sizing_grid.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Worksharing_data_structures.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Facet_on_same_surface_criterion.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/Robust_intersection_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/C3T3_helpers.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/parameters_defaults.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_3/squared_distance_Point_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_profiler.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2/insert_constraints.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2/internal/Triangulation_2_projection_traits_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2/internal/Constraint_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2/internal/Triangulation_2_filtered_projection_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2/internal/Triangulation_line_face_circulator_2.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_middle_base.h
Examining data/cgal-5.1.1/include/CGAL/Exact_rational.h
Examining data/cgal-5.1.1/include/CGAL/Euclidean_distance.h
Examining data/cgal-5.1.1/include/CGAL/Env_default_diagram_1.h
Examining data/cgal-5.1.1/include/CGAL/enable_warnings.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_3_0.h
Examining data/cgal-5.1.1/include/CGAL/Needs_parens_as_product.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_storage_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_on_surface_with_history_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_arc_3.h
Examining data/cgal-5.1.1/include/CGAL/Level_interval.h
Examining data/cgal-5.1.1/include/CGAL/Nef_nary_union_3.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_agg_op_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Bso_internal_functions.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_base_functor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_default_traits.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_traits_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_bfs_join_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_difference_functor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_agg_op_surface_sweep_2.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_agg_op.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Ccb_curve_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Indexed_event.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_bfs_scanner.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_polygon_simplifier.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Curve_with_halfedge.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_insertion_meta_traits.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_intersection_functor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_join_functor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Polygon_2_curve_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_bfs_base_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_merge.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_do_intersect_functor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_default_dcel.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Point_with_vertex.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_bfs_xor_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_sym_diff_functor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_bfs_intersection_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_domain_with_polyline_features_3.h
Examining data/cgal-5.1.1/include/CGAL/gl.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/QP_options.h
Examining data/cgal-5.1.1/include/CGAL/Partition_is_valid_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Box_intersection_d/segment_tree.h
Examining data/cgal-5.1.1/include/CGAL/Box_intersection_d/Box_with_handle_d.h
Examining data/cgal-5.1.1/include/CGAL/Box_intersection_d/Box_with_info_d.h
Examining data/cgal-5.1.1/include/CGAL/Box_intersection_d/Box_d.h
Examining data/cgal-5.1.1/include/CGAL/Box_intersection_d/Box_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/Box_intersection_d/box_limits.h
Examining data/cgal-5.1.1/include/CGAL/license/Scale_space_reconstruction_3.h
Examining data/cgal-5.1.1/include/CGAL/license/TDS_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Optimal_bounding_box.h
Examining data/cgal-5.1.1/include/CGAL/license/Periodic_2_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_segmentation.h
Examining data/cgal-5.1.1/include/CGAL/license/Envelope_2.h
Examining data/cgal-5.1.1/include/CGAL/license/lgpl.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_skeletonization.h
Examining data/cgal-5.1.1/include/CGAL/license/Apollonius_graph_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Nef_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/collision_detection.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/miscellaneous.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/orientation.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/Compute_normal.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/locate.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/corefinement.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/distance.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/detect_features.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/predicate.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/connected_components.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/repair.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/core.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/measure.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h
Examining data/cgal-5.1.1/include/CGAL/license/Advancing_front_surface_reconstruction.h
Examining data/cgal-5.1.1/include/CGAL/license/Polyline_simplification_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Principal_component_analysis.h
Examining data/cgal-5.1.1/include/CGAL/license/Snap_rounding_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_shortest_path.h
Examining data/cgal-5.1.1/include/CGAL/license/Minkowski_sum_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Spatial_searching.h
Examining data/cgal-5.1.1/include/CGAL/license/Jet_fitting_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Triangulation.h
Examining data/cgal-5.1.1/include/CGAL/license/Tetrahedral_remeshing.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygon_mesh_processing.h
Examining data/cgal-5.1.1/include/CGAL/license/Alpha_shapes_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Classification.h
Examining data/cgal-5.1.1/include/CGAL/license/Stream_lines_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Set_movable_separability_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Polytope_distance_d.h
Examining data/cgal-5.1.1/include/CGAL/license/Convex_hull_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Point_set_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Convex_hull_d.h
Examining data/cgal-5.1.1/include/CGAL/license/Box_intersection_d.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_topology.h
Examining data/cgal-5.1.1/include/CGAL/license/Alpha_shapes_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Visibility_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Envelope_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Mesh_2.h
Examining data/cgal-5.1.1/include/CGAL/license/GraphicsView.h
Examining data/cgal-5.1.1/include/CGAL/license/Circular_kernel_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/license/TDS_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Convex_decomposition_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Arrangement_on_surface_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Matrix_search.h
Examining data/cgal-5.1.1/include/CGAL/license/Minkowski_sum_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Bounding_volumes.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_parameterization.h
Examining data/cgal-5.1.1/include/CGAL/license/Voronoi_diagram_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Polygonal_surface_reconstruction.h
Examining data/cgal-5.1.1/include/CGAL/license/SearchStructures.h
Examining data/cgal-5.1.1/include/CGAL/license/Nef_S2.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_approximation.h
Examining data/cgal-5.1.1/include/CGAL/license/Ridges_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Cone_spanners_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Skin_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_sweep_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Point_set_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Shape_detection.h
Examining data/cgal-5.1.1/include/CGAL/license/Hyperbolic_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Polyhedron.h
Examining data/cgal-5.1.1/include/CGAL/license/Partition_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/license/Point_set_processing_3.h
Examining data/cgal-5.1.1/include/CGAL/license/QP_solver.h
Examining data/cgal-5.1.1/include/CGAL/license/Straight_skeleton_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Circular_kernel_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_deformation.h
Examining data/cgal-5.1.1/include/CGAL/license/Periodic_4_hyperbolic_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Interval_skip_list.h
Examining data/cgal-5.1.1/include/CGAL/license/Interpolation.h
Examining data/cgal-5.1.1/include/CGAL/license/Boolean_set_operations_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Inscribed_areas.h
Examining data/cgal-5.1.1/include/CGAL/license/Barycentric_coordinates_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Poisson_surface_reconstruction_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Periodic_3_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesh_simplification.h
Examining data/cgal-5.1.1/include/CGAL/license/Segment_Delaunay_graph_Linf_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Optimal_transportation_reconstruction_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Three.h
Examining data/cgal-5.1.1/include/CGAL/license/Segment_Delaunay_graph_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Nef_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Convex_hull_2.h
Examining data/cgal-5.1.1/include/CGAL/license/Heat_method_3.h
Examining data/cgal-5.1.1/include/CGAL/license/Periodic_3_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/license/AABB_tree.h
Examining data/cgal-5.1.1/include/CGAL/license/Surface_mesher.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/pnm.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/bmptypes.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/bmpread.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/inr.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/bmpread_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/reech4x4.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/analyze.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/typedefs.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/gif_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/gis.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/bmp_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/recline.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/gif.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/reech4x4_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/fgetns_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/recbuffer.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/recbuffer_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/convert.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/iris_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/mincio.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/recline_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/bmp.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/iris.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO/fgetns.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesh_size_criteria_2.h
Examining data/cgal-5.1.1/include/CGAL/Hidden_point_memory_policy.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/ch_bykat.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_halfedge_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Min_ellipse_2_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/K_neighbor_search.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Circulator_identity.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_vertex.h
Examining data/cgal-5.1.1/include/CGAL/bilateral_smooth_point_set.h
Examining data/cgal-5.1.1/include/CGAL/QP_functions.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/edge_aware_upsample_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Arr_batched_point_location.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/Circulator_project.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Is_a_predicate.h
Examining data/cgal-5.1.1/include/CGAL/Bbox_2.h
Examining data/cgal-5.1.1/include/CGAL/Default.h
Examining data/cgal-5.1.1/include/CGAL/Default_diagonalize_traits.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection_3.h
Examining data/cgal-5.1.1/include/CGAL/Incremental_neighbor_search.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_halfedge_min_base.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation_d_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Unique_hash_map.h
Examining data/cgal-5.1.1/include/CGAL/Extended_cartesian.h
Examining data/cgal-5.1.1/include/CGAL/Exact_predicates_exact_constructions_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Referenced_argument.h
Examining data/cgal-5.1.1/include/CGAL/user_classes.h
Examining data/cgal-5.1.1/include/CGAL/number_utils_classes.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesher_2.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Constrained_triang_traits.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Polynomial_impl.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_checker.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_persistent_PL.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/iterator_tools.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Segment_overlay_traits.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/geninfo.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Object_handle.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_overlayer.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_explorer.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/gen_point_location.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Line_to_epoint.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_io_parser.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Bounding_box_2.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Polynomial.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/PM_const_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/HDS_items.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/debug.h
Examining data/cgal-5.1.1/include/CGAL/Nef_2/Object_index.h
Examining data/cgal-5.1.1/include/CGAL/aff_transformation_tags_impl.h
Examining data/cgal-5.1.1/include/CGAL/hierarchy_simplify_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_with_holes_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersection_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbola_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Curve_pair.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Do_interior_intersect_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_default_overlay_traits_base.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_overlay_event.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_construction_subcurve.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Default_subcurve.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_insertion_ss_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/No_overlap_event.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_no_intersection_insertion_ss_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Curve_comparer.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Subcurves_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Event_comparer.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_construction_event_base.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Default_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_overlay_subcurve.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Surface_sweep_2_utils.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Default_visitor_base.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Intersection_points_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/No_overlap_subcurve.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Default_event_base.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/No_overlap_event_base.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_construction_ss_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Surface_sweep_2_debug.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Default_event.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_batched_pl_ss_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/Arr_construction_event.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2/No_intersection_surface_sweep_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_incremental_builder_3.h
Examining data/cgal-5.1.1/include/CGAL/Handle_for.h
Examining data/cgal-5.1.1/include/CGAL/Construct_yao_graph_2.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_points_d_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_on_sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Dynamic_property_map.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_processing_3/internal/Callback_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_processing_3/internal/Neighbor_query.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_processing_3/internal/bbox_diagonal.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_processing_3/internal/Search_traits_vertex_handle_3.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_processing_3/internal/Rich_grid.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_processing_3/internal/Voronoi_covariance_3/voronoi_covariance_3.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_processing_3/internal/Voronoi_covariance_3/voronoi_covariance_sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Mixed_integer_program_traits.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulated_mixed_complex_observer_3.h
Examining data/cgal-5.1.1/include/CGAL/optimize_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/tetrahedral_remeshing_io.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/Sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/Uniform_sizing_field.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/FMLS.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/smooth_vertices.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h
Examining data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/compute_c3t3_statistics.h
Examining data/cgal-5.1.1/include/CGAL/halfedgeDS_cut_component.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
Examining data/cgal-5.1.1/include/CGAL/Side_of_bounded_square_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_adaptation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Compute_cone_boundaries_2.h
Examining data/cgal-5.1.1/include/CGAL/Interpolation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/version.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbolic_octagon_translation.h
Examining data/cgal-5.1.1/include/CGAL/Triangular_expansion_visibility_2.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_min_items.h
Examining data/cgal-5.1.1/include/CGAL/Exact_integer.h
Examining data/cgal-5.1.1/include/CGAL/predicates_on_points_2.h
Examining data/cgal-5.1.1/include/CGAL/Handle.h
Examining data/cgal-5.1.1/include/CGAL/Exact_circular_kernel_2.h
Examining data/cgal-5.1.1/include/CGAL/mutex.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_halfedge_base.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2_projection_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Unfiltered_predicate_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/Cell_attribute_with_point.h
Examining data/cgal-5.1.1/include/CGAL/Nef_polyhedron_S2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_extension_traits.h
Examining data/cgal-5.1.1/include/CGAL/Rational_traits.h
Examining data/cgal-5.1.1/include/CGAL/Simple_spherical_kernel_3.h
Examining data/cgal-5.1.1/include/CGAL/Spatial_lock_grid_3.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_offset_3.h
Examining data/cgal-5.1.1/include/CGAL/value_type_traits.h
Examining data/cgal-5.1.1/include/CGAL/Regularization/regularize_planes.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Rational_function_ordered_pair.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Rational_function.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Rational_function_pair.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Singleton.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Cache.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Rational_function_canonicalized_pair.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rat_arc/Algebraic_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Fuzzy_iso_box.h
Examining data/cgal-5.1.1/include/CGAL/Ridges.h
Examining data/cgal-5.1.1/include/CGAL/result_of.h
Examining data/cgal-5.1.1/include/CGAL/kernel_to_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Gmpfr.h
Examining data/cgal-5.1.1/include/CGAL/Fixed_alpha_shape_3.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_rs_gmpz_d_1.h
Examining data/cgal-5.1.1/include/CGAL/Modular_traits.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/halfedgeds_connected_components.h
Examining data/cgal-5.1.1/include/CGAL/Dart_const_iterators.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_2.h
Examining data/cgal-5.1.1/include/CGAL/draw_periodic_2_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation.h
Examining data/cgal-5.1.1/include/CGAL/Static_filtered_predicate.h
Examining data/cgal-5.1.1/include/CGAL/Nef_nary_intersection_3.h
Examining data/cgal-5.1.1/include/CGAL/draw_face_graph_with_paths.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_3/IO.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_vertex_index_map.h
Examining data/cgal-5.1.1/include/CGAL/convex_decomposition_3.h
Examining data/cgal-5.1.1/include/CGAL/long_double.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_d_to_polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Generalized_map_operations.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_min_items_3.h
Examining data/cgal-5.1.1/include/CGAL/intersection_2.h
Examining data/cgal-5.1.1/include/CGAL/Interval_arithmetic_impl.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Access_dimension_2.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/basic.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Construct_point_d.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/assertions.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Access_dimension_3.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Construct_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Access_dimension_d.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Access_coordinates_begin_3.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Access_coordinates_begin_2.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Construct_point_3.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/Access_coordinates_begin_d.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation/debug.h
Examining data/cgal-5.1.1/include/CGAL/TDS_full_cell_mirror_storage_policy.h
Examining data/cgal-5.1.1/include/CGAL/extended_euclidean_algorithm.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/refine_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Robust_circumcenter_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_vertex_min_base.h
Examining data/cgal-5.1.1/include/CGAL/Multiset.h
Examining data/cgal-5.1.1/include/CGAL/kernel_basic.h
Examining data/cgal-5.1.1/include/CGAL/Min_ellipse_2.h
Examining data/cgal-5.1.1/include/CGAL/Kd_tree.h
Examining data/cgal-5.1.1/include/CGAL/global_functions_on_roots_and_polynomials_1_3.h
Examining data/cgal-5.1.1/include/CGAL/Random_polygon_2_sweep.h
Examining data/cgal-5.1.1/include/CGAL/Implicit_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/draw_polyhedron.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2/Triangle_coordinates_2.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2/Generalized_barycentric_coordinates_2.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2/barycentric_enum_2.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2/Segment_coordinates_2.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_functors.h
Examining data/cgal-5.1.1/include/CGAL/Point_with_surface_index.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Arr_plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Conic_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Bezier_cache.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Bezier_curve_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Bezier_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Polycurve_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Circle_segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Segment_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/One_root_number.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Curve_data_aux.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Conic_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/de_Casteljau_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/IO/Polycurve_2_iostream.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Consolidated_curve_data_aux.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Conic_intersections_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Rational_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Polyline_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_face_base_with_id_2.h
Examining data/cgal-5.1.1/include/CGAL/Random_convex_hull_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesh_local_size_criteria_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_bounded_planar_topology_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Gmp_coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/Side_of_oriented_square_2.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Spherical_kernel_type_equality_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedral_mesh_domain_3.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_triangulation_adaptation_policies_2.h
Examining data/cgal-5.1.1/include/CGAL/ch_melkman.h
Examining data/cgal-5.1.1/include/CGAL/natural_neighbor_coordinates_3.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial_type_generator.h
Examining data/cgal-5.1.1/include/CGAL/OpenGR/compute_registration_transformation.h
Examining data/cgal-5.1.1/include/CGAL/OpenGR/register_point_sets.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_d_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_on_surface_2.h
Examining data/cgal-5.1.1/include/CGAL/Kd_tree_node.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/assertions_behaviour.h
Examining data/cgal-5.1.1/include/CGAL/Polytope_distance_d_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/Rotational_sweep_visibility_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_face_2.h
Examining data/cgal-5.1.1/include/CGAL/subdivision_method_3.h
Examining data/cgal-5.1.1/include/CGAL/Quotient_fwd.h
Examining data/cgal-5.1.1/include/CGAL/algorithm.h
Examining data/cgal-5.1.1/include/CGAL/tetrahedral_remeshing.h
Examining data/cgal-5.1.1/include/CGAL/array.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_2.h
Examining data/cgal-5.1.1/include/CGAL/poisson_refine_triangulation.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_3.h
Examining data/cgal-5.1.1/include/CGAL/leda_rational.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_set_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_triangulation_point_location.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_builder_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_data_structure_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/AABB_segment_2_primitive.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Hole_filter_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Union_of_segment_cycles_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Labels.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Polygon_convex_decomposition.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Minkowski_sum_by_reduced_convolution_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Union_of_curve_cycles_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Offset_conv_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/AABB_collision_detector_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/AABB_node_with_join.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Offset_decomp_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Minkowski_sum_decomp_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Approx_offset_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/AABB_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Decomposition_strategy_adapter.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Union_of_cycles_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Minkowski_sum_conv_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/AABB_traversal_traits_with_join.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_2/Exact_offset_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_offset_builder_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_face.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_base.h
Examining data/cgal-5.1.1/include/CGAL/Skiplist.h
Examining data/cgal-5.1.1/include/CGAL/Arr_extended_dcel.h
Examining data/cgal-5.1.1/include/CGAL/Orthogonal_incremental_neighbor_search.h
Examining data/cgal-5.1.1/include/CGAL/Timer_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_polyline_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_vertex_map.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_kernel_d.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_default.h
Examining data/cgal-5.1.1/include/CGAL/Nested_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Random.h
Examining data/cgal-5.1.1/include/CGAL/Null_matrix.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_for_combinatorial_map.h
Examining data/cgal-5.1.1/include/CGAL/Poisson_implicit_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersection_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_Delaunay_triangulation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_face_index_map.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/QP_solution.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_mesh_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/pierce_rectangles_2.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_ds_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/graph_traits_Arrangement_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/get_equation_object_on_curved_kernel_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_circle_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_function_compare_to_right_spherical_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_line_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/Circular_arc_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_point_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_function_has_on_spherical_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_function_compare_spherical_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/interface_macros.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_line_arc_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/Line_arc_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/Intersection_traits.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/partition_is_valid_2.h
Examining data/cgal-5.1.1/include/CGAL/Root_of_traits_specializations.h
Examining data/cgal-5.1.1/include/CGAL/Advancing_front_surface_reconstruction_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Rigid_triangle_mesh_collision_detection.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian_converter.h
Examining data/cgal-5.1.1/include/CGAL/make_piecewise_smooth_surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_d.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_with_history_2.h
Examining data/cgal-5.1.1/include/CGAL/atomic.h
Examining data/cgal-5.1.1/include/CGAL/Lazy.h
Examining data/cgal-5.1.1/include/CGAL/ipower.h
Examining data/cgal-5.1.1/include/CGAL/Flattening_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/graph_traits_dual.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_2_iterators.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_on_surface_with_history_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_compute_zone_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/arrangement_type_traits.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_default_planar_topology.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_with_history_accessor.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_do_intersect_zone_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_triangulation_decomposition_2.h
Examining data/cgal-5.1.1/include/CGAL/auto_link/ImageIO.h
Examining data/cgal-5.1.1/include/CGAL/auto_link/Qt.h
Examining data/cgal-5.1.1/include/CGAL/auto_link/CGAL.h
Examining data/cgal-5.1.1/include/CGAL/auto_link/auto_link.h
Examining data/cgal-5.1.1/include/CGAL/auto_link/CORE.h
Examining data/cgal-5.1.1/include/CGAL/MP_Float_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Arr_default_overlay_traits.h
Examining data/cgal-5.1.1/include/CGAL/Union_find.h
Examining data/cgal-5.1.1/include/CGAL/Location_policy.h
Examining data/cgal-5.1.1/include/CGAL/hash_openmesh.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_min_items.h
Examining data/cgal-5.1.1/include/CGAL/Advancing_front_surface_reconstruction_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_predicate_with_state.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Mesh_feature_generator.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Sum_of_weighted_features_classifier.h
Examining data/cgal-5.1.1/include/CGAL/Classification/TensorFlow/Neural_network_classifier.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Evaluation.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Cluster_vertical_extent.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Vertical_range.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Cluster_variance_of_feature.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Gradient_of_feature.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Distance_to_plane.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Cluster_mean_of_feature.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Verticality.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Echo_scatter.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Cluster_size.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Color_channel.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Height_above.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Eigenvalue.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Elevation.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Vertical_dispersion.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Simple_feature.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature/Height_below.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Image.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature_set.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Point_set_neighborhood.h
Examining data/cgal-5.1.1/include/CGAL/Classification/compressed_float.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Point_set_feature_generator.h
Examining data/cgal-5.1.1/include/CGAL/Classification/OpenCV/Random_forest_classifier.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Cluster.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Local_eigen_analysis.h
Examining data/cgal-5.1.1/include/CGAL/Classification/internal/verbosity.h
Examining data/cgal-5.1.1/include/CGAL/Classification/ETHZ/Random_forest_classifier.h
Examining data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
Examining data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/tree.hpp
Examining data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/node.hpp
Examining data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/forest.hpp
Examining data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/node-gini.hpp
Examining data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/dataview.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Planimetric_grid.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Mesh_neighborhood.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Label.h
Examining data/cgal-5.1.1/include/CGAL/Classification/classify.h
Examining data/cgal-5.1.1/include/CGAL/Classification/property_maps.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Label_set.h
Examining data/cgal-5.1.1/include/CGAL/Classification/Feature_base.h
Examining data/cgal-5.1.1/include/CGAL/Weighted_point_2.h
Examining data/cgal-5.1.1/include/CGAL/segment_intersection_points_2.h
Examining data/cgal-5.1.1/include/CGAL/Gmpfi.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_default_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_3.h
Examining data/cgal-5.1.1/include/CGAL/certified_numeric_predicates.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/distance_predicatesH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/basic_constructionsH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/SphereH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Homogeneous_base.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/CircleH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/predicates_on_pointsH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/RayH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Iso_cuboidH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/VectorH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/VectorH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/predicates_on_directionsH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Aff_transformationH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Data_accessorH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/distance_predicatesH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Weighted_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Iso_rectangleH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/basic_constructionsH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/PlaneH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Weighted_point_3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/DirectionH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/PointH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/PointH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/function_objects.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/ConicHPA2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/DirectionH3.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/predicates_on_pointsH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/Aff_transformationH2.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous/LineH2.h
Examining data/cgal-5.1.1/include/CGAL/AABB_triangulation_3_triangle_primitive.h
Examining data/cgal-5.1.1/include/CGAL/Implicit_mesh_domain_3.h
Examining data/cgal-5.1.1/include/CGAL/multiset_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Epick_d.h
Examining data/cgal-5.1.1/include/CGAL/Real_timer.h
Examining data/cgal-5.1.1/include/CGAL/Exact_algebraic.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Weighted_point.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Ray.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Line.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Sphere.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Hyperplane.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Segment.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Iso_box.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Types/Aff_transformation.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_LA_functors.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Dimension_base.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_static_filters.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/store_kernel.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/functor_properties.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_change_FT.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/functor_tags.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/LA_eigen/LA.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/LA_eigen/constructors.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Kernel_object_converter.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Kernel_d_interface.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/utils.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/vector.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_iterator_to_vectors.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/mix.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/v2int.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_vectors_from_vectors.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/determinant_of_points_from_vectors.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/determinant_of_vectors_small_dim_internal.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_points.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/array.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/avx4.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/sse2.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Vector/determinant_of_vectors_small_dim.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_filter_NT.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_complete.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/KernelD_converter.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/function_objects_cartesian.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Kernel_2_interface.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Kernel_3_interface.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_filter_K.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Filtered_predicate2.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Coaffine.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_per_dimension.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/static_int.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_LA_base.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Lazy_cartesian.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Cartesian_wrap.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Point_d.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Vector_d.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Weighted_point_d.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Segment_d.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Cartesian_base.h
Examining data/cgal-5.1.1/include/CGAL/NewKernel_d/Define_kernel_types.h
Examining data/cgal-5.1.1/include/CGAL/int.h
Examining data/cgal-5.1.1/include/CGAL/Circulator_on_node.h
Examining data/cgal-5.1.1/include/CGAL/Polynomials_for_line_3.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_utils.h
Examining data/cgal-5.1.1/include/CGAL/random_simplify_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Circle_3.h
Examining data/cgal-5.1.1/include/CGAL/natural_neighbor_coordinates_2.h
Examining data/cgal-5.1.1/include/CGAL/General_polygon_set_2.h
Examining data/cgal-5.1.1/include/CGAL/generic_sweep.h
Examining data/cgal-5.1.1/include/CGAL/Arrangement_2.h
Examining data/cgal-5.1.1/include/CGAL/Line_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/FPU_msvc.h
Examining data/cgal-5.1.1/include/CGAL/Generalized_map_iterators_base.h
Examining data/cgal-5.1.1/include/CGAL/long_long.h
Examining data/cgal-5.1.1/include/CGAL/iterator_from_indices.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2.h
Examining data/cgal-5.1.1/include/CGAL/draw_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/functions_on_enums.h
Examining data/cgal-5.1.1/include/CGAL/refine_periodic_3_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/CORE_Expr.h
Examining data/cgal-5.1.1/include/CGAL/draw_surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Generic_map_min_items.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_cell_base_with_info_3.h
Examining data/cgal-5.1.1/include/CGAL/transforming_iterator.h
Examining data/cgal-5.1.1/include/CGAL/leda_bigfloat_interval.h
Examining data/cgal-5.1.1/include/CGAL/intersections_d.h
Examining data/cgal-5.1.1/include/CGAL/constant.h
Examining data/cgal-5.1.1/include/CGAL/convert_to_bfi.h
Examining data/cgal-5.1.1/include/CGAL/Projection_traits_yz_3.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_median_d.h
Examining data/cgal-5.1.1/include/CGAL/double.h
Examining data/cgal-5.1.1/include/CGAL/stddef.h
Examining data/cgal-5.1.1/include/CGAL/Polygonal_surface_reconstruction.h
Examining data/cgal-5.1.1/include/CGAL/Aff_transformation_2.h
Examining data/cgal-5.1.1/include/CGAL/vtkSurfaceMesherContourFilter.h
Examining data/cgal-5.1.1/include/CGAL/jet_smooth_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_builder_2.h
Examining data/cgal-5.1.1/include/CGAL/odt_optimize_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/AABB_traits.h
Examining data/cgal-5.1.1/include/CGAL/Point_traits.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesh_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Face_graph_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/ch_eddy.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_rs_gmpq_d_1.h
Examining data/cgal-5.1.1/include/CGAL/Generalized_map_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Arr_line_arc_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Constrained_voronoi_diagram_2.h
Examining data/cgal-5.1.1/include/CGAL/compute_average_spacing.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_triangles_2.h
Examining data/cgal-5.1.1/include/CGAL/test_FPU_rounding_mode_impl.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Envelope_overlay_functor.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Envelope_overlay_2.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Envelope_base.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Envelope_pm_dcel.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/set_dividors.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Env_plane_traits_3_functions.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
Examining data/cgal-5.1.1/include/CGAL/Poisson_mesh_cell_criteria_3.h
Examining data/cgal-5.1.1/include/CGAL/Simple_circular_kernel_2.h
Examining data/cgal-5.1.1/include/CGAL/Point_container.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_full_cell.h
Examining data/cgal-5.1.1/include/CGAL/Cone_spanners_2/Plane_scan_tree_impl.h
Examining data/cgal-5.1.1/include/CGAL/Cone_spanners_2/Plane_scan_tree.h
Examining data/cgal-5.1.1/include/CGAL/Cone_spanners_2/Less_by_direction_2.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_iterator_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/Extreme_points_traits_adapter_3.h
Examining data/cgal-5.1.1/include/CGAL/GLPK_mixed_integer_program_traits.h
Examining data/cgal-5.1.1/include/CGAL/draw_polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/surface_neighbors_3.h
Examining data/cgal-5.1.1/include/CGAL/Interval_arithmetic.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_filtered_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Iterator_range.h
Examining data/cgal-5.1.1/include/CGAL/regular_neighbor_coordinates_2.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_3/PointMark.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_3/Gaussian_map.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_3/Gaussian_map_to_nef_3.h
Examining data/cgal-5.1.1/include/CGAL/Minkowski_sum_3/bipartite_nary_union_sorted_combined.h
Examining data/cgal-5.1.1/include/CGAL/Generalized_map_storages.h
Examining data/cgal-5.1.1/include/CGAL/General_polygon_set_on_surface_2.h
Examining data/cgal-5.1.1/include/CGAL/random_convex_set_2.h
Examining data/cgal-5.1.1/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
Examining data/cgal-5.1.1/include/CGAL/Heat_method_3/internal/V2V.h
Examining data/cgal-5.1.1/include/CGAL/Heat_method_3/internal/Intrinsic_Delaunay_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Gray_image_mesh_domain_3.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation_d_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/glu.h
Examining data/cgal-5.1.1/include/CGAL/Circular_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_counting_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Complex_2_in_triangulation_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/General_polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/range_search_delaunay_2.h
Examining data/cgal-5.1.1/include/CGAL/LEDA_basic.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/functions_on_signs.h
Examining data/cgal-5.1.1/include/CGAL/leda_real.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_spheres_3.h
Examining data/cgal-5.1.1/include/CGAL/AABB_polyhedral_oracle.h
Examining data/cgal-5.1.1/include/CGAL/Counting_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_mesh_area_criteria_2.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_save_load.h
Examining data/cgal-5.1.1/include/CGAL/IO/Verbose_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/binary_file_io.h
Examining data/cgal-5.1.1/include/CGAL/IO/traits_multilinestring.h
Examining data/cgal-5.1.1/include/CGAL/IO/write_3mf.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_header_OFF_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_inventor.h
Examining data/cgal-5.1.1/include/CGAL/IO/read_off_points.h
Examining data/cgal-5.1.1/include/CGAL/IO/traits_multipoint.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_VRML_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/io.h
Examining data/cgal-5.1.1/include/CGAL/IO/Ostream_iterator.h
Examining data/cgal-5.1.1/include/CGAL/IO/PLY.h
Examining data/cgal-5.1.1/include/CGAL/IO/read_ply_points.h
Examining data/cgal-5.1.1/include/CGAL/IO/print_wavefront.h
Examining data/cgal-5.1.1/include/CGAL/IO/generic_print_polyhedron.h
Examining data/cgal-5.1.1/include/CGAL/IO/Triangulation_off_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_medit.h
Examining data/cgal-5.1.1/include/CGAL/IO/Triangulation_geomview_ostream_2.h
Examining data/cgal-5.1.1/include/CGAL/IO/Dxf_reader_doubles.h
Examining data/cgal-5.1.1/include/CGAL/IO/Generic_writer.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arrangement_2_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/STL_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/Dxf_stream.h
Examining data/cgal-5.1.1/include/CGAL/IO/read_las_points.h
Examining data/cgal-5.1.1/include/CGAL/IO/output_to_vtu.h
Examining data/cgal-5.1.1/include/CGAL/IO/Nef_polyhedron_2_PS_stream.h
Examining data/cgal-5.1.1/include/CGAL/IO/write_xyz_points.h
Examining data/cgal-5.1.1/include/CGAL/IO/Polyhedron_VRML_2_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arr_with_history_2_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_scanner_OFF_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/write_off_points.h
Examining data/cgal-5.1.1/include/CGAL/IO/Complex_2_in_triangulation_3_polyhedron_builder.h
Examining data/cgal-5.1.1/include/CGAL/IO/Istream_iterator.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_maya.h
Examining data/cgal-5.1.1/include/CGAL/IO/VRML_1_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/print_inventor.h
Examining data/cgal-5.1.1/include/CGAL/IO/Polyhedron_VRML_1_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/Complex_2_in_triangulation_3_to_medit.h
Examining data/cgal-5.1.1/include/CGAL/IO/Polyhedron_iostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_wavefront.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_header_extended_OFF_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/Complex_2_in_triangulation_3_to_vtk.h
Examining data/cgal-5.1.1/include/CGAL/IO/Triangulation_off_ostream_3.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_VRML_2.h
Examining data/cgal-5.1.1/include/CGAL/IO/scan_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/Gps_iostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/Nef_polyhedron_iostream_3.h
Examining data/cgal-5.1.1/include/CGAL/IO/traits_multipolygon.h
Examining data/cgal-5.1.1/include/CGAL/IO/write_vtu.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arrangement_2_writer.h
Examining data/cgal-5.1.1/include/CGAL/IO/Triangulation_ps_stream.h
Examining data/cgal-5.1.1/include/CGAL/IO/print_VRML_2.h
Examining data/cgal-5.1.1/include/CGAL/IO/io_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_wavefront_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/generic_copy_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_poly.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_tetgen.h
Examining data/cgal-5.1.1/include/CGAL/IO/VRML_2_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/Polyhedron_scan_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/Inventor_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_scanner_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/alpha_shape_geomview_ostream_3.h
Examining data/cgal-5.1.1/include/CGAL/IO/traits_linestring.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_header_extended_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/Complex_3_in_triangulation_3_to_vtk.h
Examining data/cgal-5.1.1/include/CGAL/IO/reader_helpers.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arr_text_formatter.h
Examining data/cgal-5.1.1/include/CGAL/IO/Triangulation_geomview_ostream_3.h
Examining data/cgal-5.1.1/include/CGAL/IO/traits_point.h
Examining data/cgal-5.1.1/include/CGAL/IO/io_tags.h
Examining data/cgal-5.1.1/include/CGAL/IO/print_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/write_vtk.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_inventor_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/Alpha_shape_3_VRML_2_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/facets_in_complex_3_to_triangle_mesh.h
Examining data/cgal-5.1.1/include/CGAL/IO/output_surface_facets_to_triangle_soup.h
Examining data/cgal-5.1.1/include/CGAL/IO/traits_point_3.h
Examining data/cgal-5.1.1/include/CGAL/IO/facets_in_complex_2_to_triangle_mesh.h
Examining data/cgal-5.1.1/include/CGAL/IO/Dxf_writer.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arr_iostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/Polyhedron_builder_from_STL.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_writer_OFF_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arr_with_history_iostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/Complex_2_in_triangulation_3_file_writer.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arr_with_history_2_writer.h
Examining data/cgal-5.1.1/include/CGAL/IO/Writer_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/trace.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_avizo.h
Examining data/cgal-5.1.1/include/CGAL/IO/Arr_with_history_text_formatter.h
Examining data/cgal-5.1.1/include/CGAL/IO/Polyhedron_inventor_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/write_ply_points.h
Examining data/cgal-5.1.1/include/CGAL/IO/OBJ_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h
Examining data/cgal-5.1.1/include/CGAL/IO/traits_polygon.h
Examining data/cgal-5.1.1/include/CGAL/IO/Dxf_bsop_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/OFF_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/STL_writer.h
Examining data/cgal-5.1.1/include/CGAL/IO/Scanner_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/Fig_stream_Conic_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_binary_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/IO/Dxf_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/Geomview_stream.h
Examining data/cgal-5.1.1/include/CGAL/IO/PLY_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/read_3mf.h
Examining data/cgal-5.1.1/include/CGAL/IO/Polyhedron_geomview_ostream.h
Examining data/cgal-5.1.1/include/CGAL/IO/write_las_points.h
Examining data/cgal-5.1.1/include/CGAL/IO/Tee_for_output_iterator.h
Examining data/cgal-5.1.1/include/CGAL/IO/WKT.h
Examining data/cgal-5.1.1/include/CGAL/IO/Dxf_variant_reader.h
Examining data/cgal-5.1.1/include/CGAL/IO/PLY_writer.h
Examining data/cgal-5.1.1/include/CGAL/IO/File_header_OFF.h
Examining data/cgal-5.1.1/include/CGAL/IO/output_surface_facets_to_polyhedron.h
Examining data/cgal-5.1.1/include/CGAL/IO/Color.h
Examining data/cgal-5.1.1/include/CGAL/IO/Triangulation_off_ostream_2.h
Examining data/cgal-5.1.1/include/CGAL/IO/print_VRML_1.h
Examining data/cgal-5.1.1/include/CGAL/IO/read_xyz_points.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_offset_builder_2.h
Examining data/cgal-5.1.1/include/CGAL/streamlines_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_structure_traits.h
Examining data/cgal-5.1.1/include/CGAL/is_streamable.h
Examining data/cgal-5.1.1/include/CGAL/barycenter.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_2_to_lcc.h
Examining data/cgal-5.1.1/include/CGAL/Direction_3.h
Examining data/cgal-5.1.1/include/CGAL/FPU_gcc_i386_sse2.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/Complex_2_in_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_4_hyperbolic_triangulation_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_segments_3.h
Examining data/cgal-5.1.1/include/CGAL/Iso_rectangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_vector.h
Examining data/cgal-5.1.1/include/CGAL/gmpxx_coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/Compact_mesh_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_bgl_min_items.h
Examining data/cgal-5.1.1/include/CGAL/Polynomial.h
Examining data/cgal-5.1.1/include/CGAL/Mpzf.h
Examining data/cgal-5.1.1/include/CGAL/jet_estimate_normals.h
Examining data/cgal-5.1.1/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
Examining data/cgal-5.1.1/include/CGAL/constructions/kernel_ftC3.h
Examining data/cgal-5.1.1/include/CGAL/constructions/kernel_ftC2.h
Examining data/cgal-5.1.1/include/CGAL/constructions/constructions_for_voronoi_intersection_cartesian_2_3.h
Examining data/cgal-5.1.1/include/CGAL/constructions/Polygon_offset_cons_ftC2.h
Examining data/cgal-5.1.1/include/CGAL/simple_transformations_d.h
Examining data/cgal-5.1.1/include/CGAL/Circulator/Circulator_adapters.h
Examining data/cgal-5.1.1/include/CGAL/Circulator/Circulator_concepts.h
Examining data/cgal-5.1.1/include/CGAL/Circulator/Safe_circulator_from_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_function_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/convex_hull_3_to_face_graph.h
Examining data/cgal-5.1.1/include/CGAL/Iterator_project.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_traits.h
Examining data/cgal-5.1.1/include/CGAL/Point_set_3.h
Examining data/cgal-5.1.1/include/CGAL/approximated_offset_2.h
Examining data/cgal-5.1.1/include/CGAL/generators.h
Examining data/cgal-5.1.1/include/CGAL/typeset.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_utils_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_curve_data_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_3.h
Examining data/cgal-5.1.1/include/CGAL/Has_member.h
Examining data/cgal-5.1.1/include/CGAL/Largest_empty_iso_rectangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Linear_algebraCd.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection.h
Examining data/cgal-5.1.1/include/CGAL/predicates/predicates_for_voronoi_intersection_cartesian_2_3.h
Examining data/cgal-5.1.1/include/CGAL/predicates/Polygon_offset_pred_ftC2.h
Examining data/cgal-5.1.1/include/CGAL/predicates/kernel_ftC3.h
Examining data/cgal-5.1.1/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h
Examining data/cgal-5.1.1/include/CGAL/predicates/predicates_for_mixed_complex_3.h
Examining data/cgal-5.1.1/include/CGAL/predicates/sign_of_determinant.h
Examining data/cgal-5.1.1/include/CGAL/predicates/kernel_ftC2.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_bbox_circular_kernel_2/interface_macros.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_bbox_circular_kernel_2/bbox_filtered_predicates.h
Examining data/cgal-5.1.1/include/CGAL/minkowski_sum_3.h
Examining data/cgal-5.1.1/include/CGAL/graph_traits_dual_arrangement_2.h
Examining data/cgal-5.1.1/include/CGAL/Constrained_triangulation_plus_2.h
Examining data/cgal-5.1.1/include/CGAL/compute_outer_frame_margin.h
Examining data/cgal-5.1.1/include/CGAL/Random_convex_set_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Marching_tetrahedra_observer_default_3.h
Examining data/cgal-5.1.1/include/CGAL/Variational_shape_approximation.h
Examining data/cgal-5.1.1/include/CGAL/estimate_scale.h
Examining data/cgal-5.1.1/include/CGAL/Sixtuple.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_policy_tags.h
Examining data/cgal-5.1.1/include/CGAL/Min_circle_2_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_d.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/io.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Wang_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Sqrt_extension_type.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Chinese_remainder_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Scalar_factor_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Algebraic_extension_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Modular_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Eigen_NumTraits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/convert_to_bfi.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Real_embeddable_traits.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Get_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Sqrt_extension/Fraction_traits.h
Examining data/cgal-5.1.1/include/CGAL/Curves_on_surface_topology.h
Examining data/cgal-5.1.1/include/CGAL/pca_estimate_normals.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous_d.h
Examining data/cgal-5.1.1/include/CGAL/Exact_predicates_inexact_constructions_kernel.h
Examining data/cgal-5.1.1/include/CGAL/leda_integer.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_kernel_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Reconstruction_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Number_type_checker.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_triangulation_generator_3.h
Examining data/cgal-5.1.1/include/CGAL/Epeck_d.h
Examining data/cgal-5.1.1/include/CGAL/random_selection.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_annulus_d_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_adaptation_policies_2.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbola_segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Translation_rep_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/ft_constructions_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/ft_constructions_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Translation_rep_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Scaling_rep_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/line_constructions_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/point_constructions_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/MatrixC33.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Line_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/predicates_on_directions_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Line_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Circle_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Point_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/predicates_on_points_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/predicates_on_planes_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/plane_constructions_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Weighted_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Circle_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Aff_transformation_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Direction_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Iso_rectangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/solve_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Data_accessor_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Aff_transformation_rep_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Aff_transformation_rep_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Scaling_rep_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Weighted_point_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/basic_constructions_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Reflection_rep_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/point_constructions_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Aff_transformation_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Vector_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/function_objects.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/basic_constructions_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Point_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Rotation_rep_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Cartesian_base.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Direction_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Vector_2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/ConicCPA2.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/Iso_cuboid_3.h
Examining data/cgal-5.1.1/include/CGAL/Cartesian/predicates_on_points_3.h
Examining data/cgal-5.1.1/include/CGAL/mesh_skin_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/assertions_impl.h
Examining data/cgal-5.1.1/include/CGAL/Extended_homogeneous.h
Examining data/cgal-5.1.1/include/CGAL/Memory_sizer.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_approximation/L2_metric_plane_proxy.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_approximation/approximate_triangle_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_approximation/L21_metric_plane_proxy.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_checker.h
Examining data/cgal-5.1.1/include/CGAL/CGAL_Ipelet_base_v6.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_2_algorithms.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_intersections.h
Examining data/cgal-5.1.1/include/CGAL/Nef_polynomial_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_polygon_mesh/Least_squares_plane_fit_sorting.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_polygon_mesh/One_ring_neighbor_query.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_polygon_mesh/Least_squares_plane_fit_region.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/internal/utils.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/internal/property_map.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_point_set/Least_squares_line_fit_region.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_point_set/Sphere_neighbor_query.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_point_set/Least_squares_plane_fit_sorting.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_point_set/K_neighbor_query.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_point_set/Least_squares_plane_fit_region.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_point_set/Least_squares_line_fit_sorting.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing/Region_growing_on_polygon_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Region_growing.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/deprecated/Region_growing.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/deprecated/Shape_detection_traits.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Torus.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Shape_base.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Sphere.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Cone.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC_traits.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Plane.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Octree.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/Cylinder.h
Examining data/cgal-5.1.1/include/CGAL/Shape_detection/Efficient_RANSAC/property_map.h
Examining data/cgal-5.1.1/include/CGAL/disable_warnings.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_mesh_slicer.h
Examining data/cgal-5.1.1/include/CGAL/graph_traits_dual_arrangement_on_surface_with_history_2.h
Examining data/cgal-5.1.1/include/CGAL/Gps_circle_segment_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_traits_fwd.h
Examining data/cgal-5.1.1/include/CGAL/hilbert_sort_on_sphere.h
Examining data/cgal-5.1.1/include/CGAL/determinant_of_vectors.h
Examining data/cgal-5.1.1/include/CGAL/polynomial_utils.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_3_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_3/dual/Convex_hull_traits_dual_3.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_3/dual/predicates.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_3/dual/Convex_hull_traits_dual_2.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_3/dual/interior_polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Discrete_authalic_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Error_code.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Circular_border_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Discrete_conformal_map_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Barycentric_mapping_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Mean_value_coordinates_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/orbifold_shortest_path.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/IO/File_off.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/internal/orbifold_cone_helper.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/internal/Bool_property_map.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/internal/kernel_traits.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/internal/validity.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/internal/Containers_filler.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/internal/angles.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Two_vertices_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/orbifold_enums.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/parameterize.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_full_cell.h
Examining data/cgal-5.1.1/include/CGAL/Weighted_Minkowski_distance.h
Examining data/cgal-5.1.1/include/CGAL/Interval_nt.h
Examining data/cgal-5.1.1/include/CGAL/utility.h
Examining data/cgal-5.1.1/include/CGAL/Cache.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Verbose_flag.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Implicit_surface_oracle_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Polyhedral_oracle.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Surface_mesher_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Has_edges.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Combining_oracle.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Profile_counter.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Surface_mesher_manifold.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Intersection_data_structure_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Null_oracle_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Surface_mesher_regular_edges.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Poisson_implicit_surface_oracle_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Surface_mesher_edges_level_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Standard_criteria.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Vertices_on_the_same_psc_element_criterion.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Types_generators.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Surface_mesher_edges_level.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Point_surface_indices_oracle_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Sphere_oracle_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Vertices_on_the_same_surface_criterion.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Profile_timer.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesher/Surface_mesher.h
Examining data/cgal-5.1.1/include/CGAL/type_traits.h
Examining data/cgal-5.1.1/include/CGAL/internal/boost/array_binary_tree.hpp
Examining data/cgal-5.1.1/include/CGAL/internal/boost/mutable_queue.hpp
Examining data/cgal-5.1.1/include/CGAL/internal/boost/mutable_heap.hpp
Examining data/cgal-5.1.1/include/CGAL/internal/Functor_with_offset_weighted_points_adaptor_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Has_nested_type_Bare_point.h
Examining data/cgal-5.1.1/include/CGAL/internal/Has_boolean_tags.h
Examining data/cgal-5.1.1/include/CGAL/internal/Delaunay_triangulation_hierarchy_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Functor_with_offset_points_adaptor_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_triangulation_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Triangulation_ds_iterators_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_2_Delaunay_triangulation_filtered_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Is_degenerate_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Compare_y_at_x_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Periodic_3_side_of_oriented_sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Compare_y_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Coplanar_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Equal_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Collinear_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Coplanar_orientation_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Do_intersect_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Compare_squared_radius_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Side_of_oriented_circle_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Coplanar_side_of_bounded_circle_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Do_intersect_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Periodic_3_orientation_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Periodic_2_orientation_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/tools.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Orientation_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Compare_weighted_squared_radius_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Equal_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Static_filter_error.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Orientation_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Angle_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Compare_x_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Side_of_oriented_sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Periodic_2_side_of_oriented_circle_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_filters/Static_filters.h
Examining data/cgal-5.1.1/include/CGAL/internal/Combinatorial_map_utility.h
Examining data/cgal-5.1.1/include/CGAL/internal/Hyperbolic_octagon_translation_word.h
Examining data/cgal-5.1.1/include/CGAL/internal/Static_or_dynamic_array.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_construct_point_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Hyperbolic_Delaunay_triangulation_traits_2_functions.h
Examining data/cgal-5.1.1/include/CGAL/internal/Generalized_map_internal_functors.h
Examining data/cgal-5.1.1/include/CGAL/internal/Dehn_hyperbolic_octagon_translation_word.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_triangulation_iterators_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Exact_type_selector.h
Examining data/cgal-5.1.1/include/CGAL/internal/point_set_with_planes.h
Examining data/cgal-5.1.1/include/CGAL/internal/Combination_enumerator.h
Examining data/cgal-5.1.1/include/CGAL/internal/deprecation_warning.h
Examining data/cgal-5.1.1/include/CGAL/internal/hypothesis.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_triangulation_dummy_36.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_regular_triangulation_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Surface_mesh_segmentation.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/AABB_traversal_traits.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/SDF_calculation.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/AABB_traits.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Filters.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Disk_samplers.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Expectation_maximization.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_Delaunay_triangulation_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/auxiliary/graph.h
Examining data/cgal-5.1.1/include/CGAL/internal/Mesh_3/indices_management.h
Examining data/cgal-5.1.1/include/CGAL/internal/Mesh_3/Handle_IO_for_pair_of_int.h
Examining data/cgal-5.1.1/include/CGAL/internal/Mesh_3/get_index.h
Examining data/cgal-5.1.1/include/CGAL/internal/Mesh_3/helpers.h
Examining data/cgal-5.1.1/include/CGAL/internal/Mesh_3/check_weights.h
Examining data/cgal-5.1.1/include/CGAL/internal/Mesh_3/Graph_manipulations.h
Examining data/cgal-5.1.1/include/CGAL/internal/Mesh_3/Boundary_of_subdomain_of_complex_3_in_triangulation_3_to_off.h
Examining data/cgal-5.1.1/include/CGAL/internal/Generalized_map_group_functors.h
Examining data/cgal-5.1.1/include/CGAL/internal/Exact_complex.h
Examining data/cgal-5.1.1/include/CGAL/internal/K_neighbor_search.h
Examining data/cgal-5.1.1/include/CGAL/internal/Generic_random_point_generator.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_deformation/Spokes_and_rims_iterator.h
Examining data/cgal-5.1.1/include/CGAL/internal/AFSR/Surface_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/AFSR/construct_polyhedron.h
Examining data/cgal-5.1.1/include/CGAL/internal/AFSR/Surface_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/AFSR/write_triple_indices.h
Examining data/cgal-5.1.1/include/CGAL/internal/AFSR/orient.h
Examining data/cgal-5.1.1/include/CGAL/internal/AFSR/construct_surface_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Functor_with_offset_points_adaptor_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Combinatorial_map_group_functors.h
Examining data/cgal-5.1.1/include/CGAL/internal/Transform_coordinates_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Projection_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Generalized_map_sewable.h
Examining data/cgal-5.1.1/include/CGAL/internal/alpha_shape_mesh.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_triangulation_statically_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_skeletonization/Detect_degeneracy.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_skeletonization/Curve_skeleton.h
Examining data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_skeletonization/Debug.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_Delaunay_triangulation_statically_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_regular_triangulation_remove_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Lazy_alpha_nt_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_construct_weighted_point_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Has_member_visited.h
Examining data/cgal-5.1.1/include/CGAL/internal/Robust_periodic_weighted_circumcenter_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_regular_triangulation_dummy_288.h
Examining data/cgal-5.1.1/include/CGAL/internal/Triangulation/Triangulation_ds_iterators.h
Examining data/cgal-5.1.1/include/CGAL/internal/Triangulation/Dummy_TDS.h
Examining data/cgal-5.1.1/include/CGAL/internal/Triangulation/utilities.h
Examining data/cgal-5.1.1/include/CGAL/internal/Combinatorial_map_copy_functors.h
Examining data/cgal-5.1.1/include/CGAL/internal/TDS_2/Edge_hash_function.h
Examining data/cgal-5.1.1/include/CGAL/internal/TDS_2/edge_list.h
Examining data/cgal-5.1.1/include/CGAL/internal/Get_dimension_tag.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_2_triangulation_statically_filtered_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_2_Delaunay_triangulation_statically_filtered_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/compute_confidences.h
Examining data/cgal-5.1.1/include/CGAL/internal/canonicalize_helper.h
Examining data/cgal-5.1.1/include/CGAL/internal/Search_helpers.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_triangulation_remove_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_2_triangulation_filtered_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/container_fwd_fixed.hpp
Examining data/cgal-5.1.1/include/CGAL/internal/Classification_type.h
Examining data/cgal-5.1.1/include/CGAL/internal/Lazy_alpha_nt_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Geometry_container.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_4_hyperbolic_triangulation_dummy_14.h
Examining data/cgal-5.1.1/include/CGAL/internal/Dummy_tds_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/parameters.h
Examining data/cgal-5.1.1/include/CGAL/internal/Combinatorial_map_internal_functors.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/AABB_ray_intersection.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/Has_nested_type_Shared_data.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/AABB_node.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/AABB_traversal_traits.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/Is_ray_intersection_geomtraits.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/AABB_drawing_traits.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/Primitive_helper.h
Examining data/cgal-5.1.1/include/CGAL/internal/AABB_tree/AABB_search_tree.h
Examining data/cgal-5.1.1/include/CGAL/internal/Triangulation_ds_circulators_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Combinatorial_map_sewable.h
Examining data/cgal-5.1.1/include/CGAL/internal/enable_third_party_libraries.h
Examining data/cgal-5.1.1/include/CGAL/internal/disable_deprecation_warnings_and_errors.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_Delaunay_triangulation_remove_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_3_regular_triangulation_statically_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/internal/info_check.h
Examining data/cgal-5.1.1/include/CGAL/internal/Periodic_2_construct_point_2.h
Examining data/cgal-5.1.1/include/CGAL/internal/Hyperbolic_octagon_translation_matrix.h
Examining data/cgal-5.1.1/include/CGAL/internal/bounded_priority_queue.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_median_2.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_non_caching_segment_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/more_functions_on_signs.h
Examining data/cgal-5.1.1/include/CGAL/property_map.h
Examining data/cgal-5.1.1/include/CGAL/triangulation_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_vertex_2.h
Examining data/cgal-5.1.1/include/CGAL/partition_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_converter.h
Examining data/cgal-5.1.1/include/CGAL/circulator.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d.h
Examining data/cgal-5.1.1/include/CGAL/Time_stamper.h
Examining data/cgal-5.1.1/include/CGAL/Mesher_level_default_implementations.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/Polygon_offset_builder_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/assertions.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/test.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_events_2.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2/debug.h
Examining data/cgal-5.1.1/include/CGAL/Weighted_point_3.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_euclidean_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Gmpq.h
Examining data/cgal-5.1.1/include/CGAL/Arr_overlay.h
Examining data/cgal-5.1.1/include/CGAL/wmult.h
Examining data/cgal-5.1.1/include/CGAL/Regular_grid_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Iso_rectangle_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Triangle_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Line_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Point_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Circle_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Iso_rectangle_2_Point_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Iso_rectangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Line_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Iso_rectangle_2_Line_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Ray_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Circle_2_Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Point_2_Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Point_2_Point_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Ray_2_Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Point_2_Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Circle_2_Iso_rectangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Segment_2_Triangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Ray_2_Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Iso_rectangle_2_Iso_rectangle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Line_2_Line_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Line_2_Point_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Circle_2_Circle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Iso_rectangle_2_Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Segment_2_Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/internal/Straight_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/internal/Triangle_2_Triangle_2_do_intersect_impl.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/internal/Triangle_2_Triangle_2_intersection_impl.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Line_2_Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Iso_rectangle_2_Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Circle_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Circle_2_Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Line_2_Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Circle_2_Line_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Bbox_2_Point_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_2/Circle_2_Point_2.h
Examining data/cgal-5.1.1/include/CGAL/convex_hull_constructive_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/basic_constructions_2.h
Examining data/cgal-5.1.1/include/CGAL/sibson_gradient_fitting.h
Examining data/cgal-5.1.1/include/CGAL/Exponent_vector.h
Examining data/cgal-5.1.1/include/CGAL/utils_classes.h
Examining data/cgal-5.1.1/include/CGAL/optimal_bounding_box.h
Examining data/cgal-5.1.1/include/CGAL/Gps_segment_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Tree_assertions.h
Examining data/cgal-5.1.1/include/CGAL/triangulate_power_diagram_3.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_d/Optimisation_sphere_d.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_d/Min_sphere_d_impl.h
Examining data/cgal-5.1.1/include/CGAL/Bigfloat_interval_traits.h
Examining data/cgal-5.1.1/include/CGAL/Orientation_Linf_2.h
Examining data/cgal-5.1.1/include/CGAL/remove_far_points_in_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedral_complex_mesh_domain_3.h
Examining data/cgal-5.1.1/include/CGAL/LEDA_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/ch_selected_extreme_points_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_geom_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/tuple.h
Examining data/cgal-5.1.1/include/CGAL/point_generators_3.h
Examining data/cgal-5.1.1/include/CGAL/Constrained_Delaunay_triangulation_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/NT_converter.h
Examining data/cgal-5.1.1/include/CGAL/Triangle_accessor_3.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_support_set.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_pair.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_pivot_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_configure.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_support_set_impl.h
Examining data/cgal-5.1.1/include/CGAL/mpz_class.h
Examining data/cgal-5.1.1/include/CGAL/MP_Float_impl.h
Examining data/cgal-5.1.1/include/CGAL/Construct_theta_graph_2.h
Examining data/cgal-5.1.1/include/CGAL/Convex_hull_projective_xy_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_adaptation_policies_2.h
Examining data/cgal-5.1.1/include/CGAL/AABB_polyhedron_triangle_primitive.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Point_with_surface_index_geom_traits.h
Examining data/cgal-5.1.1/include/CGAL/Image_3.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Snap_rounding_kd_2.h
Examining data/cgal-5.1.1/include/CGAL/mpfr_coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Simple_set_container.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Filtered_queue_container.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Simple_queue_container.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Triangulation_mesher_level_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Double_map_container.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Simple_map_container.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Triangulation_mesher_level_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Filtered_multimap_container.h
Examining data/cgal-5.1.1/include/CGAL/Meshes/Filtered_deque_container.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Optimisation_d_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/monotone_matrix_search.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/SEP_to_ImageIO.h
Examining data/cgal-5.1.1/include/CGAL/periodic_3_triangulation_3_io.h
Examining data/cgal-5.1.1/include/CGAL/Concurrent_compact_container.h
Examining data/cgal-5.1.1/include/CGAL/Root_for_spheres_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Search_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Marching_tetrahedra_traits_skin_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/TDS_full_cell_default_storage_policy.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h
Examining data/cgal-5.1.1/include/CGAL/tags.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_simplex_3.h
Examining data/cgal-5.1.1/include/CGAL/Mesher_level.h
Examining data/cgal-5.1.1/include/CGAL/RS/rs23_k_isolator_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/functors_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/exact_signat_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/dyadic.h
Examining data/cgal-5.1.1/include/CGAL/RS/signat_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/Gmpfr_make_unique.h
Examining data/cgal-5.1.1/include/CGAL/RS/rs3_k_refiner_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/rs2_isolator_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/rs3_refiner_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/polynomial_converter_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/ak_z_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/comparator_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/bisection_refiner_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/ak_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/algebraic_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/functors_z_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/algebraic_z_1.h
Examining data/cgal-5.1.1/include/CGAL/RS/rs2_calls.h
Examining data/cgal-5.1.1/include/CGAL/Search_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/license.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_structural_filtering_traits.h
Examining data/cgal-5.1.1/include/CGAL/in_place_edge_list.h
Examining data/cgal-5.1.1/include/CGAL/Twotuple.h
Examining data/cgal-5.1.1/include/CGAL/CORE/BigInt.h
Examining data/cgal-5.1.1/include/CGAL/CORE/extLong_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Promote.h
Examining data/cgal-5.1.1/include/CGAL/CORE/CoreDefs.h
Examining data/cgal-5.1.1/include/CGAL/CORE/RefCount.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Config.h
Examining data/cgal-5.1.1/include/CGAL/CORE/RealRep.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Expr_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Gmp.h
Examining data/cgal-5.1.1/include/CGAL/CORE/MemoryPool.h
Examining data/cgal-5.1.1/include/CGAL/CORE/CoreAux.h
Examining data/cgal-5.1.1/include/CGAL/CORE/BigFloatRep.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Real_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Gmp_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Real.h
Examining data/cgal-5.1.1/include/CGAL/CORE/extLong.h
Examining data/cgal-5.1.1/include/CGAL/CORE/CoreDefs_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Expr.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Filter.h
Examining data/cgal-5.1.1/include/CGAL/CORE/BigFloat_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/ExprRep.h
Examining data/cgal-5.1.1/include/CGAL/CORE/linearAlgebra.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Timer.h
Examining data/cgal-5.1.1/include/CGAL/CORE/BigRat.h
Examining data/cgal-5.1.1/include/CGAL/CORE/Impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/poly/Poly.h
Examining data/cgal-5.1.1/include/CGAL/CORE/poly/Sturm.h
Examining data/cgal-5.1.1/include/CGAL/CORE/poly/Curves.h
Examining data/cgal-5.1.1/include/CGAL/CORE/CORE.h
Examining data/cgal-5.1.1/include/CGAL/CORE/CoreIO_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/CoreAux_impl.h
Examining data/cgal-5.1.1/include/CGAL/CORE/BigFloat.h
Examining data/cgal-5.1.1/include/CGAL/Lazy_exact_nt.h
Examining data/cgal-5.1.1/include/CGAL/Transform_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Scale_space_reconstruction_3/Advancing_front_mesher.h
Examining data/cgal-5.1.1/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h
Examining data/cgal-5.1.1/include/CGAL/Scale_space_reconstruction_3/internal/Auto_count.h
Examining data/cgal-5.1.1/include/CGAL/Scale_space_reconstruction_3/Shape_construction_3.h
Examining data/cgal-5.1.1/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h
Examining data/cgal-5.1.1/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
Examining data/cgal-5.1.1/include/CGAL/remove_outliers.h
Examining data/cgal-5.1.1/include/CGAL/Aff_transformation_3.h
Examining data/cgal-5.1.1/include/CGAL/Cone_spanners_enum_2.h
Examining data/cgal-5.1.1/include/CGAL/Regular_triangulation_adaptation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d_traits_d.h
Examining data/cgal-5.1.1/include/CGAL/Timer.h
Examining data/cgal-5.1.1/include/CGAL/sse2.h
Examining data/cgal-5.1.1/include/CGAL/intersections.h
Examining data/cgal-5.1.1/include/CGAL/Arr_landmarks_point_location.h
Examining data/cgal-5.1.1/include/CGAL/Arr_default_dcel.h
Examining data/cgal-5.1.1/include/CGAL/ch_function_objects_2.h
Examining data/cgal-5.1.1/include/CGAL/lloyd_optimize_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_Delaunay_triangulation_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/surface_neighbor_coordinates_3.h
Examining data/cgal-5.1.1/include/CGAL/Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Dart_iterators.h
Examining data/cgal-5.1.1/include/CGAL/IEEE_754_unions.h
Examining data/cgal-5.1.1/include/CGAL/Real_embeddable_traits.h
Examining data/cgal-5.1.1/include/CGAL/CORE_coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/Multiscale_sort.h
Examining data/cgal-5.1.1/include/CGAL/Gmpz.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_simple_storage_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Complex_2_in_triangulation_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_2.h
Examining data/cgal-5.1.1/include/CGAL/Vector_3.h
Examining data/cgal-5.1.1/include/CGAL/Small_unordered_map.h
Examining data/cgal-5.1.1/include/CGAL/Line_arc_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_converter.h
Examining data/cgal-5.1.1/include/CGAL/Lazy_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2.h
Examining data/cgal-5.1.1/include/CGAL/function_objects.h
Examining data/cgal-5.1.1/include/CGAL/rectangular_p_center_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Descartes.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_rndl_tree.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/macros.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Interval_evaluate_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/refine_zero_against.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/LRU_hashed_map.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Shear_transformation.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Float_traits.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Interval_evaluate_1.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/shear.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Shear_controller.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_E08_tree.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/univariate_polynomial_utils.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/construct_binary.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Event_line_builder.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_rndl_tree_traits.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Bitstream_descartes.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Algebraic_real_rep.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Real_roots.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Real_embeddable_extension.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Bitstream_coefficient_kernel_at_alpha.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Bitstream_coefficient_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/enums.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Algebraic_real_rep_bfi.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/flags.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Status_line_CPA_1.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/exceptions.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/bound_between_1.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_items_2.h
Examining data/cgal-5.1.1/include/CGAL/Polynomials_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Has_timestamp.h
Examining data/cgal-5.1.1/include/CGAL/Search_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location_result.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_adaptation_policies_2.h
Examining data/cgal-5.1.1/include/CGAL/Ray_2.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/Handle_with_policy.h
Examining data/cgal-5.1.1/include/CGAL/centroid.h
Examining data/cgal-5.1.1/include/CGAL/Partition_traits_adapter_2.h
Examining data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h
Examining data/cgal-5.1.1/include/CGAL/min_max_n.h
Examining data/cgal-5.1.1/include/CGAL/box_intersection_d.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_deformation.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Eigen_solver_traits.h
Examining data/cgal-5.1.1/include/CGAL/Arr_tracing_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Intersection_traits.h
Examining data/cgal-5.1.1/include/CGAL/Polynomials_2_3.h
Examining data/cgal-5.1.1/include/CGAL/point_generators_d.h
Examining data/cgal-5.1.1/include/CGAL/CGAL_Ipelet_base_v7.h
Examining data/cgal-5.1.1/include/CGAL/Alpha_shape_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/sweep_observer.h
Examining data/cgal-5.1.1/include/CGAL/Polynomials_1_3.h
Examining data/cgal-5.1.1/include/CGAL/extract_mean_curvature_flow_skeleton.h
Examining data/cgal-5.1.1/include/CGAL/Arr_rational_function_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_4_hyperbolic_triangulation_2.h
Examining data/cgal-5.1.1/include/CGAL/Vertex2Data_Property_Map_with_std_map.h
Examining data/cgal-5.1.1/include/CGAL/polygon_mesh_processing.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_error_code.h
Examining data/cgal-5.1.1/include/CGAL/ch_akl_toussaint.h
Examining data/cgal-5.1.1/include/CGAL/Arr_algebraic_segment_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Interval_skip_list.h
Examining data/cgal-5.1.1/include/CGAL/Env_sphere_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Nef_polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Kernel_traits.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/internal/Common.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/edge_collapse.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_stop_predicate.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_stop_predicate.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_profile.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_policies.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_core.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/LindstromTurk_params.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_ratio_stop_predicate.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
Examining data/cgal-5.1.1/include/CGAL/create_straight_skeleton_from_polygon_with_holes_2.h
Examining data/cgal-5.1.1/include/CGAL/Boolean_set_operations_2.h
Examining data/cgal-5.1.1/include/CGAL/Root_for_circles_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Double_map.h
Examining data/cgal-5.1.1/include/CGAL/Get_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/point_generators_2.h
Examining data/cgal-5.1.1/include/CGAL/number_utils.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_complex_2_in_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Barycentric_coordinates_2.h
Examining data/cgal-5.1.1/include/CGAL/leda_coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_const_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Arr_trapezoid_ric_point_location.h
Examining data/cgal-5.1.1/include/CGAL/iterator.h
Examining data/cgal-5.1.1/include/CGAL/N_step_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_3_to_lcc.h
Examining data/cgal-5.1.1/include/CGAL/Nef_polyhedron_2.h
Examining data/cgal-5.1.1/include/CGAL/Simple_polygon_visibility_2.h
Examining data/cgal-5.1.1/include/CGAL/global_functions_on_roots_and_polynomials_2_3.h
Examining data/cgal-5.1.1/include/CGAL/Spatial_sort_traits_adapter_3.h
Examining data/cgal-5.1.1/include/CGAL/Straight_skeleton_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/convexity_check_2.h
Examining data/cgal-5.1.1/include/CGAL/Polyhedron_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/make_skin_surface_mesh_3.h
Examining data/cgal-5.1.1/include/CGAL/Hyperbola_ray_2.h
Examining data/cgal-5.1.1/include/CGAL/thread.h
Examining data/cgal-5.1.1/include/CGAL/certified_quotient_predicates.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Apollonius_graph_nearest_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Default_site_inserters.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Unbounded_faces.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Adaptation_traits_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Delaunay_triangulation_nearest_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Iterator_adaptors.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Cached_degeneracy_testers.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Dummy_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/basic.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Policy_base.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Edge_less.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Regular_triangulation_degeneracy_testers.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Delaunay_triangulation_degeneracy_testers.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Vertex.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Connected_components.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Circulator_adaptors.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Halfedge.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Adaptation_traits_functors.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Accessor.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_degeneracy_testers.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Construct_dual_points.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Site_accessors.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Handle_adaptor.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Face.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Identity_rejectors.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Default_site_removers.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Degeneracy_tester_binders.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Validity_testers.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Unbounded_edges.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Regular_triangulation_nearest_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Apollonius_graph_degeneracy_testers.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Finder_classes.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path/barycentric.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path/internal/misc_functions.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path/internal/Cone_tree.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path/internal/Cone_expansion_event.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_shortest_path/function_objects.h
Examining data/cgal-5.1.1/include/CGAL/Plane_separator.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/global_functions_internal_2.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/global_functions_internal_3.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/Type_equality_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/Conic_misc.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/hash_functions.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/solve.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/global_functions_2.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/Return_base_tag.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/global_functions_3.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/mpl.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/Dimension_utils.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/Same_uncertainty.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/interface_macros.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/global_functions.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/function_objects.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/Type_mapper.h
Examining data/cgal-5.1.1/include/CGAL/Kernel/Wutils.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/interpolation_functions.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_points_3.h
Examining data/cgal-5.1.1/include/CGAL/triangulate_mixed_complex_3.h
Examining data/cgal-5.1.1/include/CGAL/Voronoi_intersection_2_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Robust_circumcenter_filtered_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_topology_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Orthogonal_k_neighbor_search.h
Examining data/cgal-5.1.1/include/CGAL/basic_constructions_3.h
Examining data/cgal-5.1.1/include/CGAL/Random_impl.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_min_items.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_d.h
Examining data/cgal-5.1.1/include/CGAL/Regularization.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h
Examining data/cgal-5.1.1/include/CGAL/Small_side_angle_bisector_decomposition_2.h
Examining data/cgal-5.1.1/include/CGAL/known_bit_size_integers.h
Examining data/cgal-5.1.1/include/CGAL/Segment_2.h
Examining data/cgal-5.1.1/include/CGAL/SEP_header.h
Examining data/cgal-5.1.1/include/CGAL/Range_tree_k.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_default_edges_criteria_3.h
Examining data/cgal-5.1.1/include/CGAL/memory.h
Examining data/cgal-5.1.1/include/CGAL/Container_helper.h
Examining data/cgal-5.1.1/include/CGAL/envelope_3.h
Examining data/cgal-5.1.1/include/CGAL/mpfi_coercion_traits.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_filtered_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/CORE_algebraic_number_traits.h
Examining data/cgal-5.1.1/include/CGAL/marching_tetrahedra_3.h
Examining data/cgal-5.1.1/include/CGAL/ImageIO_impl.h
Examining data/cgal-5.1.1/include/CGAL/Envelope_diagram_1.h
Examining data/cgal-5.1.1/include/CGAL/Point_with_normal_3.h
Examining data/cgal-5.1.1/include/CGAL/OpenNL/linear_solver.h
Examining data/cgal-5.1.1/include/CGAL/OpenNL/full_vector.h
Examining data/cgal-5.1.1/include/CGAL/OpenNL/conjugate_gradient.h
Examining data/cgal-5.1.1/include/CGAL/OpenNL/bicgstab.h
Examining data/cgal-5.1.1/include/CGAL/OpenNL/preconditioner.h
Examining data/cgal-5.1.1/include/CGAL/OpenNL/blas.h
Examining data/cgal-5.1.1/include/CGAL/OpenNL/sparse_matrix.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_vertical_decomposition_2.h
Examining data/cgal-5.1.1/include/CGAL/graph_traits_dual_arrangement_on_surface_2.h
Examining data/cgal-5.1.1/include/CGAL/aff_transformation_tags.h
Examining data/cgal-5.1.1/include/CGAL/Homogeneous.h
Examining data/cgal-5.1.1/include/CGAL/QP_models.h
Examining data/cgal-5.1.1/include/CGAL/create_straight_skeleton_2.h
Examining data/cgal-5.1.1/include/CGAL/extremal_polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_annulus_d_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/CORE_BigInt.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_face_base.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/determinant.h
Examining data/cgal-5.1.1/include/CGAL/CORE_BigRat.h
Examining data/cgal-5.1.1/include/CGAL/AABB_primitive.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Runge_kutta_integrator_2.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_marching_tetrahedra_observer_3.h
Examining data/cgal-5.1.1/include/CGAL/exceptions.h
Examining data/cgal-5.1.1/include/CGAL/Skin_surface_quadratic_surface_3.h
Examining data/cgal-5.1.1/include/CGAL/Euclidean_distance_sphere_point.h
Examining data/cgal-5.1.1/include/CGAL/Concatenate_iterator.h
Examining data/cgal-5.1.1/include/CGAL/Point_2.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_constructors.h
Examining data/cgal-5.1.1/include/CGAL/General_polygon_with_holes_2.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_transportation_reconstruction_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_incremental_builder_3.h
Examining data/cgal-5.1.1/include/CGAL/Implicit_to_labeling_function_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_adaptation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_simple_point_location.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_polyhedral_sgm_transformation.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_polyhedral_sgm_overlay.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_polyhedral_sgm_arr_dcel.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_on_sphere_transformation.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_polyhedral_sgm_traits.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_polyhedral_sgm_polyhedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_polyhedral_sgm_initializer_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_transform_on_sphere.h
Examining data/cgal-5.1.1/include/CGAL/Arr_spherical_gaussian_map_3/Arr_polyhedral_sgm.h
Examining data/cgal-5.1.1/include/CGAL/Visibility_2/visibility_utils.h
Examining data/cgal-5.1.1/include/CGAL/Mean_curvature_flow_skeletonization.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d_1.h
Examining data/cgal-5.1.1/include/CGAL/basic_classes.h
Examining data/cgal-5.1.1/include/CGAL/Point_with_psc_localisation.h
Examining data/cgal-5.1.1/include/CGAL/Real_timer_impl.h
Examining data/cgal-5.1.1/include/CGAL/Tree_base.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_iteration.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_list.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_geometry_OGL.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/ID_support_handler.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_geometry.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_decorator_traits.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Generic_handle_map.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_visualizor.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_triangle.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_map.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Normalizing.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_point_locator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_overlayer.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_io_parser.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/leda_sphere_map.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/sphere_predicates.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_constrained_triang_traits.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_segment.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_circle.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_items.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_triangulator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_checker.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_point.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/SM_const_decorator.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/OGL_base_object.h
Examining data/cgal-5.1.1/include/CGAL/Nef_S2/Sphere_direction.h
Examining data/cgal-5.1.1/include/CGAL/Linear_algebraHd.h
Examining data/cgal-5.1.1/include/CGAL/Exact_predicates_exact_constructions_kernel_with_root_of.h
Examining data/cgal-5.1.1/include/CGAL/Profile_timer.h
Examining data/cgal-5.1.1/include/CGAL/Is_extended_kernel.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_iterator.h
Examining data/cgal-5.1.1/include/CGAL/gmpxx.h
Examining data/cgal-5.1.1/include/CGAL/Arr_consolidated_curve_data_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Projection_traits_xz_3.h
Examining data/cgal-5.1.1/include/CGAL/Hilbert_sort_middle_d.h
Examining data/cgal-5.1.1/include/CGAL/Arr_unb_planar_topology_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/is_iterator.h
Examining data/cgal-5.1.1/include/CGAL/nearest_neighbor_delaunay_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Polygon_convex_decomposition_2.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_simple_site_2.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_vertex_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_cell_base_3.h
Examining data/cgal-5.1.1/include/CGAL/Implicit_to_labeled_subdomains_function_wrapper.h
Examining data/cgal-5.1.1/include/CGAL/GMap_cell_const_iterators.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_criteria_3.h
Examining data/cgal-5.1.1/include/CGAL/Root_of_traits.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/basic.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Compare_y_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Finite_edge_test8_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Oriented_side_of_bisector_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/comparator_profiler.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Finite_edge_test_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Apollonius_graph_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Constructions_ftC2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Is_degenerate_edge_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Constructions_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Predicate_constructions_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Compare_weight_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Apollonius_graph_hierarchy_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Orientation_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Incircle8_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Predicates_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/predicate_profiler.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/uncertain/Uncertain_vertex_conflict_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/uncertain/uncertain_functions_on_signs.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/uncertain/Uncertain_is_hidden_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/uncertain/Uncertain_oriented_side_of_bisector_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Orientation8_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/compare_quadratic.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Compare_x_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Is_hidden_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Bounded_side_of_ccw_circle_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Infinite_edge_test_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Constructions_rtH2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Kernel_wrapper_2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Incircle_C2.h
Examining data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Traits_wrapper_2.h
Examining data/cgal-5.1.1/include/CGAL/normal_vector_newell_3.h
Examining data/cgal-5.1.1/include/CGAL/Filtered_bbox_circular_kernel_2.h
Examining data/cgal-5.1.1/include/CGAL/bounding_box.h
Examining data/cgal-5.1.1/include/CGAL/AABB_segment_primitive.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_traits.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_ninetuple.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_triangulation_pl_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_vertices_generator.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_specified_points_generator.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_middle_edges_generator.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_triangulation_pl_functions.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_misc.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_dag_node.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_predicates.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_dag.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_active_vertex.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_random_generator.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_landmarks_pl_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_active_trapezoid.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_inactive_fictitious_vertex.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_naive_point_location_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_active_fictitious_vertex.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_halton_generator.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_X_trapezoid.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_grid_generator.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_simple_point_location_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_inactive_trapezoid.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_inactive_vertex.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_inactive_edge.h
Examining data/cgal-5.1.1/include/CGAL/Arr_point_location/Td_active_edge.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Iterator_list.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Partition_traits_2_base.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Partitioned_polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Partition_opt_cvx_diagonal_list.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Matrix.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Partition_opt_cvx_edge.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Indirect_not_less_yx_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/partition_optimal_convex_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Triangulation_indirect_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/partition_assertions.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Vertex_visibility_graph_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/is_degenerate_polygon_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/partition_y_monotone_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Partition_vertex_map.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Indirect_less_xy_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Rotation_tree_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/partition_approx_convex_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Rotation_tree_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Turn_reverser.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Circulator_pair.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Rotation_tree_node_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Indirect_edge_compare.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Vertex_visibility_graph_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Segment_less_yx_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Point_pair_less_xy_2.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/Partition_opt_cvx_vertex.h
Examining data/cgal-5.1.1/include/CGAL/Partition_2/partition_greene_approx_convex_2.h
Examining data/cgal-5.1.1/include/CGAL/HalfedgeDS_face_max_base_with_id.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Point_3_Point_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Ray_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Sphere_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Line_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Plane_3_Plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Triangle_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Plane_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Segment_3_Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Ray_3_Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Plane_3_Point_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Point_3_Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Point_3_Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Iso_cuboid_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Point_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Segment_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Point_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Iso_cuboid_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Plane_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Line_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Segment_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Line_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Iso_cuboid_3_Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Tetrahedron_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Ray_3_Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Tetrahedron_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Triangle_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Ray_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Ray_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Bbox_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Iso_cuboid_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Triangle_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Tetrahedron_3_Plane_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Sphere_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Ray_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/intersection_3_1_impl.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Segment_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Tetrahedron_3_Ray_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Sphere_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Segment_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Line_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Line_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Tetrahedron_3_Unbounded_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/tetrahedron_lines_intersections_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Sphere_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Segment_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Plane_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Plane_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/bbox_intersection_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/tetrahedron_intersection_helpers.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Tetrahedron_3_Segment_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Tetrahedron_3_Triangle_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Ray_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Triangle_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Tetrahedron_3_Bounded_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Triangle_3_Plane_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Bbox_3_Line_3_do_intersect.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/internal/Tetrahedron_3_Line_3_intersection.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Point_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Point_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Ray_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Plane_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Plane_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Ray_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Sphere_3_Sphere_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Segment_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Triangle_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Plane_3_Ray_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Sphere_3_Tetrahedron_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Bbox_3_Point_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Line_3_Point_3.h
Examining data/cgal-5.1.1/include/CGAL/Intersections_3/Plane_3_Segment_3.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/internal/helper.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/internal/population.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/internal/fitness_function.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/internal/evolution.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/internal/nelder_mead_functions.h
Examining data/cgal-5.1.1/include/CGAL/Optimal_bounding_box/Oriented_bounding_box_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/simplest_rational_in_interval.h
Examining data/cgal-5.1.1/include/CGAL/Combinatorial_map_operations.h
Examining data/cgal-5.1.1/include/CGAL/Three/Triangle_container.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_zoomable_item_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_item.h
Examining data/cgal-5.1.1/include/CGAL/Three/Buffer_objects.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_item_rendering_helper.h
Examining data/cgal-5.1.1/include/CGAL/Three/TextRenderer.h
Examining data/cgal-5.1.1/include/CGAL/Three/Primitive_container.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_item_config.h
Examining data/cgal-5.1.1/include/CGAL/Three/Point_container.h
Examining data/cgal-5.1.1/include/CGAL/Three/Polyhedron_demo_plugin_helper.h
Examining data/cgal-5.1.1/include/CGAL/Three/Viewer_config.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_draw_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_item_with_properties.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_transparent_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/Polyhedron_demo_io_plugin_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_print_item_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/Scene_group_item.h
Examining data/cgal-5.1.1/include/CGAL/Three/Viewer_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/exceptions.h
Examining data/cgal-5.1.1/include/CGAL/Three/Three.h
Examining data/cgal-5.1.1/include/CGAL/Three/Polyhedron_demo_plugin_interface.h
Examining data/cgal-5.1.1/include/CGAL/Three/Edge_container.h
Examining data/cgal-5.1.1/include/CGAL/Delaunay_triangulation_adaptation_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Euler_integrator_2.h
Examining data/cgal-5.1.1/include/CGAL/Subdivision_method_3/subdivision_methods_3.h
Examining data/cgal-5.1.1/include/CGAL/Subdivision_method_3/subdivision_hosts_3.h
Examining data/cgal-5.1.1/include/CGAL/Subdivision_method_3/internal/Euler_extensions.h
Examining data/cgal-5.1.1/include/CGAL/Subdivision_method_3/internal/subdivision_hosts_impl_3.h
Examining data/cgal-5.1.1/include/CGAL/Subdivision_method_3/subdivision_masks_3.h
Examining data/cgal-5.1.1/include/CGAL/GMPXX_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Direction_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_facet_topology.h
Examining data/cgal-5.1.1/include/CGAL/Algebraic_kernel_for_circles_2_2.h
Examining data/cgal-5.1.1/include/CGAL/Compute_anchor_3.h
Examining data/cgal-5.1.1/include/CGAL/Surface_sweep_2_algorithms.h
Examining data/cgal-5.1.1/include/CGAL/Polychain_2.h
Examining data/cgal-5.1.1/include/CGAL/Fraction_traits.h
Examining data/cgal-5.1.1/include/CGAL/Arr_Bezier_curve_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Origin_impl.h
Examining data/cgal-5.1.1/include/CGAL/Width_default_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/intersection_line_2_circle_2_map.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/Circular_arc_point_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/function_objects_on_circle_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/Line_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/Circular_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/function_objects_on_line_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/interface_macros.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_line_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/Intersection_traits.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_circle_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h
Examining data/cgal-5.1.1/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_vertex_base_with_info_2.h
Examining data/cgal-5.1.1/include/CGAL/Vector_2.h
Examining data/cgal-5.1.1/include/CGAL/Constrained_triangulation_face_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Plane_3.h
Examining data/cgal-5.1.1/include/CGAL/AABB_tree.h
Examining data/cgal-5.1.1/include/CGAL/global_functions_circular_kernel_2.h
Examining data/cgal-5.1.1/include/CGAL/AABB_halfedge_graph_segment_primitive.h
Examining data/cgal-5.1.1/include/CGAL/for_each.h
Examining data/cgal-5.1.1/include/CGAL/intersection_3.h
Examining data/cgal-5.1.1/include/CGAL/linear_least_squares_fitting_segments_2.h
Examining data/cgal-5.1.1/include/CGAL/Mesh_cell_criteria_3.h
Examining data/cgal-5.1.1/include/CGAL/Polygonal_schema_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_default_criteria_3.h
Examining data/cgal-5.1.1/include/CGAL/Monge_via_jet_fitting.h
Examining data/cgal-5.1.1/include/CGAL/Compare_handles_with_or_without_timestamps.h
Examining data/cgal-5.1.1/include/CGAL/Surface_mesh_vertex_base_3.h
Examining data/cgal-5.1.1/include/CGAL/circulator_bases.h
Examining data/cgal-5.1.1/include/CGAL/Minimum_enclosing_quadrilateral_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Polytope_distance_d_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Path_on_surface.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_unb_planar_batched_pl_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_unb_planar_insertion_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_bounded_planar_overlay_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_spherical_construction_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_bounded_planar_insertion_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_bounded_planar_topology_traits_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_bounded_planar_construction_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_spherical_insertion_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_inc_insertion_zone_visitor.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_unb_planar_construction_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_unb_planar_overlay_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_spherical_overlay_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_planar_topology_traits_base_2.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_bounded_planar_batched_pl_helper.h
Examining data/cgal-5.1.1/include/CGAL/Arr_topology_traits/Arr_spherical_batched_pl_helper.h
Examining data/cgal-5.1.1/include/CGAL/Approximate_min_ellipsoid_d_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/connect_holes.h
Examining data/cgal-5.1.1/include/CGAL/Qt/constraint.h
Examining data/cgal-5.1.1/include/CGAL/Qt/utility_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/PolygonWithHolesGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewNavigation_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/manipulatedFrame.h
Examining data/cgal-5.1.1/include/CGAL/Qt/Basic_viewer_qt.h
Examining data/cgal-5.1.1/include/CGAL/Qt/RegularGridVectorFieldGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/CGAL_Qt_config.h
Examining data/cgal-5.1.1/include/CGAL/Qt/SegmentsGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/vec.h
Examining data/cgal-5.1.1/include/CGAL/Qt/PainterOstream.h
Examining data/cgal-5.1.1/include/CGAL/Qt/Converter.h
Examining data/cgal-5.1.1/include/CGAL/Qt/resources_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/manipulatedCameraFrame.h
Examining data/cgal-5.1.1/include/CGAL/Qt/mouseGrabber_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/quaternion_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/SegmentDelaunayGraphLinfGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/PolygonGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/manipulatedCameraFrame_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/SegmentDelaunayGraphGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/manipulatedFrame_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/StreamLinesGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewCircleInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/frame_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewCircularArcInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/PointsInKdTreeGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/LineGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/VoronoiGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/image_interface.h
Examining data/cgal-5.1.1/include/CGAL/Qt/RegularGridGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/frame.h
Examining data/cgal-5.1.1/include/CGAL/Qt/CircularArcGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/RegularTriangulationGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/keyFrameInterpolator.h
Examining data/cgal-5.1.1/include/CGAL/Qt/resources.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewPointInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/ConstrainedTriangulationGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/debug_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/qglviewer_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/domUtils.h
Examining data/cgal-5.1.1/include/CGAL/Qt/mouseGrabber.h
Examining data/cgal-5.1.1/include/CGAL/Qt/DelaunayMeshTriangulationGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/PointsGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/PolylinesGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewLineInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/keyFrameInterpolator_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/ApolloniusGraphGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/qglviewer_impl_list.h
Examining data/cgal-5.1.1/include/CGAL/Qt/utility.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewNavigation.h
Examining data/cgal-5.1.1/include/CGAL/Qt/camera.h
Examining data/cgal-5.1.1/include/CGAL/Qt/qglviewer.h
Examining data/cgal-5.1.1/include/CGAL/Qt/DemosMainWindow.h
Examining data/cgal-5.1.1/include/CGAL/Qt/PowerdiagramGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/viewer_actions.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewIsoRectangleInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/DemosMainWindow_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewPolygonWithHolesInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/CreateOpenGLContext.h
Examining data/cgal-5.1.1/include/CGAL/Qt/quaternion.h
Examining data/cgal-5.1.1/include/CGAL/Qt/camera_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewPolylineInput.h
Examining data/cgal-5.1.1/include/CGAL/Qt/debug.h
Examining data/cgal-5.1.1/include/CGAL/Qt/constraint_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/AlphaShapeGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/TriangulationGraphicsItem.h
Examining data/cgal-5.1.1/include/CGAL/Qt/vec_impl.h
Examining data/cgal-5.1.1/include/CGAL/Qt/GraphicsViewPolylineInput_impl.h
Examining data/cgal-5.1.1/include/CGAL/Min_sphere_of_spheres_d_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Linear_cell_complex_fwd.h
Examining data/cgal-5.1.1/include/CGAL/Arr_directional_non_caching_segment_basic_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Labeled_mesh_domain_3.h
Examining data/cgal-5.1.1/include/CGAL/minimum_enclosing_quadrilateral_2.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_dummy_12.h
Examining data/cgal-5.1.1/include/CGAL/intersection_3_1.h
Examining data/cgal-5.1.1/include/CGAL/grid_simplify_point_set.h
Examining data/cgal-5.1.1/include/CGAL/Eigen_sparse_matrix.h
Examining data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_Linf_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_traits_3.h
Examining data/cgal-5.1.1/include/CGAL/Splitters.h
Examining data/cgal-5.1.1/include/CGAL/Arr_circle_segment_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Lightweight_vector_3.h
Examining data/cgal-5.1.1/include/CGAL/Iso_cuboid_3.h
Examining data/cgal-5.1.1/include/CGAL/Interval_skip_list_interval.h
Examining data/cgal-5.1.1/include/CGAL/squared_distance_2_1.h
Examining data/cgal-5.1.1/include/CGAL/global_functions_spherical_kernel_3.h
Examining data/cgal-5.1.1/include/CGAL/FPU_gcc_i386.h
Examining data/cgal-5.1.1/include/CGAL/GMP_arithmetic_kernel.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_vertex_base_with_info_3.h
Examining data/cgal-5.1.1/include/CGAL/Epic_converter.h
Examining data/cgal-5.1.1/include/CGAL/Nef_polynomial.h
Examining data/cgal-5.1.1/include/CGAL/predicates_on_points_3.h
Examining data/cgal-5.1.1/include/CGAL/compare_vertices.h
Examining data/cgal-5.1.1/include/CGAL/AABB_triangle_primitive.h
Examining data/cgal-5.1.1/include/CGAL/tss.h
Examining data/cgal-5.1.1/include/CGAL/convex_hull_traits_2.h
Examining data/cgal-5.1.1/include/CGAL/Triangulation_ds_iterators_2.h
Examining data/cgal-5.1.1/debian/tests/rounding_math_simple.cpp
Examining data/cgal-5.1.1/debian/tests/rounding_modes_cgal.cpp
Examining data/cgal-5.1.1/debian/tests/rounding_modes_simple.cpp

FINAL RESULTS:

data/cgal-5.1.1/demo/Polyhedron/Polyhedron_demo.cpp:109:5:  [4] (shell) system:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
    system("osascript -e 'tell application \"System Events\" "
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:98:18:  [4] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused).
            std::strcat(name[i],name[j]);
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:104:16:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
          std::strcpy(name[size++],name[j]);
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:211:18:  [4] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused).
            std::strcat(name[i],name[j]);
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:217:16:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
          std::strcpy(name[size++],name[j]);
data/cgal-5.1.1/include/CGAL/Delaunay_d.h:166:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access.homogeneous(normal,access.dimension(normal)-1));
data/cgal-5.1.1/include/CGAL/Delaunay_d.h:166:33:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access.homogeneous(normal,access.dimension(normal)-1));
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:755:5:  [4] (format) sprintf:
  Potential format string problem (CWE-134). Make format string constant.
    sprintf ("#%02x%02x%02x", r, g, b);
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:93:13:  [4] (shell) execlp:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
            execlp("rsh", "rsh", machine, "-l", login, s.data(),
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:96:13:  [4] (shell) execlp:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
            execlp("geomview", "geomview", "-c", "-",
data/cgal-5.1.1/include/CGAL/IO/trace.h:29:3:  [4] (format) vfprintf:
  If format strings can be influenced by an attacker, they can be exploited
  (CWE-134). Use a constant for the format specification.
  vfprintf(stderr, fmt, argp);
data/cgal-5.1.1/include/CGAL/IO/traits_point.h:40:8:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
struct access<CGAL::Point_2<K> , 0>
data/cgal-5.1.1/include/CGAL/IO/traits_point.h:55:8:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
struct access<CGAL::Point_2<K> , 1>
data/cgal-5.1.1/include/CGAL/IO/traits_point_3.h:40:8:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
struct access<CGAL::Point_3<K> , 0>
data/cgal-5.1.1/include/CGAL/IO/traits_point_3.h:55:8:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
struct access<CGAL::Point_3<K> , 1>
data/cgal-5.1.1/include/CGAL/IO/traits_point_3.h:69:8:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
struct access<CGAL::Point_3<K> , 2>
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:469:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  descrip: %s", analyzeHeader->hist.descrip );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:472:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  aux_file: %s", analyzeHeader->hist.descrip );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:478:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  originator: %s", analyzeHeader->hist.originator );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:481:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  generated: %s", analyzeHeader->hist.generated );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:484:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  scannum: %s", analyzeHeader->hist.scannum );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:487:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  patient_id: %s", analyzeHeader->hist.patient_id );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:490:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  exp_date: %s", analyzeHeader->hist.exp_date );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:493:7:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
      sprintf( im->user[i++], "  exp_time: %s", analyzeHeader->hist.exp_time );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:537:9:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
        strcpy(data_filename,name);
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:543:11:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
          strcpy(data_filename,name);
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:283:5:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
    strcpy( im->user[n++], s ); \
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:483:5:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
    strcpy(data_filename,name);
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:489:7:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
      strcpy(data_filename,name);
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:448:3:  [4] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused).
  strcat(el->string, str);
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:69:14:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
      (void) strcpy(sign_type, MI_UNSIGNED);
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:71:14:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
      (void) strcpy(sign_type, MI_SIGNED);
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:357:9:  [4] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused).
        strcat(newname, filename + i + 1);
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:360:9:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
        sprintf(newname, "#TMP#%s", filename);
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:527:5:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
    sprintf( string, "%s\n", PGM_ASCII_MAGIC );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:529:5:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
    sprintf( string, "%s\n", PGM_MAGIC );
data/cgal-5.1.1/include/CGAL/Nef_2/PM_overlayer.h:93:31:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    geninfo<Halfedge_handle>::access(G.info(v)) = e;
data/cgal-5.1.1/include/CGAL/Nef_2/PM_overlayer.h:102:38:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return geninfo<Halfedge_handle>::access(G.info(v));
data/cgal-5.1.1/include/CGAL/Nef_2/PM_overlayer.h:684:32:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  return geninfo<vertex_info>::access(info(v));
data/cgal-5.1.1/include/CGAL/Nef_2/PM_overlayer.h:740:34:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  return geninfo<halfedge_info>::access(info(e));
data/cgal-5.1.1/include/CGAL/Nef_2/PM_overlayer.h:792:30:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  return geninfo<face_info>::access(info(f));
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:473:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<VF_pair>::access(info(vn)) = VF_pair(vo,f);
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:484:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<EF_pair>::access(info(hn)) = EF_pair(ho,Po.face(ho));
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:581:31:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        f = geninfo<VF_pair>::access(info(source(e))).second;
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:583:31:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        f = geninfo<EF_pair>::access(info(e_from)).second;
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:596:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<EF_pair>::access(info(e)).first =
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:597:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<EF_pair>::access(info(twin(e))).first =
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:600:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<EF_pair>::access(info(e)).second =
data/cgal-5.1.1/include/CGAL/Nef_2/PM_point_locator.h:601:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<EF_pair>::access(info(twin(e))).second = f;
data/cgal-5.1.1/include/CGAL/Nef_2/gen_point_location.h:140:22:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<Node>::access(value) = n;
data/cgal-5.1.1/include/CGAL/Nef_2/gen_point_location.h:149:22:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      geninfo<Edge>::access(value) = e;
data/cgal-5.1.1/include/CGAL/Nef_2/gen_point_location.h:175:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
         geninfo<Node>::access(value) = geninfo<Node>::const_access(L.value);
data/cgal-5.1.1/include/CGAL/Nef_2/gen_point_location.h:182:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
         geninfo<Edge>::access(value) = geninfo<Edge>::const_access(L.value);
data/cgal-5.1.1/include/CGAL/Nef_2/geninfo.h:53:13:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  static T& access(GenPtr& p)
data/cgal-5.1.1/include/CGAL/Nef_2/geninfo.h:78:13:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  static T& access(GenPtr& p)  { return *(T*)p;  }
data/cgal-5.1.1/include/CGAL/Nef_3/SNC_FM_decorator.h:146:22:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  geninfo<unsigned>::access(v->info()) = e;
data/cgal-5.1.1/include/CGAL/Nef_3/SNC_FM_decorator.h:414:34:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      Edge_of[geninfo<unsigned>::access(info(e_min->twin()->source()->twin()->source()))];
data/cgal-5.1.1/include/CGAL/Nef_3/SNC_FM_decorator.h:653:34:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      Edge_of[geninfo<unsigned>::access(info(l->incident_sface()->center_vertex()))];
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_overlayer.h:97:31:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    geninfo<Halfedge_handle>::access(G.info(v)) = e;
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_overlayer.h:106:38:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return geninfo<Halfedge_handle>::access(G.info(v));
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_overlayer.h:574:34:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return geninfo<vertex_info>::access(info(v));
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_overlayer.h:629:32:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return geninfo<edge_info>::access(info(e));
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_overlayer.h:681:32:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return geninfo<face_info>::access(info(f));
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_triangulator.h:223:34:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return geninfo<vertex_info>::access(info(v));
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_triangulator.h:269:32:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return geninfo<edge_info>::access(info(e));
data/cgal-5.1.1/include/CGAL/Optimisation/Access_coordinates_begin_d.h:55:5:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    access( const Point& p, const Cartesian_tag&) const
data/cgal-5.1.1/include/CGAL/Optimisation/Access_coordinates_begin_d.h:59:5:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    access( const Point& p, const Homogeneous_tag&) const
data/cgal-5.1.1/include/CGAL/Straight_skeleton_vertex_base_2.h:38:37:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    static typename Impl::reference access ( Impl* aImpl )
data/cgal-5.1.1/include/CGAL/Straight_skeleton_vertex_base_2.h:48:37:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    static typename Impl::reference access ( Impl* aImpl )
data/cgal-5.1.1/include/CGAL/Straight_skeleton_vertex_base_2.h:104:60:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      reference dereference() const { return AccessPolicy::access(const_cast<Self*>(this)) ; }
data/cgal-5.1.1/include/CGAL/Tools/chained_map.h:112:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
   T& access(chained_map_item p, std::size_t x);
data/cgal-5.1.1/include/CGAL/Tools/chained_map.h:113:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
   T& access(std::size_t x);
data/cgal-5.1.1/include/CGAL/Tools/chained_map.h:121:38:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
inline T& chained_map<T, Allocator>::access(std::size_t x)
data/cgal-5.1.1/include/CGAL/Tools/chained_map.h:136:14:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      return access(p,x);
data/cgal-5.1.1/include/CGAL/Tools/chained_map.h:225:9:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  T p = access(old_index);
data/cgal-5.1.1/include/CGAL/Tools/chained_map.h:236:3:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  access(old_index) = p;
data/cgal-5.1.1/include/CGAL/Tools/chained_map.h:240:31:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
T& chained_map<T, Allocator>::access(chained_map_item p, std::size_t x)
data/cgal-5.1.1/include/CGAL/Unique_hash_map.h:103:22:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        return m_map.access( m_hash_function(key));
data/cgal-5.1.1/demo/AABB_tree/benchmarks.cpp:30:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(0);
data/cgal-5.1.1/demo/AABB_tree/benchmarks.cpp:189:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(0);
data/cgal-5.1.1/demo/AABB_tree/benchmarks.cpp:234:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(0);
data/cgal-5.1.1/demo/AABB_tree/benchmarks.cpp:317:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(0);
data/cgal-5.1.1/demo/CGAL_ipelets/generator.cpp:165:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random;
data/cgal-5.1.1/demo/CGAL_ipelets/generator.cpp:167:46:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      draw_in_ipe(Circle_2(*it_pt+origin,pow(random.get_double(size/20.,size/2.),2) ));
data/cgal-5.1.1/demo/Interpolation/surface_voronoi.cpp:105:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random;
data/cgal-5.1.1/demo/Interpolation/surface_voronoi.cpp:109:9:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    h = random.get_double(0.0,height);
data/cgal-5.1.1/demo/Interpolation/surface_voronoi.cpp:111:5:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    random.get_double(0.0,height);
data/cgal-5.1.1/demo/Linear_cell_complex/Viewer.h:89:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(alcc.darts().index(dh)));
data/cgal-5.1.1/demo/Linear_cell_complex/Viewer.h:90:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/Otr2_demo.cpp:6:3:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  srand(1);
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.h:111:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random;
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.h:116:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    double dx = random.get_double(-scale, scale);
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.h:117:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    double dy = random.get_double(-scale, scale);
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.h:123:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(0); // for sake of repeatability
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.h:538:25:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      const double rd = random.get_double(0.0, 1.0);
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/scene.h:557:15:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      FT rv = random.get_double(0.0, 1.0);
data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/hyperbolic_free_motion_animation.h:22:8:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  std::srand(std::time(0));
data/cgal-5.1.1/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp:501:11:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
          srand(cid);
data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Surface_mesh_approximation_plugin.cpp:67:10:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    std::srand(time(0));
data/cgal-5.1.1/examples/Alpha_shapes_3/ex_periodic_alpha_shapes_3.cpp:34:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random(7);
data/cgal-5.1.1/examples/Alpha_shapes_3/ex_periodic_alpha_shapes_3.cpp:35:60:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random_points_in_cube_3<Point, Creator> in_cube(1, random);
data/cgal-5.1.1/examples/Alpha_shapes_3/ex_weighted_periodic_alpha_shapes_3.cpp:36:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random(8);
data/cgal-5.1.1/examples/Alpha_shapes_3/ex_weighted_periodic_alpha_shapes_3.cpp:48:37:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      pts.emplace_back(bp, 0.0001 * random.get_double(0., 0.015625)); // arbitrary weights
data/cgal-5.1.1/examples/Nef_S2/include/CGAL/Nef_S2/create_random_Nef_S2.h:24:10:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    std::srand(static_cast<unsigned int>(time(0)));
data/cgal-5.1.1/examples/Nef_S2/include/CGAL/Nef_S2/create_random_Nef_S2.h:26:10:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    std::srand(seed);
data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_large_point_set.cpp:23:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random(7);
data/cgal-5.1.1/examples/Periodic_2_triangulation_2/p2t2_large_point_set.cpp:24:65:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random_points_in_square_2<Point, Creator> in_square(.5, random);
data/cgal-5.1.1/examples/Periodic_3_triangulation_3/large_point_set.cpp:23:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random(7);
data/cgal-5.1.1/examples/Periodic_3_triangulation_3/large_point_set.cpp:24:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random_points_in_cube_3<Point, Creator> in_cube(.5, random);
data/cgal-5.1.1/examples/Shape_detection/region_growing_on_point_set_2.cpp:135:3:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  srand(static_cast<unsigned int>(time(NULL)));
data/cgal-5.1.1/examples/Shape_detection/region_growing_on_polygon_mesh.cpp:133:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(static_cast<unsigned int>(time(NULL)));
data/cgal-5.1.1/examples/Solver_interface/sparse_solvers.cpp:11:3:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  srand(static_cast<unsigned int>(time (NULL)));
data/cgal-5.1.1/examples/Spatial_sorting/example_delaunay_2.cpp:72:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random (42);
data/cgal-5.1.1/examples/Spatial_sorting/example_delaunay_2.cpp:73:54:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random_points_in_square_2<Point> gen (1.0, random);
data/cgal-5.1.1/examples/Spatial_sorting/hilbert_sort_on_sphere.cpp:16:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random (42);
data/cgal-5.1.1/examples/Spatial_sorting/hilbert_sort_on_sphere.cpp:24:59:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random_points_on_sphere_3<Point> unit_sphere(1.0, random);  // generate points
data/cgal-5.1.1/examples/Spatial_sorting/hilbert_sort_on_sphere.cpp:40:60:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random_points_on_sphere_3<Point> given_sphere(2.0, random);  // generate points
data/cgal-5.1.1/examples/Spatial_sorting/spatial_sort_on_sphere.cpp:16:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random (42);
data/cgal-5.1.1/examples/Spatial_sorting/spatial_sort_on_sphere.cpp:24:59:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random_points_on_sphere_3<Point> unit_sphere(1.0, random);  // generate points
data/cgal-5.1.1/examples/Spatial_sorting/spatial_sort_on_sphere.cpp:40:60:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random_points_on_sphere_3<Point> given_sphere(2.0, random);  // generate points
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:46:41:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                          CGAL::Random& random,
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:108:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random; // Used when user do not provide its own seed.
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:111:67:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  process_command_line(argc, argv, file, draw, l1, l2, d1, d2, N, random, time);
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:141:28:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                          (random.get_int(0, (std::numeric_limits<int>::max)())));
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:143:33:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    std::cout<<"Random seed: "<<random.get_seed()<<": ";
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:145:38:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    length=static_cast<unsigned int>(random.get_int(l1, l2+1));
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:146:36:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    defo=static_cast<unsigned int>(random.get_int(d1, d2+1));
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:152:47:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    path1.generate_random_closed_path(length, random);
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:158:38:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    path2.update_path_randomly(defo, random);
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy.cpp:168:30:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    { errors_seeds.push_back(random.get_seed()); }
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_with_sm_and_polyhedron.cpp:24:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random(seed);
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_with_sm_and_polyhedron.cpp:28:38:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  p1.generate_random_closed_path(10, random);
data/cgal-5.1.1/examples/Surface_mesh_topology/path_homotopy_with_sm_and_polyhedron.cpp:31:38:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  p2.generate_random_closed_path(10, random);
data/cgal-5.1.1/examples/Surface_mesh_topology/shortest_noncontractible_cycle_2.cpp:41:41:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                          CGAL::Random& random)
data/cgal-5.1.1/examples/Surface_mesh_topology/shortest_noncontractible_cycle_2.cpp:81:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random; // Used when user do not provide its own seed.
data/cgal-5.1.1/examples/Surface_mesh_topology/shortest_noncontractible_cycle_2.cpp:82:64:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  process_command_line(argc, argv, filename, draw, dist, time, random);
data/cgal-5.1.1/examples/Surface_mesh_topology/shortest_noncontractible_cycle_2.cpp:94:14:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
           <<random.get_seed()<<")"<<std::endl;
data/cgal-5.1.1/examples/Surface_mesh_topology/shortest_noncontractible_cycle_2.cpp:100:42:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  Dart_const_handle root=lcc.dart_handle(random.get_int(0,  static_cast<int>(lcc.number_of_darts())));
data/cgal-5.1.1/include/CGAL/Apollonius_graph_2/Apollonius_graph_hierarchy_2_impl.h:429:82:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::variate_generator<boost::rand48&, boost::geometric_distribution<> > die(random, proba);
data/cgal-5.1.1/include/CGAL/Apollonius_graph_hierarchy_2.h:213:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48  random; // random generator
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_random_generator.h:115:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random;
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_random_generator.h:117:46:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      double px = (x_min == x_max) ? x_min : random.get_double(x_min, x_max);
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_lm_random_generator.h:118:46:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      double py = (y_min == y_max) ? y_min : random.get_double(y_min, y_max);
data/cgal-5.1.1/include/CGAL/CORE/Gmp_impl.h:159:7:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    i.setstate(ios::failbit); // read failed
data/cgal-5.1.1/include/CGAL/CORE/Gmp_impl.h:238:7:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    i.setstate(ios::failbit); // read failed
data/cgal-5.1.1/include/CGAL/Circle_2.h:278:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp:68:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
typedef boost::random::uniform_int_distribution<> UniformIntDist;
data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp:69:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
typedef boost::random::normal_distribution<> NormalDist;
data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp:70:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
typedef boost::random::mt19937 RandomGen;
data/cgal-5.1.1/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp:71:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
typedef boost::random::uniform_01<> UnitDist;
data/cgal-5.1.1/include/CGAL/Direction_2.h:236:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Direction_2.h:261:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Direction_3.h:194:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Direction_3.h:220:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/GMP/Gmpfi_type.h:824:20:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                is.setstate(std::ios_base::failbit);
data/cgal-5.1.1/include/CGAL/GMP/Gmpfr_type.h:1068:36:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                                is.setstate(std::ios_base::failbit);
data/cgal-5.1.1/include/CGAL/GMP/Gmpfr_type.h:1103:28:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                        is.setstate(std::ios_base::failbit);
data/cgal-5.1.1/include/CGAL/GMP/Gmpz_type.h:306:8:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    is.setstate(std::ios_base::failbit);
data/cgal-5.1.1/include/CGAL/IO/PLY_reader.h:101:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      in.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/IO/PLY_reader.h:187:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      in.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/IO/WKT.h:205:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        in.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/IO/WKT.h:239:18:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
              in.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/IO/io.h:173:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios_base::failbit);
data/cgal-5.1.1/include/CGAL/IO/io.h:225:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios_base::failbit);
data/cgal-5.1.1/include/CGAL/IO/io.h:589:8:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    is.setstate(std::ios_base::failbit);
data/cgal-5.1.1/include/CGAL/IO/read_ply_points.h:147:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    stream.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Interval_nt.h:428:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios_base::failbit);       \
data/cgal-5.1.1/include/CGAL/Interval_skip_list.h:128:19:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::rand48 random;
data/cgal-5.1.1/include/CGAL/Interval_skip_list.h:1198:84:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::variate_generator<boost::rand48&, boost::geometric_distribution<> > die(random, proba);
data/cgal-5.1.1/include/CGAL/Line_2.h:280:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Min_circle_2.h:316:70:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                    CGAL::cpp98::random_shuffle( v.begin(), v.end(), random);
data/cgal-5.1.1/include/CGAL/Min_ellipse_2.h:342:70:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                    CGAL::cpp98::random_shuffle( v.begin(), v.end(), random);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:557:54:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  bool initialize_random_starting_dart(CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:565:8:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      (random.get_int(0, static_cast<int>(get_map().darts().capacity())));
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:577:25:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    bool heads_or_tails=random.get_bool();
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:598:44:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return initialize_random_starting_dart(random, update_isclosed);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:603:43:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  bool extend_path_randomly(CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:608:46:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    { return initialize_random_starting_dart(random, update_isclosed); }
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:646:8:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      (random.get_int(allow_half_turn?0:1,static_cast<int>(candidats.size())));
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:659:33:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return extend_path_randomly(random, allow_half_turn, update_isclosed);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:670:28:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    { extend_path_randomly(random, allow_half_turns, true); }
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:676:43:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  void generate_random_path(CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:678:26:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  { generate_random_path(random.get_int(1, 10000),
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:679:26:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                         random, true, update_isclosed); }
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:687:34:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    generate_random_path(length, random, true, update_isclosed);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:695:26:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    generate_random_path(random, update_isclosed);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:699:70:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  void generate_random_closed_path(std::size_t length, CGAL::Random& random)
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:705:28:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      extend_path_randomly(random, true, true);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:714:41:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    generate_random_closed_path(length, random);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:718:50:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  void generate_random_closed_path(CGAL::Random& random)
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:719:33:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  { generate_random_closed_path(random.get_int(1, 10000), random); }
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:719:59:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  { generate_random_closed_path(random.get_int(1, 10000), random); }
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:725:33:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    generate_random_closed_path(random.get_int(1, 10000), random);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:725:59:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    generate_random_closed_path(random.get_int(1, 10000), random);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:783:59:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  void update_path_randomly(std::size_t nb, CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:791:10:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        (random.get_int(0, static_cast<int>(length())));
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:799:43:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  void update_path_randomly(CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:801:26:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  { update_path_randomly(random.get_int(0, 10000), update_isclosed); }
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:805:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random;
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:806:30:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    update_path_randomly(nb, random, update_isclosed);
data/cgal-5.1.1/include/CGAL/Path_on_surface.h:812:26:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    update_path_randomly(random, update_isclosed);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_hierarchy_2.h:67:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48  random;
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_hierarchy_2.h:627:7:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  die(random, proba);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_hierarchy_3.h:71:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_hierarchy_3.h:528:11:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      die(random, proba);
data/cgal-5.1.1/include/CGAL/Plane_3.h:264:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Point_2.h:248:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Point_2.h:275:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Point_3.h:278:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Point_3.h:306:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Point_set_3/IO.h:332:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    stream.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Poisson_reconstruction_function.h:468:14:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      Random random(0);
data/cgal-5.1.1/include/CGAL/Poisson_reconstruction_function.h:474:13:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        if (random.get_double() >= ratio)
data/cgal-5.1.1/include/CGAL/Polygonal_schema.h:558:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random(seed);
data/cgal-5.1.1/include/CGAL/Polygonal_schema.h:578:13:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
           (random.get_int(1, static_cast<int>(max_dart_per_face)));
data/cgal-5.1.1/include/CGAL/Polyhedral_complex_mesh_domain_3.h:375:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random(0);
data/cgal-5.1.1/include/CGAL/Polyhedral_complex_mesh_domain_3.h:456:12:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        if(random.uniform_smallint(
data/cgal-5.1.1/include/CGAL/QP_solver/QP__partial_base.h:77:49:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    QP__partial_base( bool  randomize, Random&  random);
data/cgal-5.1.1/include/CGAL/QP_solver/QP__partial_base.h:117:45:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
QP__partial_base( bool  randomize, Random&  random)
data/cgal-5.1.1/include/CGAL/QP_solver/QP__partial_base.h:118:38:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    : permute( randomize), rand_src( random)
data/cgal-5.1.1/include/CGAL/QP_solver/QP_partial_exact_pricing.h:75:53:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
QP_partial_exact_pricing( bool  randomize, Random&  random)
data/cgal-5.1.1/include/CGAL/QP_solver/QP_partial_exact_pricing.h:77:32:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      Partial_base( randomize, random)
data/cgal-5.1.1/include/CGAL/QP_solver/QP_partial_filtered_pricing.h:103:54:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
QP_partial_filtered_pricing( bool randomize, Random& random, ET2NT et2nt)
data/cgal-5.1.1/include/CGAL/QP_solver/QP_partial_filtered_pricing.h:105:32:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      Partial_base( randomize, random),
data/cgal-5.1.1/include/CGAL/Qt/Basic_viewer_qt.h:225:51:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
inline CGAL::Color get_random_color(CGAL::Random& random)
data/cgal-5.1.1/include/CGAL/Qt/Basic_viewer_qt.h:230:21:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    res=CGAL::Color(random.get_int(0,256),
data/cgal-5.1.1/include/CGAL/Qt/Basic_viewer_qt.h:231:21:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                    random.get_int(0,256),
data/cgal-5.1.1/include/CGAL/Qt/Basic_viewer_qt.h:232:21:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                    random.get_int(0,256));
data/cgal-5.1.1/include/CGAL/Reconstruction_triangulation_3.h:388:19:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::rand48 random;
data/cgal-5.1.1/include/CGAL/Reconstruction_triangulation_3.h:389:63:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_hierarchy_2.h:142:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48  random; // random generator
data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_hierarchy_2.h:192:63:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_hierarchy_2.h:431:84:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::variate_generator<boost::rand48&, boost::geometric_distribution<> > die(random, proba);
data/cgal-5.1.1/include/CGAL/Segment_Delaunay_graph_site_2.h:329:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Sphere_3.h:296:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Sphere_3.h:324:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:2463:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:2502:14:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
          is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:2523:14:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
          is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:2553:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:2641:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:2699:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:27:72:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
void create_braket_positive(Path& p, std::size_t length, CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:31:39:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  { p.initialize_random_starting_dart(random, false); }
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:43:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random;
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:44:37:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  create_braket_positive(p, length, random, update_isclosed);
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:48:72:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
void create_braket_negative(Path& p, std::size_t length, CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:52:39:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  { p.initialize_random_starting_dart(random, false); }
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:64:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random;
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:65:37:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  create_braket_negative(p, length, random, update_isclosed);
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:72:53:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                                      CGAL::Random& random)
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:75:40:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  path.initialize_random_starting_dart(random);
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:79:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  path.generate_random_path(random.get_int(0, 15), random);
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:79:52:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  path.generate_random_path(random.get_int(0, 15), random);
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:85:54:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                                       CGAL::Random& random,
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:96:6:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    (random.get_int(0, static_cast<int>(lcc.darts().capacity())));
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:111:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                           (random.get_int
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:130:53:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    std::size_t dartnumber=static_cast<std::size_t>(random.get_int(0, nbborder));
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:188:48:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                                 CGAL::Random& random)
data/cgal-5.1.1/include/CGAL/Surface_mesh_topology/internal/Path_generators.h:194:63:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      generate_random_connected_set_of_faces(p.get_map(), nb, random,
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_2.h:87:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48  random;
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_2.h:96:7:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    , random(std::move(other.random))
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_2.h:96:30:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    , random(std::move(other.random))
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_2.h:794:82:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::variate_generator<boost::rand48&, boost::geometric_distribution<> > die(random, proba);
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_3.h:97:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48  random;
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_3.h:114:7:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    , random(std::move(other.random))
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_3.h:114:30:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    , random(std::move(other.random))
data/cgal-5.1.1/include/CGAL/Triangulation_hierarchy_3.h:867:82:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::variate_generator<boost::rand48&, boost::geometric_distribution<> > die(random, proba);
data/cgal-5.1.1/include/CGAL/Vector_2.h:349:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Vector_2.h:376:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Vector_3.h:330:10:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/Vector_3.h:357:12:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        is.setstate(std::ios::failbit);
data/cgal-5.1.1/include/CGAL/algorithm.h:303:33:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
               RandomGenerator& random)
data/cgal-5.1.1/include/CGAL/algorithm.h:308:33:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    std::iter_swap( it, begin + random( (it - begin) + 1 ) );
data/cgal-5.1.1/include/CGAL/algorithm.h:321:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/algorithm.h:322:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/draw_face_graph_with_paths.h:368:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random(static_cast<unsigned int>(i));
data/cgal-5.1.1/include/CGAL/draw_face_graph_with_paths.h:369:40:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Color color=get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:89:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(alcc.darts().index(dh)));
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:90:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:98:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(alcc.darts().index(dh)));
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:99:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:107:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(alcc.darts().index(dh)));
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:108:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:116:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(alcc.darts().index(dh)));
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:117:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:216:20:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      CGAL::Random random((unsigned int)(lcc->darts().index(dh)));
data/cgal-5.1.1/include/CGAL/draw_linear_cell_complex.h:217:38:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      CGAL::Color c=get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_nef_3.h:38:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(std::size_t)(&(*fh)));
data/cgal-5.1.1/include/CGAL/draw_nef_3.h:39:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_polyhedron.h:36:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(std::size_t)(&(*fh)));
data/cgal-5.1.1/include/CGAL/draw_polyhedron.h:37:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_surface_mesh.h:51:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)fh);
data/cgal-5.1.1/include/CGAL/draw_surface_mesh.h:52:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_triangulation_2.h:33:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)(std::size_t)(&*fh));
data/cgal-5.1.1/include/CGAL/draw_triangulation_2.h:34:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/draw_triangulation_3.h:36:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    CGAL::Random random((unsigned int)((std::size_t)(&*((*fh)->first))+
data/cgal-5.1.1/include/CGAL/draw_triangulation_3.h:38:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    return get_random_color(random);
data/cgal-5.1.1/include/CGAL/hilbert_sort.h:41:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/hilbert_sort.h:42:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/hilbert_sort.h:56:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/hilbert_sort.h:57:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/hilbert_sort.h:71:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/hilbert_sort.h:72:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/hilbert_sort_on_sphere.h:34:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/hilbert_sort_on_sphere.h:35:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/internal/Generic_random_point_generator.h:36:11:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  Random& random;
data/cgal-5.1.1/include/CGAL/internal/Generic_random_point_generator.h:50:7:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    , random(rnd)
data/cgal-5.1.1/include/CGAL/internal/Generic_random_point_generator.h:103:7:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      random.get_double(0, weights.back())
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Expectation_maximization.h:113:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random;
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Expectation_maximization.h:144:5:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    random(CGAL_DEFAULT_SEED) {
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Expectation_maximization.h:254:73:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    Selector().forgy_initialization(number_of_centers, points, centers, random);
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/Expectation_maximization.h:266:77:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    Selector().plus_plus_initialization(number_of_centers, points, centers, random);
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:57:100:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                            const std::vector<T1>& points, std::vector<T2>& centers, CGAL::Random& random) {
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:64:34:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      std::size_t random_index = random(random_range + 1); // [0, random_range];
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:109:104:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                                const std::vector<T1>& points, std::vector<T2>& centers, CGAL::Random& random) {
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:119:33:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    std::size_t initial_index = random(points.size()); // [0, points size)
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:139:26:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      double random_ds = random.get_double(0.0,
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:285:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  CGAL::Random random;
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:310:5:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    random(CGAL_DEFAULT_SEED) {
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:346:73:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    Selector().forgy_initialization(number_of_centers, points, centers, random);
data/cgal-5.1.1/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h:356:77:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    Selector().plus_plus_initialization(number_of_centers, points, centers, random);
data/cgal-5.1.1/include/CGAL/random_convex_hull_in_disc_2.h:83:12:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::random::uniform_real_distribution<double> random_squared_radius_distribution(
data/cgal-5.1.1/include/CGAL/random_convex_hull_in_disc_2.h:86:12:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::random::uniform_real_distribution<double> random_angle_distribution(a, b);
data/cgal-5.1.1/include/CGAL/random_convex_hull_in_disc_2.h:87:12:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::random::variate_generator<
data/cgal-5.1.1/include/CGAL/random_convex_hull_in_disc_2.h:88:22:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        GEN&, boost::random::uniform_real_distribution<double> > random_angle(gen, random_angle_distribution);
data/cgal-5.1.1/include/CGAL/random_convex_hull_in_disc_2.h:89:12:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    boost::random::variate_generator<
data/cgal-5.1.1/include/CGAL/random_convex_hull_in_disc_2.h:90:22:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        GEN&, boost::random::uniform_real_distribution<double> > random_squared_radius(gen, random_squared_radius_distribution);
data/cgal-5.1.1/include/CGAL/spatial_sort.h:44:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/spatial_sort.h:45:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/spatial_sort.h:67:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/spatial_sort.h:68:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/spatial_sort.h:90:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/spatial_sort.h:91:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/include/CGAL/spatial_sort_on_sphere.h:39:17:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::rand48 random;
data/cgal-5.1.1/include/CGAL/spatial_sort_on_sphere.h:40:61:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
  boost::random_number_generator<boost::rand48, Diff_t> rng(random);
data/cgal-5.1.1/demo/AABB_tree/AABB_demo.cpp:50:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/AABB_tree/Color_ramp.h:8:12:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  unsigned char m_colors[4][256];
data/cgal-5.1.1/demo/AABB_tree/MainWindow.cpp:41:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    this, SLOT(open(QString)));
data/cgal-5.1.1/demo/AABB_tree/MainWindow.cpp:63:7:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      open(filename);
data/cgal-5.1.1/demo/AABB_tree/MainWindow.cpp:86:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
void MainWindow::open(QString filename)
data/cgal-5.1.1/demo/AABB_tree/MainWindow.cpp:91:27:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    int index = m_pScene->open(filename);
data/cgal-5.1.1/demo/AABB_tree/MainWindow.cpp:142:7:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      open(filename);
data/cgal-5.1.1/demo/AABB_tree/MainWindow.h:26:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    void open(QString filename);
data/cgal-5.1.1/demo/AABB_tree/Scene.cpp:526:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
int Scene::open(QString filename)
data/cgal-5.1.1/demo/AABB_tree/Scene.h:181:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    int open(QString filename);
data/cgal-5.1.1/demo/Alpha_shapes_2/Alpha_shapes_2.cpp:78:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  void open(QString fileName);
data/cgal-5.1.1/demo/Alpha_shapes_2/Alpha_shapes_2.cpp:154:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Alpha_shapes_2/Alpha_shapes_2.cpp:261:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Alpha_shapes_2/Alpha_shapes_2.cpp:268:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Alpha_shapes_3/MainWindow.cpp:14:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Alpha_shapes_3/MainWindow.cpp:57:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Alpha_shapes_3/MainWindow.cpp:82:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Alpha_shapes_3/MainWindow.h:28:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Apollonius_graph_2/Apollonius_graph_2.cpp:79:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Apollonius_graph_2/Apollonius_graph_2.cpp:141:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Apollonius_graph_2/Apollonius_graph_2.cpp:228:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Apollonius_graph_2/Apollonius_graph_2.cpp:234:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Arrangement_on_surface_2/Conic_reader.h:41:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char dummy[256];
data/cgal-5.1.1/demo/Arrangement_on_surface_2/Conic_reader.h:67:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char one_line[128];
data/cgal-5.1.1/demo/Arrangement_on_surface_2/Conic_reader.h:165:7:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
      char    num[50];
data/cgal-5.1.1/demo/Bounding_volumes/Bounding_volumes.cpp:116:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Bounding_volumes/Bounding_volumes.cpp:224:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Bounding_volumes/Bounding_volumes.cpp:487:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Bounding_volumes/Bounding_volumes.cpp:493:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/CGAL_ipelets/distance.cpp:84:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char message[50];
data/cgal-5.1.1/demo/CGAL_ipelets/distance.cpp:86:5:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
    sprintf(message,"Distance between marks is %f in ipe pts",length);
data/cgal-5.1.1/demo/CGAL_ipelets/distance.cpp:88:5:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
    sprintf(message,"Distance between marks is %f cm",0.0353*length);
data/cgal-5.1.1/demo/CGAL_ipelets/distance.cpp:90:5:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
    sprintf(message,"Distance between marks is %f inches",0.0139*length);
data/cgal-5.1.1/demo/Circular_kernel_2/Circular_kernel_2.cpp:71:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString);
data/cgal-5.1.1/demo/Circular_kernel_2/Circular_kernel_2.cpp:146:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Circular_kernel_2/Circular_kernel_2.cpp:224:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Circular_kernel_2/Circular_kernel_2.cpp:231:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Convex_hull_3/quickhull_3_demo.cpp:99:18:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int num = std::atoi(argv[1]);
data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/HDT2.cpp:102:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/HDT2.cpp:223:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/HDT2.cpp:350:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/HDT2.cpp:356:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Hyperbolic_triangulation_2/HDT2.cpp:424:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp:111:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  void open(QString fileName);
data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp:194:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp:283:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp:289:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Linear_cell_complex/Linear_cell_complex_3_subdivision.cpp:44:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    if (open)
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/window.cpp:41:61:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  connect(this, SIGNAL(openRecentFile(QString)), this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/window.cpp:71:7:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      open(filename);
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/window.cpp:134:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
void MainWindow::open(const QString& filename)
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/window.cpp:167:3:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  open(fileName);
data/cgal-5.1.1/demo/Optimal_transportation_reconstruction_2/window.h:57:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  void open(const QString& file);
data/cgal-5.1.1/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp:97:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp:197:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp:363:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp:369:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp:498:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/Periodic_3_triangulation_3/MainWindow.h:146:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    textFile.open(QIODevice::ReadOnly);
data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/P4HDT2.cpp:120:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/P4HDT2.cpp:404:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Periodic_4_hyperbolic_triangulation_2/P4HDT2.cpp:410:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Polygon/Polygon_2.cpp:115:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString);
data/cgal-5.1.1/demo/Polygon/Polygon_2.cpp:188:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Polygon/Polygon_2.cpp:242:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Polygon/Polygon_2.cpp:247:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp:308:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp:1144:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
void MainWindow::open(QString filename)
data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp:1253:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
bool MainWindow::open(QString filename, QString loader_name) {
data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp:1886:15:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  script_file.open(QIODevice::ReadOnly);
data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp:1997:7:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      open(filename);
data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp:2835:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open(QIODevice::WriteOnly | QIODevice::Text);
data/cgal-5.1.1/demo/Polyhedron/MainWindow.h:121:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  void open(QString) Q_DECL_OVERRIDE;
data/cgal-5.1.1/demo/Polyhedron/MainWindow.h:139:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  bool open(QString filename, QString loader_name);
data/cgal-5.1.1/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.cpp:100:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  file.open(QIODevice::WriteOnly);
data/cgal-5.1.1/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.cpp:126:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  file.open(QIODevice::ReadOnly);
data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp:123:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      in.open(fileinfo.filePath().toUtf8(), std::ios_base::in);//not binary
data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp:760:17:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  message_box_->open();
data/cgal-5.1.1/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp:545:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  message_box->open();
data/cgal-5.1.1/demo/Polyhedron/Polyhedron_demo.cpp:138:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/Polyhedron/Scene_polylines_item.cpp:228:20:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
          unsigned char colors[3];
data/cgal-5.1.1/demo/Polyhedron/Use_ssh.cpp:407:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char buffer[256];
data/cgal-5.1.1/demo/Polyhedron/Viewer.cpp:1618:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    buffer.open(QIODevice::WriteOnly);
data/cgal-5.1.1/demo/Polyhedron/Viewer.cpp:1986:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      d->m_webSocket.open(QUrl(ws_url));
data/cgal-5.1.1/demo/Polyhedron/texture.cpp:611:3:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
  memcpy(m_pData,pData,height*m_WidthByte32);
data/cgal-5.1.1/demo/Polyhedron_IO/viewpoint2off.cpp:54:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[3];
data/cgal-5.1.1/demo/Polyhedron_IO/viewpoint2off.cpp:240:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            in.open( normals_filename);
data/cgal-5.1.1/demo/Polyhedron_IO/viewpoint2off.cpp:268:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[1]);
data/cgal-5.1.1/demo/Polyhedron_IO/viewpoint2off.cpp:274:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char  part_name[16000];
data/cgal-5.1.1/demo/Polyhedron_IO/viewpoint2off.cpp:302:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[2]);
data/cgal-5.1.1/demo/Polyhedron_IO/viewpoint2off.cpp:307:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/demo/Polyline_simplification_2/Polyline_simplification_2.cpp:118:6:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
void open(QString);
data/cgal-5.1.1/demo/Polyline_simplification_2/Polyline_simplification_2.cpp:209:61:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  connect(this, SIGNAL(openRecentFile(QString)), this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Polyline_simplification_2/Polyline_simplification_2.cpp:224:3:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  open(filename);
data/cgal-5.1.1/demo/Polyline_simplification_2/Polyline_simplification_2.cpp:337:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Polyline_simplification_2/Polyline_simplification_2.cpp:363:3:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  open(fileName);
data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.cpp:44:28:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.cpp:66:25:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                        open(filename);
data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.cpp:104:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
void MainWindow::open(QString filename)
data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.cpp:109:39:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                int index = m_pScene->open(filename);
data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.cpp:160:25:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                        open(filename);
data/cgal-5.1.1/demo/Principal_component_analysis/MainWindow.h:26:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                void open(QString filename);
data/cgal-5.1.1/demo/Principal_component_analysis/PCA_demo.cpp:46:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/Principal_component_analysis/Scene.cpp:34:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
int Scene::open(QString filename)
data/cgal-5.1.1/demo/Principal_component_analysis/Scene.h:44:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    int open(QString filename);
data/cgal-5.1.1/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp:90:15:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
 virtual void open(QString);
data/cgal-5.1.1/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp:183:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp:241:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp:271:3:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  open(fileName);
data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp:91:15:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
 virtual void open(QString);
data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp:191:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp:194:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(file_to_open);
data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp:254:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp:298:3:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  open(fileName);
data/cgal-5.1.1/demo/Snap_rounding_2/Snap_rounding_2.cpp:92:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Snap_rounding_2/Snap_rounding_2.cpp:167:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Snap_rounding_2/Snap_rounding_2.cpp:260:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Snap_rounding_2/Snap_rounding_2.cpp:266:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Spatial_searching_2/Spatial_searching_2.cpp:109:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Spatial_searching_2/Spatial_searching_2.cpp:182:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Spatial_searching_2/Spatial_searching_2.cpp:257:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Spatial_searching_2/Spatial_searching_2.cpp:264:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Stream_lines_2/Stream_lines_2.cpp:77:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Stream_lines_2/Stream_lines_2.cpp:122:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Stream_lines_2/Stream_lines_2.cpp:180:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Stream_lines_2/Stream_lines_2.cpp:186:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Surface_mesh_deformation/deform_mesh_for_botsch08_format.cpp:48:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(argv[2]);
data/cgal-5.1.1/demo/Surface_mesh_deformation/deform_mesh_for_botsch08_format.cpp:73:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(argv[3]);
data/cgal-5.1.1/demo/Surface_mesher/File_XT.h:25:10:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  *fin = fopen(filename, "rw");
data/cgal-5.1.1/demo/Surface_mesher/mainwindow.cpp:77:15:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  if(surface->open(filename)) {
data/cgal-5.1.1/demo/Surface_mesher/mainwindow.cpp:85:15:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  if(surface->open(filename)) {
data/cgal-5.1.1/demo/Surface_mesher/polyhedral_surface.cpp:259:26:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
bool Polyhedral_surface::open(const QString& filename)
data/cgal-5.1.1/demo/Surface_mesher/polyhedral_surface.h:68:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  bool open(const QString& filename);
data/cgal-5.1.1/demo/Surface_mesher/surface.h:23:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual bool open(const QString& filename) = 0;
data/cgal-5.1.1/demo/Surface_mesher/volume.cpp:522:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
bool Volume::open(const QString& filename)
data/cgal-5.1.1/demo/Surface_mesher/volume.h:200:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  bool open(const QString& filename);
data/cgal-5.1.1/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp:200:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  void open(QString);
data/cgal-5.1.1/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp:348:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp:506:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp:556:3:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  open(fileName);
data/cgal-5.1.1/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp:1005:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/Triangulation_2/Delaunay_triangulation_2.cpp:90:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString fileName);
data/cgal-5.1.1/demo/Triangulation_2/Delaunay_triangulation_2.cpp:188:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
          this, SLOT(open(QString)));
data/cgal-5.1.1/demo/Triangulation_2/Delaunay_triangulation_2.cpp:330:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open(fileName);
data/cgal-5.1.1/demo/Triangulation_2/Delaunay_triangulation_2.cpp:336:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
MainWindow::open(QString fileName)
data/cgal-5.1.1/demo/Triangulation_2/Delaunay_triangulation_2.cpp:434:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/Triangulation_2/Regular_triangulation_2.cpp:355:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    mainWindow.open(filename);
data/cgal-5.1.1/demo/Triangulation_3/MainWindow.cpp:218:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  about_CGAL.open(QIODevice::ReadOnly|QIODevice::Text);
data/cgal-5.1.1/demo/Triangulation_3/Scene.cpp:70:7:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  fin.open( filename );
data/cgal-5.1.1/demo/Triangulation_3/Scene.cpp:145:7:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  fin.open( filename );
data/cgal-5.1.1/demo/Triangulation_3/Scene.cpp:184:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  fout.open( filename );
data/cgal-5.1.1/demo/Triangulation_3/Scene.cpp:221:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  fout.open( filename );
data/cgal-5.1.1/examples/BGL_polyhedron_3/polyhedron_partition.cpp:14:36:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int number_of_parts = (argc>2) ? atoi(argv[2]) : 8;
data/cgal-5.1.1/examples/BGL_surface_mesh/surface_mesh_partition.cpp:15:36:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int number_of_parts = (argc>2) ? atoi(argv[2]) : 8;
data/cgal-5.1.1/examples/Boolean_set_operations_2/dxf_union.cpp:44:22:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    simplify = (std::atoi (argv[2]) != 0);
data/cgal-5.1.1/examples/Boolean_set_operations_2/dxf_union.cpp:47:25:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
      group_size = std::atoi (argv[3]);
data/cgal-5.1.1/examples/Boolean_set_operations_2/set_union.cpp:53:34:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  if (argc > 1) n_circles = std::atoi(argv[1]);
data/cgal-5.1.1/examples/Cone_spanners_2/compute_cones.cpp:20:20:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  unsigned int k = atoi(argv[1]);
data/cgal-5.1.1/examples/Cone_spanners_2/dijkstra_theta.cpp:40:20:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  unsigned int k = atoi(argv[1]);
data/cgal-5.1.1/examples/Cone_spanners_2/theta_io.cpp:34:20:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  unsigned int k = atoi(argv[1]);
data/cgal-5.1.1/examples/Convex_hull_2/ch_timing.cpp:34:39:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int iterations = (argc == 3) ? std::atoi( argv[2] ) : 10;
data/cgal-5.1.1/examples/Convex_hull_3/lloyd_algorithm.cpp:203:13:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
        N = atoi(argv[1]);
data/cgal-5.1.1/examples/Convex_hull_3/lloyd_algorithm.cpp:210:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
        steps = atoi(argv[2]);
data/cgal-5.1.1/examples/Hyperbolic_triangulation_2/ht2_example.cpp:25:9:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    N = atoi(argv[1]);
data/cgal-5.1.1/examples/Hyperbolic_triangulation_2/ht2_example_color.cpp:32:9:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    N = atoi(argv[1]);
data/cgal-5.1.1/examples/Jet_fitting_3/Mesh_estimation.cpp:196:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  out_4ogl.open(res4openGL_fname.c_str(), std::ios::out);
data/cgal-5.1.1/examples/Jet_fitting_3/Mesh_estimation.cpp:201:17:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    out_verbose.open(verbose_fname.c_str(), std::ios::out);
data/cgal-5.1.1/examples/Jet_fitting_3/Single_estimation.cpp:27:22:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    d_fitting = std::atoi(argv[2]);
data/cgal-5.1.1/examples/Jet_fitting_3/Single_estimation.cpp:28:20:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    d_monge = std::atoi(argv[3]);
data/cgal-5.1.1/examples/Linear_cell_complex/linear_cell_complex_3_attributes_management.cpp:59:29:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  if ( narg>2 ) { percent = atoi(argv[2]); }
data/cgal-5.1.1/examples/Mesh_3/mesh_implicit_ellipsoid.cpp:68:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  medit_file.open("out_optimized.mesh");
data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain.cpp:74:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  medit_file.open("out_2.mesh");
data/cgal-5.1.1/examples/Mesh_3/mesh_polyhedral_domain_sm.cpp:74:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  medit_file.open("out_2.mesh");
data/cgal-5.1.1/examples/Mesh_3/mesh_two_implicit_spheres_with_balls.cpp:99:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  medit_file.open("out-with-protection.mesh");
data/cgal-5.1.1/examples/Nef_3/nef_3_to_surface_mesh.cpp:96:7:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  out.open("out.off");
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_multi_domain.cpp:63:34:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int domain_size = (argc > 1) ? atoi(argv[1]) : 1;
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_multi_domain.cpp:64:49:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int number_of_copies_in_output = (argc > 2) ? atoi(argv[2]) : 4; // can be 1, 2, 4, or 8
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape.cpp:52:34:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int domain_size = (argc > 1) ? atoi(argv[1]) : 1;
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape.cpp:53:49:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int number_of_copies_in_output = (argc > 2) ? atoi(argv[2]) : 4; // can be 1, 2, 4, or 8
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape_with_features.cpp:83:49:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int number_of_copies_in_output = (argc > 1) ? atoi(argv[1]) : 8; // can be 1, 2, 4, or 8
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape_with_optimizers.cpp:56:34:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int domain_size = (argc > 1) ? atoi(argv[1]) : 1;
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape_with_optimizers.cpp:57:49:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int number_of_copies_in_output = (argc > 2) ? atoi(argv[2]) : 8; // can be 1, 2, 4, or 8
data/cgal-5.1.1/examples/Periodic_3_mesh_3/mesh_implicit_shape_with_subdomains.cpp:57:49:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  int number_of_copies_in_output = (argc > 1) ? atoi(argv[1]) : 4; // can be 1, 2, 4, or 8
data/cgal-5.1.1/examples/Periodic_4_hyperbolic_triangulation_2/p4ht2_example_insertion.cpp:24:9:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    N = atoi(argv[1]);
data/cgal-5.1.1/examples/Point_set_processing_3/normal_estimation.cpp:213:36:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
        nb_neighbors_pca_normals = atoi(argv[++i]);
data/cgal-5.1.1/examples/Point_set_processing_3/normal_estimation.cpp:216:44:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
        nb_neighbors_jet_fitting_normals = atoi(argv[++i]);
data/cgal-5.1.1/examples/Point_set_processing_3/normal_estimation.cpp:230:28:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
        nb_neighbors_mst = atoi(argv[++i]);
data/cgal-5.1.1/examples/Point_set_processing_3/registration_with_OpenGR.cpp:39:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(fname2);
data/cgal-5.1.1/examples/Point_set_processing_3/registration_with_opengr_pointmatcher_pipeline.cpp:42:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(fname2);
data/cgal-5.1.1/examples/Point_set_processing_3/registration_with_pointmatcher.cpp:42:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(fname2);
data/cgal-5.1.1/examples/Poisson_surface_reconstruction_3/tutorial_example.cpp:108:23:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    = (argc < 3 ? 0 : atoi(argv[2]));
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_LCC.cpp:40:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("mesh2_refined.off");
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_SM.cpp:26:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_SM.cpp:47:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("mesh2_refined.off");
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_consecutive_bool_op.cpp:78:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_difference_remeshed.cpp:45:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_mesh_union.cpp:26:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_mesh_union_and_intersection.cpp:27:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_mesh_union_with_attributes.cpp:58:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polygon_mesh_processing/corefinement_polyhedron_union.cpp:28:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polygon_mesh_processing/mesh_smoothing_example.cpp:41:56:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  const unsigned int nb_iterations = (argc > 2) ? std::atoi(argv[2]) : 10;
data/cgal-5.1.1/examples/Polygon_mesh_processing/orientation_pipeline_example.cpp:74:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(reference_filename);
data/cgal-5.1.1/examples/Polygon_mesh_processing/shape_smoothing_example.cpp:26:56:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  const unsigned int nb_iterations = (argc > 2) ? std::atoi(argv[2]) : 10;
data/cgal-5.1.1/examples/Polygon_mesh_processing/surface_mesh_intersection.cpp:33:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(filename2);
data/cgal-5.1.1/examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp:185:13:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
        n = atoi( argv[2]);
data/cgal-5.1.1/examples/Polyhedron_IO/iv2off.cpp:43:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char      str[2000];        // temporal storage for rest of identifier
data/cgal-5.1.1/examples/Polyhedron_IO/iv2off.cpp:195:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/iv2off.cpp:210:27:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
                n_block = atoi( argv[i]);
data/cgal-5.1.1/examples/Polyhedron_IO/iv2off.cpp:252:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/iv2off.cpp:266:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2iv.cpp:22:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/off2iv.cpp:55:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2iv.cpp:69:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2off.cpp:23:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/off2off.cpp:64:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2off.cpp:78:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2stl.cpp:30:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/off2stl.cpp:66:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2stl.cpp:91:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2vrml.cpp:24:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/off2vrml.cpp:60:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2vrml.cpp:74:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2wav.cpp:20:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/off2wav.cpp:53:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off2wav.cpp:67:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/off_bbox.cpp:23:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[1] = { NULL }; // stop compiler warning (too hard to rewrite the code to avoid it)
data/cgal-5.1.1/examples/Polyhedron_IO/off_bbox.cpp:61:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off_glue.cpp:46:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/off_glue.cpp:87:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off_glue.cpp:138:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/off_transform.cpp:33:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/off_transform.cpp:100:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/off_transform.cpp:122:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/polyhedron_copy.cpp:25:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/polyhedron_copy.cpp:63:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/polyhedron_copy.cpp:89:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Polyhedron_IO/terr_trian.cpp:54:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char *filename[2];
data/cgal-5.1.1/examples/Polyhedron_IO/terr_trian.cpp:98:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        in.open( filename[0]);
data/cgal-5.1.1/examples/Polyhedron_IO/terr_trian.cpp:116:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        out.open( filename[1]);
data/cgal-5.1.1/examples/Snap_rounding_2/snap_rounding_data.cpp:60:30:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                my_read_file.open(argv[1]);
data/cgal-5.1.1/examples/Snap_rounding_2/snap_rounding_data.cpp:62:30:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                my_read_file.open("data/snap_rounding_data");
data/cgal-5.1.1/examples/Snap_rounding_2/snap_rounding_data.cpp:72:31:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                my_write_file.open(argv[2]);
data/cgal-5.1.1/examples/Surface_mesh_deformation/all_roi_assign_example.cpp:93:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("deform_2.off");
data/cgal-5.1.1/examples/Surface_mesh_deformation/all_roi_assign_example_custom_polyhedron.cpp:148:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("deform_2.off");
data/cgal-5.1.1/examples/Surface_mesh_deformation/deform_mesh_for_botsch08_format_sre_arap.cpp:47:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(argv[2]);
data/cgal-5.1.1/examples/Surface_mesh_deformation/deform_mesh_for_botsch08_format_sre_arap.cpp:72:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  input.open(argv[3]);
data/cgal-5.1.1/examples/Surface_mesh_deformation/k_ring_roi_translate_rotate_Surface_mesh.cpp:99:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("deform_2.off");
data/cgal-5.1.1/examples/Surface_mesh_deformation/k_ring_roi_translate_rotate_example.cpp:104:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("deform_2.off");
data/cgal-5.1.1/examples/Surface_mesh_skeletonization/MCF_Skeleton_LCC_example.cpp:64:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("correspondance-lcc.cgal");
data/cgal-5.1.1/examples/Surface_mesh_skeletonization/MCF_Skeleton_example.cpp:68:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("correspondance-poly.cgal");
data/cgal-5.1.1/examples/Surface_mesh_skeletonization/MCF_Skeleton_sm_example.cpp:67:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("correspondance-sm.cgal");
data/cgal-5.1.1/examples/Surface_mesh_skeletonization/simple_mcfskel_LCC_example.cpp:69:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("correspondance-lcc.cgal");
data/cgal-5.1.1/examples/Surface_mesh_skeletonization/simple_mcfskel_example.cpp:72:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("correspondance-poly.cgal");
data/cgal-5.1.1/examples/Surface_mesh_skeletonization/simple_mcfskel_sm_example.cpp:51:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  output.open("correspondance-sm.cgal");
data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp:19:40:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  const std::size_t nbv = (argc > 2) ? atoi(argv[2]) : 1000;
data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp:32:40:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  const std::size_t nbv = (argc > 2) ? atoi(argv[2]) : 1000;
data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp:75:36:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  const int nb_iter = (argc > 2) ? atoi(argv[2]) : 1;
data/cgal-5.1.1/examples/Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp:76:32:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  const int nbv = (argc > 3) ? atoi(argv[3]) : 500;
data/cgal-5.1.1/examples/Triangulation/convex_hull.cpp:22:9:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    N = atoi(argv[1]);
data/cgal-5.1.1/include/CGAL/Algebraic_kernel_d/Real_embeddable_extension.h:109:12:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    signed char floor_log2_4bit[16];
data/cgal-5.1.1/include/CGAL/Arr_dcel_base.h:81:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char pss[2];  // The x and y parameter spaces (condensed in two bytes).
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:82:11:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  typedef char debug_string[256];
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:195:11:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  typedef char debug_string[256];
data/cgal-5.1.1/include/CGAL/CORE/BigFloat_impl.h:1012:11:  [2] (integer) atol:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    e10 = atol(e+1);    // e10 is decimal precision of the input string
data/cgal-5.1.1/include/CGAL/CORE/BigFloat_impl.h:1102:7:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      memcpy(str, t, size);
data/cgal-5.1.1/include/CGAL/CORE/BigFloat_impl.h:1128:5:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    memcpy(str, t, len);
data/cgal-5.1.1/include/CGAL/CORE/CoreAux_impl.h:159:8:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
  std::sprintf(buffer, "%d", n);
data/cgal-5.1.1/include/CGAL/CORE/CoreAux_impl.h:200:6:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
     char buf[65];
data/cgal-5.1.1/include/CGAL/CORE/CoreIO_impl.h:262:17:  [2] (integer) atol:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  length = std::atol(buffer);
data/cgal-5.1.1/include/CGAL/CORE/CoreIO_impl.h:315:17:  [2] (integer) atol:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  length = std::atol(buffer);
data/cgal-5.1.1/include/CGAL/CORE/CoreIO_impl.h:321:19:  [2] (integer) atol:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
  exponent = std::atol(buffer);
data/cgal-5.1.1/include/CGAL/CORE/Real_impl.h:136:16:  [2] (integer) atol:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    e10 = std::atol(e+1);        // e10 is decimal precision of the input string
data/cgal-5.1.1/include/CGAL/CORE/Real_impl.h:236:12:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      std::memcpy(str, t, size);
data/cgal-5.1.1/include/CGAL/CORE/Real_impl.h:266:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    std::memcpy(str, t, len);
data/cgal-5.1.1/include/CGAL/Concurrent_compact_container.h:50:13:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    typedef char ArrayOfOne[1];                                               \
data/cgal-5.1.1/include/CGAL/Concurrent_compact_container.h:51:13:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    typedef char ArrayOfTwo[2];                                               \
data/cgal-5.1.1/include/CGAL/Constrained_triangulation_2.h:1577:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char c[3];
data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h:93:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy(this, &pix, sizeof(int)*3 + sizeof(double)*2);
data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h:95:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy(this, &pix, sizeof(int)*3);
data/cgal-5.1.1/include/CGAL/FPU.h:250:8:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
  std::memcpy(&x, (void*)&e, 16);
data/cgal-5.1.1/include/CGAL/Has_conversion.h:58:20:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  typedef struct { char arr[2]; } two;
data/cgal-5.1.1/include/CGAL/Has_member.h:25:13:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    typedef char ArrayOfOne[1];                                               \
data/cgal-5.1.1/include/CGAL/Has_member.h:26:13:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    typedef char ArrayOfTwo[2];                                               \
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:300:5:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    open (filename, rect, width, height);
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:333:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  bool open (const char *filename,
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:351:12:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    _ofile.open (filename);
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:753:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char    color_desc [10];
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:1703:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char    oct[10];
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:1716:9:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
        sprintf (oct, "\\%03o", text[i]);
data/cgal-5.1.1/include/CGAL/IO/File_header_OFF_impl.h:244:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char keyword[max_keyword] = "";
data/cgal-5.1.1/include/CGAL/IO/File_header_OFF_impl.h:252:30:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
        h.set_vertices( std::atoi( keyword));
data/cgal-5.1.1/include/CGAL/IO/File_header_extended_OFF_impl.h:177:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char keyword[max_keyword] = "";
data/cgal-5.1.1/include/CGAL/IO/File_scanner_OFF.h:543:18:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        unsigned char rgb[3];
data/cgal-5.1.1/include/CGAL/IO/File_scanner_OFF.h:564:57:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
                rgb[index] = static_cast<unsigned char>(atoi(color_info.c_str()));
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream.h:568:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char sexpr[1024];
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:145:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char inbuf[10];
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:173:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char inbuf[10];
data/cgal-5.1.1/include/CGAL/IO/Inventor_ostream.h:38:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    void open(std::ostream& o)        { m_os = &o; }
data/cgal-5.1.1/include/CGAL/IO/Inventor_ostream.h:67:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    void open(std::ostream& o) {
data/cgal-5.1.1/include/CGAL/IO/Inventor_ostream.h:68:32:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        Inventor_ostream_base::open(o);
data/cgal-5.1.1/include/CGAL/IO/PLY.h:207:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char uChar[sizeof (Type)];
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:320:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char word[5];
data/cgal-5.1.1/include/CGAL/IO/VRML_1_ostream.h:41:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    void open(std::ostream& o) {
data/cgal-5.1.1/include/CGAL/IO/VRML_1_ostream.h:42:32:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        Inventor_ostream_base::open(o);
data/cgal-5.1.1/include/CGAL/IO/VRML_2_ostream.h:32:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    void open(std::ostream& o)   { m_os = &o; header(); }
data/cgal-5.1.1/include/CGAL/IO/read_las_points.h:386:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  lasreader.open(stream);
data/cgal-5.1.1/include/CGAL/IO/write_las_points.h:225:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  laswriter.open (stream, &header);
data/cgal-5.1.1/include/CGAL/ImageIO.h:196:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char fileExtension[IMAGE_FORMAT_NAME_LENGTH];
data/cgal-5.1.1/include/CGAL/ImageIO.h:199:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char realName[IMAGE_FORMAT_NAME_LENGTH];
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:53:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char data_type[10];                     /* 4 + 10    */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:54:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char db_name[18];                       /* 14 + 18   */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:64:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char vox_units[4];                      /* 16 + 4    */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:65:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char cal_units[8];                      /* 20 + 4    */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:91:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char descrip[80];                       /* 0 + 80    */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:92:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char aux_file[24];                      /* 80 + 24   */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:94:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char originator[10];                    /* 105 + 10  */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:95:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char generated[10];                     /* 115 + 10  */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:96:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char scannum[10];                       /* 125 + 10  */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:97:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char patient_id[10];                    /* 135 + 10  */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:98:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char exp_date[10];                      /* 145 + 10  */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:99:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char exp_time[10];                      /* 155 + 10  */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:100:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char hist_un0[3];                       /* 165 + 3   */
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:196:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".hdr,.hdr.gz,.img,.img.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:197:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"Analyze");
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:235:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".hdr.gz" );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:237:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".hdr" );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:261:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".img.gz" );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:264:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".img" );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:466:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "Data lost in the Analyze -> ImageIO conversion:" );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:475:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  orient: %d", analyzeHeader->hist.orient );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:497:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  views: %d", analyzeHeader->hist.views );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:500:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  vols_added: %d", analyzeHeader->hist.vols_added );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:503:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  start_field: %d", analyzeHeader->hist.start_field );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:506:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  field_skip: %d", analyzeHeader->hist.field_skip );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:509:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  omax: %d", analyzeHeader->hist.omax );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:512:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  omin: %d", analyzeHeader->hist.omin );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:515:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  smax: %d", analyzeHeader->hist.smax );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:518:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf( im->user[i++], "  smin: %d", analyzeHeader->hist.smin );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:538:9:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
        strcpy(data_filename+length-3, "img.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:544:11:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
          strcpy(data_filename+length-3, "img");
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:755:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy(hdr.dime.vox_units,"mm.");
data/cgal-5.1.1/include/CGAL/ImageIO/bmp_impl.h:66:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".bmp");
data/cgal-5.1.1/include/CGAL/ImageIO/bmp_impl.h:67:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"BMP");
data/cgal-5.1.1/include/CGAL/ImageIO/bmp_impl.h:114:10:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    fp = fopen(name, "rb");
data/cgal-5.1.1/include/CGAL/ImageIO/bmpread_impl.h:660:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(&temp, image+(row * width + col), sizeof(RGB));
data/cgal-5.1.1/include/CGAL/ImageIO/bmpread_impl.h:661:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(image+(row * width + col),
data/cgal-5.1.1/include/CGAL/ImageIO/bmpread_impl.h:663:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(image+((height - row - 1) * width + col), &temp,
data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h:79:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      (void)memcpy( bufferOut, bufferIn, bufferLength * sizeof(s8) );
data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h:116:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      (void)memcpy( bufferOut, bufferIn, bufferLength * sizeof(u8) );
data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h:159:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      (void)memcpy( bufferOut, bufferIn, bufferLength * sizeof(s16) );
data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h:203:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      (void)memcpy( bufferOut, bufferIn, bufferLength * sizeof(u16) );
data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h:240:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      (void)memcpy( bufferOut, bufferIn, bufferLength * sizeof(s32) );
data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h:301:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      (void)memcpy( bufferOut, bufferIn, bufferLength * sizeof(r32) );
data/cgal-5.1.1/include/CGAL/ImageIO/convert_impl.h:361:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
      (void)memcpy( bufferOut, bufferIn, bufferLength * sizeof(r64) );
data/cgal-5.1.1/include/CGAL/ImageIO/gif_impl.h:111:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".gif");
data/cgal-5.1.1/include/CGAL/ImageIO/gif_impl.h:112:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"Gif");
data/cgal-5.1.1/include/CGAL/ImageIO/gif_impl.h:170:7:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
 fp = fopen(name,"rb");
data/cgal-5.1.1/include/CGAL/ImageIO/gif_impl.h:172:8:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  fp = fopen(name,"r");
data/cgal-5.1.1/include/CGAL/ImageIO/gif_impl.h:174:8:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  fp = fopen(name,"rb");
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:35:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".dim,.dim.gz,.ima,.ima.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:36:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"Gis");
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:64:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".dim.gz" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:66:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".dim" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:89:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".ima.gz" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:92:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy( outputName+length-extLength, ".ima" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:133:17:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:153:17:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:181:17:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:201:17:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:484:5:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
    strcpy(data_filename+length-3, "ima.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:490:7:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
      strcpy(data_filename+length-3, "ima");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:70:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char type[30], endianness[5], buf[257], scale[20];
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:80:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf(type, "float");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:87:9:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
        sprintf(type, "signed fixed");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:90:9:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
        sprintf(type, "unsigned fixed");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:95:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf(scale, "SCALE=2**0\n");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:104:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf(endianness, "decm");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:107:7:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
      sprintf(endianness, "sun");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:112:9:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
        sprintf(endianness, "decm");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:114:9:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
        sprintf(endianness, "sun");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:175:5:  [2] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused). Risk is low because the
  source is a constant string.
    strcat(buf, "##}\n");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:227:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char str[257];
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:429:3:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
  memcpy(el->string, str,  strlen(str)+1);
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:502:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".inr,.inr.gz,.gradient,.gradient.gz,.gradient_direction,.gradient_direction.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:503:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"Inrimage");
data/cgal-5.1.1/include/CGAL/ImageIO/iris_impl.h:80:18:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  if((((unsigned char *)magic)[0]<<8) + ((unsigned char *)magic)[1]
data/cgal-5.1.1/include/CGAL/ImageIO/iris_impl.h:80:52:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  if((((unsigned char *)magic)[0]<<8) + ((unsigned char *)magic)[1]
data/cgal-5.1.1/include/CGAL/ImageIO/iris_impl.h:94:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".rgb");
data/cgal-5.1.1/include/CGAL/ImageIO/iris_impl.h:95:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"IRIS");
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:48:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char sign_type[MI_MAX_ATTSTR_LEN], name[MAX_NC_NAME];
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:307:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy((unsigned char *) data +
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:337:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char *dim_names[3] = { MIzspace, MIyspace, MIxspace }, *history,
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:356:9:  [2] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused). Risk is low because the
  source is a constant string.
        strcat(newname, "#TMP#");
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:73:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".pgm,.pgm.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:74:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"Pgm");
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:85:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".pgm,.pgm.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:86:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"Pgm-ASCII");
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:97:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->fileExtension,".ppm,.ppm.gz");
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:98:3:  [2] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant string.
  strcpy(f->realName,"Ppm");
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:149:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char string[256];
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:307:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char string[256];
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:451:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char string[256];
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:502:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char string[256];
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:532:3:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
  sprintf( string, "# CREATOR: pnm.c $Revision$ $Date$\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:534:3:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
  sprintf( string, "%zu %zu\n", im->xdim, im->ydim );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:555:3:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
  sprintf( string, "%d\n", max );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:577:13:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
            sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:594:13:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
            sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/recbuffer_impl.h:1406:15:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        (void)memcpy( (void*)dbl_pt1, (void*)r64firstPoint, dimx * sizeof(r64) );
data/cgal-5.1.1/include/CGAL/ImageIO/recbuffer_impl.h:1441:15:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        (void)memcpy( (void*)r64firstPointResult, (void*)dbl_pt1, dimx * sizeof(r64) );
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:435:16:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      im->fd = fopen(name, "rb");
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:514:32:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      im->fd = (_ImageIO_file) fopen(name, "wb");
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:549:14:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    unsigned char uc[2];
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:922:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char ext[IMAGE_FORMAT_NAME_LENGTH];
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1055:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char magic[5];
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1161:12:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  unsigned char *ptr1, *ptr2, b[8];
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1452:3:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  char magic[5];
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1466:9:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    f = fopen(fileName, "rb");
data/cgal-5.1.1/include/CGAL/Lazy_kernel.h:49:20:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  typedef struct { char arr[2]; } two;
data/cgal-5.1.1/include/CGAL/Memory_sizer.h:108:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char name[1024];
data/cgal-5.1.1/include/CGAL/Nef_2/Polynomial.h:1783:19:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
            const char buffer[11] = "olynomial(";
data/cgal-5.1.1/include/CGAL/Qt/DemosMainWindow.h:58:16:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  virtual void open(QString)
data/cgal-5.1.1/include/CGAL/Qt/DemosMainWindow_impl.h:108:11:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    this->open(filename);
data/cgal-5.1.1/include/CGAL/Qt/DemosMainWindow_impl.h:258:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  about_CGAL.open(QIODevice::ReadOnly);
data/cgal-5.1.1/include/CGAL/Qt/qglviewer_impl.h:3617:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  if (f.open(QIODevice::WriteOnly)) {
data/cgal-5.1.1/include/CGAL/Qt/qglviewer_impl.h:3675:9:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  if (f.open(QIODevice::ReadOnly)) {
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:295:10:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
      in.open(filename.c_str(), std::ios::binary);
data/cgal-5.1.1/include/CGAL/Triangulation_utils_3.h:28:16:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
  static const char tab_next_around_edge[4][4];
data/cgal-5.1.1/include/CGAL/boost/graph/internal/Has_member_id.h:21:13:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    typedef char yes[1];
data/cgal-5.1.1/include/CGAL/boost/graph/internal/Has_member_id.h:22:13:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    typedef char no[2];
data/cgal-5.1.1/include/CGAL/draw_nef_3.h:257:11:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    const char *argv[2] = {"nef_polyhedron_viewer", "\0"};
data/cgal-5.1.1/include/CGAL/draw_voronoi_diagram_2.h:320:11:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    const char *argv[2] = {"voronoi_2_viewer", "\0"};
data/cgal-5.1.1/include/CGAL/gnuplot_output_2.h:149:8:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
    fs.open((prefix + ".plt").c_str(),
data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoWindow.cpp:428:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    CGAL::read( *seg, ifs, arrFormatter );
data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoWindow.cpp:441:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    CGAL::read( *pol, ifs, arrFormatter );
data/cgal-5.1.1/demo/Arrangement_on_surface_2/ArrangementDemoWindow.cpp:454:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    CGAL::read( *conic, ifs, arrFormatter );
data/cgal-5.1.1/demo/Polyhedron/MainWindow.cpp:2899:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    f.read(buffer,size);
data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp:316:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    CGAL::read( is, s );
data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp:320:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read( is, v.ref_1 );
data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp:321:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read( is, v.ref_2 );
data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp:365:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read( is, c.constrained_facet[li] );
data/cgal-5.1.1/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp:1019:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
     !image->read(fileinfo.filePath().toUtf8()))
data/cgal-5.1.1/demo/Polyhedron/Use_ssh.cpp:274:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if (!file.read(buffer.data(), size))
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/IO/read_surf_trianglemesh.h:72:32:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    return (line.compare(fnws, strlen(cstr), cstr) == 0);
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/IO/read_surf_trianglemesh.h:284:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    is.read(reinterpret_cast<char*>(&f[0]), sizeof(f[0]));
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/IO/read_surf_trianglemesh.h:287:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    is.read(reinterpret_cast<char*>(&f[1]), sizeof(f[1]));
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/IO/read_surf_trianglemesh.h:290:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    is.read(reinterpret_cast<char*>(&f[2]), sizeof(f[2]));
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/IO/read_surf_trianglemesh.h:307:10:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      is.read(reinterpret_cast<char*>(&tr[i]), sizeof(tr[i]));
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/IO/read_surf_trianglemesh.h:326:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    is.read(reinterpret_cast<char*>(&id), sizeof(int));
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/gocad_io.h:35:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, meshPoints, mesh);
data/cgal-5.1.1/demo/Polyhedron/include/CGAL/gocad_io.h:51:3:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  read(std::istream& input, Points_3& points, Surface& surface, int offset = 0)
data/cgal-5.1.1/demo/Surface_mesher/volume.cpp:540:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    if(m_image.read(filename.toStdString().c_str()))
data/cgal-5.1.1/examples/Arrangement_on_surface_2/dcel_extension_io.cpp:129:3:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  read (arr2, in_file, formatter);
data/cgal-5.1.1/examples/Boolean_set_operations_2/bezier_traits_adapter.cpp:89:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (equal(p_0, B.control_point(B.number_of_control_points() - 1))) {
data/cgal-5.1.1/examples/Box_intersection_d/box_grid.cpp:40:40:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    assert(result.size() == 13 && std::equal(check1,check1+13,result.begin()));
data/cgal-5.1.1/examples/Box_intersection_d/box_grid.cpp:54:39:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    assert(result.size() == 2 && std::equal(check2, check2+2, result.begin()));
data/cgal-5.1.1/examples/Box_intersection_d/custom_box_grid.cpp:55:39:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    assert( result.size()==13 && std::equal(chk,chk+13,result.begin()));
data/cgal-5.1.1/examples/Kernel_23/MyPointC2_iostream.h:32:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read(is, x);
data/cgal-5.1.1/examples/Kernel_23/MyPointC2_iostream.h:33:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read(is, y);
data/cgal-5.1.1/examples/Kernel_23/MyPointC2_iostream.h:34:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read(is, c);
data/cgal-5.1.1/examples/Mesh_3/mesh_3D_gray_image.cpp:34:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!image.read(fname)){
data/cgal-5.1.1/examples/Mesh_3/mesh_3D_gray_image_multiple_values.cpp:48:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!image.read(fname)){
data/cgal-5.1.1/examples/Mesh_3/mesh_3D_image.cpp:37:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!image.read(fname)){
data/cgal-5.1.1/examples/Mesh_3/mesh_3D_image_variable_size.cpp:42:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!image.read(fname)){
data/cgal-5.1.1/examples/Mesh_3/mesh_3D_image_with_features.cpp:78:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!image.read(fname)){
data/cgal-5.1.1/examples/Mesh_3/mesh_optimization_example.cpp:37:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!image.read(fname)){
data/cgal-5.1.1/examples/Mesh_3/mesh_optimization_lloyd_example.cpp:37:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!image.read(fname)){
data/cgal-5.1.1/examples/STL_Extension/in_place_list_prog.cpp:33:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool ok = std::equal(l.begin(), l.end(), a);
data/cgal-5.1.1/examples/STL_Extension/in_place_list_prog.cpp:39:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ok = std::equal(l.begin(), l.end(), b);
data/cgal-5.1.1/include/CGAL/Apollonius_graph_2.h:1091:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(const Edge& e1, const Edge& e2) const {
data/cgal-5.1.1/include/CGAL/Apollonius_graph_2.h:1183:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      } while ( !equal(e, e_front) );
data/cgal-5.1.1/include/CGAL/Arr_algebraic_segment_traits_2.h:248:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                if(equal(p,curr_point)) {
data/cgal-5.1.1/include/CGAL/Arr_algebraic_segment_traits_2.h:310:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                     !equal(start.get(),right(it_seg))) {
data/cgal-5.1.1/include/CGAL/Arr_algebraic_segment_traits_2.h:311:61:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                  if(it_seg.is_finite(CGAL::ARR_MIN_END) && equal(start.get(),left(it_seg))) {
data/cgal-5.1.1/include/CGAL/Arr_algebraic_segment_traits_2.h:322:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                   ! equal(left(it_seg),end.get())) {
data/cgal-5.1.1/include/CGAL/Arr_algebraic_segment_traits_2.h:323:63:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                    if(it_seg.is_finite(CGAL::ARR_MAX_END) && equal(end.get(),right(it_seg))) {
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1663:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (equal(l1, l2)) {
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1670:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool l1_eq_start = equal(l1, start);
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1671:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool l2_eq_start = equal(l2, start);
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1675:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (l1_eq_start && equal(r2, start))
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1678:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (equal(r1, l2)) {
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1689:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (l2_eq_start && equal(r1, start))
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1692:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (equal(r2, l1)) {
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1944:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        return equal(xc1_left, xc2_left);
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1954:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (!equal(normal1, normal2) && !equal(opposite_normal1, normal2))
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1954:40:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (!equal(normal1, normal2) && !equal(opposite_normal1, normal2))
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1957:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool eq1 = equal(xc1_right, xc2_left);
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:1958:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool eq2 = equal(xc1_left, xc2_right);
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:2025:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool eq1 = equal(xc1_right, xc2_left);
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:2030:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool eq2 = equal(xc1_left, xc2_right);
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:2052:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          CGAL_assertion(equal(xc1_left, xc2_right));
data/cgal-5.1.1/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h:2066:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          CGAL_assertion(equal(xc1_left, xc2_right));
data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Arr_plane_3.h:104:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(Self plane) const
data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h:1334:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (equal (l1, l2))
data/cgal-5.1.1/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h:1340:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return (equal (l1, l2));
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:595:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_precondition(!equal(src, tgt));
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:911:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (! equal(cv1.supp_line(), cv2.supp_line()) &&
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:912:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          ! equal(cv1.supp_line(),
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:921:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          (cv1.has_left() && ! equal(cv1.left(), cv2.left())))
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:929:37:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
              (! cv1.has_right() || equal (cv1.right(), cv2.right())));
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:1433:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (! equal(cv1.supp_line(), cv2.supp_line()) &&
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:1434:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          ! equal(cv1.supp_line(),
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:1441:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
               equal(cv1.right(), cv2.left())) ||
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:1443:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
               equal(cv2.right(), cv1.left())));
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:1487:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          equal(cv1.right(), cv2.left()))
data/cgal-5.1.1/include/CGAL/Arr_linear_traits_2.h:1497:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                          equal(cv2.right(), cv1.left()));
data/cgal-5.1.1/include/CGAL/Arr_non_caching_segment_traits_2.h:301:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (! equal(max_vertex(cv1), min_vertex(cv2)) &&
data/cgal-5.1.1/include/CGAL/Arr_non_caching_segment_traits_2.h:302:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          ! equal(max_vertex(cv2), min_vertex(cv1)))
data/cgal-5.1.1/include/CGAL/Arr_non_caching_segment_traits_2.h:355:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (equal(right1, left2)) {
data/cgal-5.1.1/include/CGAL/Arr_non_caching_segment_traits_2.h:361:25:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_precondition(equal(right2, left1));
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_landmarks_pl_impl.h:79:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (equal(p, iso_verts_it->point())) {
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_naive_point_location_impl.h:43:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (equal(p, vh->point()))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_simple_point_location_impl.h:41:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (equal(p, vh->point()))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_triangulation_pl_functions.h:51:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (equal (p, iso_verts_it->point())) {
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_triangulation_pl_functions.h:181:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (equal (p, iso_verts_it->point())) {
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_triangulation_pl_impl.h:67:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (equal (p, iso_verts_it->point()))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_triangulation_pl_impl.h:199:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (equal (p, iso_verts_it->point())) {
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h:67:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            equal (p, closest_he->source()->point()))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h:74:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                 equal (p, closest_he->target()->point()))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h:132:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                equal (p, closest_he->source()->point()))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h:139:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                     equal (p, closest_he->target()->point()))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h:186:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (equal(p, iso_verts_it->point())) {
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h:595:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
             ! equal(curr->source()->point(), p)) &&
data/cgal-5.1.1/include/CGAL/Arr_point_location/Arr_walk_along_line_pl_impl.h:597:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
             ! equal(curr->target()->point(), p)))
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:933:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_precondition(equal(Curve_end(he,ARR_MIN_END), p) ||
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:934:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                      equal(Curve_end(he,ARR_MAX_END), p));
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:936:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return equal(Curve_end(he,ARR_MIN_END), p);
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:944:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_precondition(equal(Curve_end(he,ARR_MIN_END), ce) ||
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:945:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                      equal(Curve_end(he,ARR_MAX_END), ce));
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:954:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return equal(Curve_end(he,ARR_MIN_END), ce);
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:963:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_precondition(equal(Curve_end(cv,ARR_MIN_END), p) ||
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:964:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                      equal(Curve_end(cv,ARR_MAX_END), p));
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:966:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return equal(Curve_end(cv,ARR_MIN_END), p);
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:1060:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return equal(t,
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h:1065:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return equal(t,
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:97:18:  [1] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused). Risk is low because the
  source is a constant character.
            std::strcat(name[i],"=");
data/cgal-5.1.1/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_iostream.h:210:18:  [1] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused). Risk is low because the
  source is a constant character.
            std::strcat(name[i],"=");
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:687:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          if (equal(p, max_vertex(xs2))) return EQUAL;
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:688:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          if (equal(p, min_vertex(xs2))) return EQUAL;
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:696:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          if (equal(p, max_vertex(xs2))) return EQUAL;
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:697:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          if (equal(p, min_vertex(xs2))) return EQUAL;
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:931:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool res = equal(xpoly_min_v(cv1), xpoly_min_v(cv2));
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:933:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      res = equal(xpoly_max_v(cv1), xpoly_max_v(cv2));
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:974:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool res = equal(point1, point2);
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:1190:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
         CGAL_precondition_msg(!equal(get_min_v(seg),get_max_v(seg)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:1281:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
         (next != end) || !equal(get_max_v(*curr),get_min_v(*curr)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:1292:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
             (!equal(get_min_v(*next),get_max_v(*next)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:1303:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                equal(get_max_v(*curr),get_min_v(*next)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:1310:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                equal(get_min_v(*curr),get_max_v(*next)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2004:35:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                 !equal(get_min_v(seg), get_max_v(seg)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2009:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_max_v(xcv[num_seg-1]),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2015:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_min_v(xcv[num_seg-1]),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2113:35:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                 !equal(get_min_v(seg), get_max_v(seg)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2120:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_max_v(xcv[num_seg-1]),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2128:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_min_v(xcv[num_seg-1]),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2200:35:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                 !equal(get_min_v(seg), get_max_v(seg)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2204:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_min_v(xcv[0]), get_max_v(seg)))),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2209:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_max_v(xcv[0]), get_min_v(seg)))),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2285:35:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                 !equal(get_min_v(seg), get_max_v(seg)),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2292:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_min_v(xcv[0]), get_max_v(seg)))),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2299:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                                   equal(get_max_v(xcv[0]), get_min_v(seg)))),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2736:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        (is_vert(cv[0]) && equal(get_min_v(cv[i]), q))){
data/cgal-5.1.1/include/CGAL/Arr_polycurve_basic_traits_2.h:2753:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        (is_vert(cv[0]) && equal(get_max_v(cv[i]), q)))
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:283:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
           equal(last_target, next_src),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:422:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
           equal(last_target, next_src),
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:589:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_precondition((! equal(m_poly_traits.
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:591:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_precondition((! equal(m_poly_traits.
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:613:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (equal(max_vertex(xcv[i]), p)) {
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:617:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        else if (equal(min_vertex(xcv[i]), p)) {
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:633:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (equal(min_vertex(xcv[i]), p)) {
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:636:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        else if (equal(max_vertex(xcv[i]), p)) {
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:747:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (equal(max_vertex(cv1[i1]), min_vertex(cv2[i2]))) {
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:770:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (equal(max_vertex(cv2[i2]), min_vertex(cv1[i1]))) {
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:879:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
              if (! equal(p_ptr->first, max_vertex(cv1[i1])))
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:1062:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                ((equal(max_vertex(cv1),min_vertex(cv2))) ||
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:1063:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                 (equal(max_vertex(cv2),min_vertex(cv1))))) ||
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:1066:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                ((equal(min_vertex(cv1),max_vertex(cv2))) ||
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:1067:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                 (equal(max_vertex(cv1),min_vertex(cv2))))
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:1120:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
           (equal(get_max_v(cv1),get_min_v(cv2)))) ||
data/cgal-5.1.1/include/CGAL/Arr_polycurve_traits_2.h:1123:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
           (equal(get_min_v(cv1), get_max_v(cv2)))))
data/cgal-5.1.1/include/CGAL/Arr_polyline_traits_2.h:429:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CGAL_precondition_msg(!equal(*curr,*next),
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:592:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return (equal(cv1.left(), cv2.left()) &&
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:593:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
              equal(cv1.right(), cv2.right()));
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:818:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (! equal(cv1.right(), cv2.left()) &&
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:819:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          ! equal(cv2.right(), cv1.left()))
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:823:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return (equal(cv1.line(), cv2.line()) ||
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:824:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
              equal(cv1.line(),
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:867:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (equal(cv1.right(), cv2.left())) {
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:874:25:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_precondition(equal(cv2.right(), cv1.left()));
data/cgal-5.1.1/include/CGAL/Arr_segment_traits_2.h:963:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_precondition(!equal(src, tgt));
data/cgal-5.1.1/include/CGAL/Arr_tracing_traits_2.h:418:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      std::cout << "  result: " << equal << std::endl;
data/cgal-5.1.1/include/CGAL/Arr_tracing_traits_2.h:419:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return equal;
data/cgal-5.1.1/include/CGAL/Arr_tracing_traits_2.h:434:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      std::cout << "  result: " << equal << std::endl;
data/cgal-5.1.1/include/CGAL/Arr_tracing_traits_2.h:435:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return equal;
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h:252:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (equal(left1, left2))
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h:5480:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (equal(points_vec[i-1], points_vec[i])) return false;
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h:1277:25:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  if (m_has_right_pt && equal(m_intersect_p, m_right_pt)) {
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h:1301:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        equal(m_intersect_p, m_intersect_he->source()->point()))
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h:1308:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
             equal(m_intersect_p, m_intersect_he->target()->point()))
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h:1406:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_assertion(equal(m_left_pt, inserted_he->target()->point()));
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h:1520:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        equal(cv_right_pt, he_right_v->point()))
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h:1544:45:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      (cv_has_right_pt && m_has_right_pt && equal(cv_right_pt, m_right_pt)) ||
data/cgal-5.1.1/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h:1575:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_assertion(equal(m_left_pt, updated_he->target()->point()));
data/cgal-5.1.1/include/CGAL/Bbox_2.h:213:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, xmin);
data/cgal-5.1.1/include/CGAL/Bbox_2.h:214:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, ymin);
data/cgal-5.1.1/include/CGAL/Bbox_2.h:215:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, xmax);
data/cgal-5.1.1/include/CGAL/Bbox_2.h:216:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, ymax);
data/cgal-5.1.1/include/CGAL/Bbox_3.h:252:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, xmin);
data/cgal-5.1.1/include/CGAL/Bbox_3.h:253:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, ymin);
data/cgal-5.1.1/include/CGAL/Bbox_3.h:254:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, zmin);
data/cgal-5.1.1/include/CGAL/Bbox_3.h:255:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, xmax);
data/cgal-5.1.1/include/CGAL/Bbox_3.h:256:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, ymax);
data/cgal-5.1.1/include/CGAL/Bbox_3.h:257:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, zmax);
data/cgal-5.1.1/include/CGAL/CORE/BigFloat_impl.h:1015:15:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    e = str + strlen(str);
data/cgal-5.1.1/include/CGAL/CORE/CoreIO_impl.h:276:29:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  std::size_t length = std::strlen(buffer);
data/cgal-5.1.1/include/CGAL/CORE/CoreIO_impl.h:338:29:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  std::size_t length = std::strlen(buffer);
data/cgal-5.1.1/include/CGAL/CORE/Real_impl.h:139:20:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    e = str + std::strlen(str);
data/cgal-5.1.1/include/CGAL/Cartesian/Weighted_point_2.h:106:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, w);
data/cgal-5.1.1/include/CGAL/Cartesian/Weighted_point_3.h:106:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, w);
data/cgal-5.1.1/include/CGAL/Cartesian/function_objects.h:544:45:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_kernel_precondition_code(Equal_2 equal;)
data/cgal-5.1.1/include/CGAL/Cartesian/function_objects.h:545:38:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          CGAL_kernel_precondition(! equal(a,b));
data/cgal-5.1.1/include/CGAL/Cartesian/function_objects.h:3934:45:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_kernel_precondition_code(Equal_2 equal;)
data/cgal-5.1.1/include/CGAL/Cartesian/function_objects.h:3935:34:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      CGAL_kernel_precondition(! equal(a,b));
data/cgal-5.1.1/include/CGAL/Circle_2.h:274:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, squared_radius);
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h:375:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return CircularFunctors::equal<CK>(p0, p1); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h:379:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return CircularFunctors::equal<CK>(a0, a1); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h:383:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return CircularFunctors::equal<CK>(a0, a1); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h:327:3:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  equal(const typename CK::Circular_arc_point_2 &p0,
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h:336:3:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  equal(const typename CK::Circular_arc_2 &A1,
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h:347:31:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return (CircularFunctors::equal<CK>(A1.source(), A2.source()) &&
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h:348:31:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CircularFunctors::equal<CK>(A1.target(), A2.target()));
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h:43:3:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  equal(const typename CK::Line_arc_2 &A1,
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h:50:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return ( (equal<CK>(A1.source(), A2.source()) &&
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h:51:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
              equal<CK>(A1.target(), A2.target())) ||
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h:52:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
             (equal<CK>(A1.target(), A2.source()) &&
data/cgal-5.1.1/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h:53:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
              equal<CK>(A1.source(), A2.target())) );
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h:246:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return SphericalFunctors::equal<SK>(c0, c1); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h:251:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return SphericalFunctors::equal<SK>(c0, Circular_arc_point_3(c1)); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h:256:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return SphericalFunctors::equal<SK>(Circular_arc_point_3(c0), c1); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h:262:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return SphericalFunctors::equal<SK>(l0, l1); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h:268:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    { return SphericalFunctors::equal<SK>(c0, c1); }
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_3.h:31:5:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    equal( const typename SK::Circular_arc_3 &c1,
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_point_3.h:28:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      equal( const typename SK::Circular_arc_point_3 &p1,
data/cgal-5.1.1/include/CGAL/Circular_kernel_3/internal_functions_on_line_arc_3.h:29:5:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    equal( const typename SK::Line_arc_3 &l1,
data/cgal-5.1.1/include/CGAL/Classification/Planimetric_grid.h:160:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool equal (const iterator& other) const
data/cgal-5.1.1/include/CGAL/Compact_container.h:804:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    std::equal(lhs.begin(), lhs.end(), rhs.begin());
data/cgal-5.1.1/include/CGAL/Compact_mesh_cell_base_3.h:724:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, index);
data/cgal-5.1.1/include/CGAL/Compact_mesh_cell_base_3.h:734:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, i2);
data/cgal-5.1.1/include/CGAL/Complex_2_in_triangulation_cell_base_3.h:128:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, i);
data/cgal-5.1.1/include/CGAL/Concurrent_compact_container.h:798:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    std::equal(lhs.begin(), lhs.end(), rhs.begin());
data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h:3210:10:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    void read(std::istream& is) {
data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h:3374:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  arc.read(is);
data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h:723:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  void read(std::istream& is) {
data/cgal-5.1.1/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h:831:6:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  pt.read(is);
data/cgal-5.1.1/include/CGAL/Direction_2.h:232:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Direction_2.h:233:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Direction_2.h:257:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Direction_2.h:258:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Direction_3.h:189:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, x);
data/cgal-5.1.1/include/CGAL/Direction_3.h:190:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, y);
data/cgal-5.1.1/include/CGAL/Direction_3.h:191:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, z);
data/cgal-5.1.1/include/CGAL/Direction_3.h:215:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Direction_3.h:216:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Direction_3.h:217:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, z);
data/cgal-5.1.1/include/CGAL/Filtered_extended_homogeneous.h:165:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is,m);CGAL::read(is,n);break;
data/cgal-5.1.1/include/CGAL/Filtered_extended_homogeneous.h:165:30:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is,m);CGAL::read(is,n);break;
data/cgal-5.1.1/include/CGAL/Filtered_extended_homogeneous.h:334:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is,x);CGAL::read(is,y);CGAL::read(is,w); break;
data/cgal-5.1.1/include/CGAL/Filtered_extended_homogeneous.h:334:30:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is,x);CGAL::read(is,y);CGAL::read(is,w); break;
data/cgal-5.1.1/include/CGAL/Filtered_extended_homogeneous.h:334:47:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is,x);CGAL::read(is,y);CGAL::read(is,w); break;
data/cgal-5.1.1/include/CGAL/Gray_level_image_3.h:57:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    Image_3::read(file);
data/cgal-5.1.1/include/CGAL/Homogeneous/Weighted_point_2.h:106:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, w);
data/cgal-5.1.1/include/CGAL/Homogeneous/Weighted_point_3.h:106:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, w);
data/cgal-5.1.1/include/CGAL/IO/Arr_iostream.h:83:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read (Arrangement_on_surface_2<GeomTraits,TopTraits>& arr,
data/cgal-5.1.1/include/CGAL/IO/Arr_with_history_iostream.h:88:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
std::istream& read
data/cgal-5.1.1/include/CGAL/IO/Dxf_bsop_reader.h:161:29:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          CGAL_assertion (! equal (ps, pt));
data/cgal-5.1.1/include/CGAL/IO/Dxf_bsop_reader.h:200:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          if (! equal (ps, pt))
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:1122:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    if (text == nullptr || strlen(text) == 0)
data/cgal-5.1.1/include/CGAL/IO/Fig_stream.h:1126:64:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                 reinterpret_cast<const unsigned char*>(text), strlen(text),
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:89:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        if (machine && (std::strlen(machine)>0)) {
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:146:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        std::size_t retread=::read(in, inbuf, 7);
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:156:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            retread=::read(in, inbuf, 7);
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:175:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        retread=::read(in, inbuf, 7);
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:505:29:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      std::size_t retread=::read(in, expr, 1);
data/cgal-5.1.1/include/CGAL/IO/Geomview_stream_impl.h:512:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        std::size_t retread=::read(in, &expr[i], 1);
data/cgal-5.1.1/include/CGAL/IO/Istream_iterator.h:29:10:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    void read() {
data/cgal-5.1.1/include/CGAL/IO/Istream_iterator.h:51:49:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    Istream_iterator( Stream& s) : stream(&s) { read(); }
data/cgal-5.1.1/include/CGAL/IO/Istream_iterator.h:64:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                  read();
data/cgal-5.1.1/include/CGAL/IO/Istream_iterator.h:69:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                  read();
data/cgal-5.1.1/include/CGAL/IO/Nef_polyhedron_iostream_3.h:44:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  I.read();
data/cgal-5.1.1/include/CGAL/IO/PLY.h:195:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  Type read (std::istream& stream) const
data/cgal-5.1.1/include/CGAL/IO/PLY.h:213:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      stream.read(buffer.uChar, size);
data/cgal-5.1.1/include/CGAL/IO/PLY.h:241:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    m_buffer = (this->read<Type> (stream));
data/cgal-5.1.1/include/CGAL/IO/PLY.h:279:64:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    std::size_t size = static_cast<std::size_t>(this->template read<SizeType>(stream));
data/cgal-5.1.1/include/CGAL/IO/PLY.h:282:42:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      this->m_buffer[i] = this->template read<IndexType> (stream);
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:172:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    input.read(reinterpret_cast<char*>(&c), sizeof(c));
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:192:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(!(input.read(reinterpret_cast<char*>(&N32), sizeof(N32))))
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:207:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    if(!(input.read(reinterpret_cast<char*>(&normal[0]), sizeof(normal[0]))) ||
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:208:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
       !(input.read(reinterpret_cast<char*>(&normal[1]), sizeof(normal[1]))) ||
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:209:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
       !(input.read(reinterpret_cast<char*>(&normal[2]), sizeof(normal[2]))))
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:223:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      if(!(input.read(reinterpret_cast<char*>(&x), sizeof(x))) ||
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:224:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
         !(input.read(reinterpret_cast<char*>(&y), sizeof(y))) ||
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:225:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
         !(input.read(reinterpret_cast<char*>(&z), sizeof(z))))
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:254:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    if(!(input.read(reinterpret_cast<char*>(&c), sizeof(c))) ||
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:255:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
       !(input.read(reinterpret_cast<char*>(&c), sizeof(c))))
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:297:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  while(input.read(reinterpret_cast<char*>(&c), sizeof(c)))
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:321:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  if(input.read(reinterpret_cast<char*>(&word[0]), sizeof(c)) &&
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:322:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
     input.read(reinterpret_cast<char*>(&word[1]), sizeof(c)) &&
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:323:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
     input.read(reinterpret_cast<char*>(&word[2]), sizeof(c)) &&
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:324:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
     input.read(reinterpret_cast<char*>(&word[3]), sizeof(c)) &&
data/cgal-5.1.1/include/CGAL/IO/STL_reader.h:325:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
     input.read(reinterpret_cast<char*>(&word[4]), sizeof(c)))
data/cgal-5.1.1/include/CGAL/IO/binary_file_io.h:38:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    in.read( (char*)(&i), 4);
data/cgal-5.1.1/include/CGAL/IO/binary_file_io.h:42:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    in.read( (char*)(&f), 4);
data/cgal-5.1.1/include/CGAL/IO/binary_file_io.h:96:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    in.read( (char*)(&i), 4);
data/cgal-5.1.1/include/CGAL/IO/binary_file_io.h:101:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    in.read( (char*)(&f), 4);
data/cgal-5.1.1/include/CGAL/IO/io.h:348:1:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
read(std::istream& is, T& t, const io_Read_write&)
data/cgal-5.1.1/include/CGAL/IO/io.h:350:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    is.read(reinterpret_cast<char*>(&t), sizeof(t));
data/cgal-5.1.1/include/CGAL/IO/io.h:357:1:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
read(std::istream& is, T& t, const io_Operator&)
data/cgal-5.1.1/include/CGAL/IO/io.h:366:1:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
read(std::istream& is, T& t, const io_Extract_insert&)
data/cgal-5.1.1/include/CGAL/IO/io.h:375:1:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
read(std::istream& is, T& t)
data/cgal-5.1.1/include/CGAL/IO/io.h:377:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, t, typename Io_traits<T>::Io_tag());
data/cgal-5.1.1/include/CGAL/IO/io.h:415:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, r);
data/cgal-5.1.1/include/CGAL/IO/io.h:416:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, g);
data/cgal-5.1.1/include/CGAL/IO/io.h:417:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, b);
data/cgal-5.1.1/include/CGAL/IO/io.h:418:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, a);
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:217:10:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  length=strlen(name);
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:233:3:  [1] (buffer) strncpy:
  Easily used incorrectly; doesn't always \0-terminate or check for invalid
  pointers [MS-banned] (CWE-120).
  strncpy( outputName, name, length-extLength );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:259:3:  [1] (buffer) strncpy:
  Easily used incorrectly; doesn't always \0-terminate or check for invalid
  pointers [MS-banned] (CWE-120).
  strncpy( outputName, name, length-extLength );
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:465:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("Data lost in the Analyze -> ImageIO conversion:") + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:468:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  descrip: ") + 1 + strlen(analyzeHeader->hist.descrip) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:468:73:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  descrip: ") + 1 + strlen(analyzeHeader->hist.descrip) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:471:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  aux_file: ") + 1 + strlen(analyzeHeader->hist.descrip) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:471:74:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  aux_file: ") + 1 + strlen(analyzeHeader->hist.descrip) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:474:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  orient: ") + 1+ 2));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:477:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  originator: ") + 1 + strlen(analyzeHeader->hist.originator) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:477:76:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  originator: ") + 1 + strlen(analyzeHeader->hist.originator) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:480:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  generated: ") + 1 + strlen(analyzeHeader->hist.generated) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:480:75:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  generated: ") + 1 + strlen(analyzeHeader->hist.generated) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:483:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  scannum: ") + 1 + strlen(analyzeHeader->hist.scannum) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:483:73:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  scannum: ") + 1 + strlen(analyzeHeader->hist.scannum) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:486:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  patient_id: ") + 1 + strlen(analyzeHeader->hist.patient_id) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:486:76:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  patient_id: ") + 1 + strlen(analyzeHeader->hist.patient_id) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:489:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  exp_date: ") + 1 + strlen(analyzeHeader->hist.exp_date) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:489:74:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  exp_date: ") + 1 + strlen(analyzeHeader->hist.exp_date) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:492:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  exp_time: ") + 1 + strlen(analyzeHeader->hist.exp_time) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:492:74:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  exp_time: ") + 1 + strlen(analyzeHeader->hist.exp_time) ));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:496:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  views: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:499:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  vols_added: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:502:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  start_field: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:505:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  field_skip: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:508:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  omax: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:511:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  omin: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:514:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  smax: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:517:45:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      im->user[i] = (char *) ImageIO_alloc((strlen("  smin: ") + 11 + 1));
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:524:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        std::size_t length = strlen(name) ;
data/cgal-5.1.1/include/CGAL/ImageIO/analyze_impl.h:759:5:  [1] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused). Risk is low because the source is a constant character.
    strcpy(hdr.dime.cal_units," ");
data/cgal-5.1.1/include/CGAL/ImageIO/bmp_impl.h:53:34:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  if( !strncmp(magic, BMP_MAGIC, strlen(BMP_MAGIC)))
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:47:10:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    rc = fgetc(f);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:60:10:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    rc = fgetc(f);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:80:13:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = (fgetc(f) & 0xff);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:82:10:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    rc = fgetc(f);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:97:13:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = (fgetc(f) & 0xff);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:99:10:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    rc = fgetc(f);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:119:19:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = ((long)fgetc(f) & 0xff);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:120:38:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = CGAL_INT32(temp | (((long)fgetc(f) & 0xff) << 8));
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:121:38:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = CGAL_INT32(temp | (((long)fgetc(f) & 0xff) << 16));
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:123:10:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    rc = fgetc(f);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:138:19:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = ((long)fgetc(f) & 0xff);
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:139:39:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = CGAL_UINT32(temp | (((long)fgetc(f) & 0xff) << 8));
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:140:39:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    temp = CGAL_UINT32(temp | (((long)fgetc(f) & 0xff) << 16));
data/cgal-5.1.1/include/CGAL/ImageIO/bmpendian_impl.h:142:10:  [1] (buffer) fgetc:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    rc = fgetc(f);
data/cgal-5.1.1/include/CGAL/ImageIO/fgetns_impl.h:31:19:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  std::size_t l = strlen(str);
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:46:10:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  length=strlen(name);
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:62:3:  [1] (buffer) strncpy:
  Easily used incorrectly; doesn't always \0-terminate or check for invalid
  pointers [MS-banned] (CWE-120).
  strncpy( outputName, name, length-extLength );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:87:3:  [1] (buffer) strncpy:
  Easily used incorrectly; doesn't always \0-terminate or check for invalid
  pointers [MS-banned] (CWE-120).
  strncpy( outputName, name, length-extLength );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:133:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:134:38:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:134:51:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:136:15:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:136:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:137:46:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              done = ImageIO_write( im, str, strlen( str )  );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:138:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              res = (done == strlen( str )) ? int(done) : -1;
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:153:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:154:38:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:154:51:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:156:15:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:156:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:157:46:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              done = ImageIO_write( im, str, strlen( str )  );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:158:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              res = (done == strlen( str )) ? int(done) : -1;
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:181:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:182:38:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:182:51:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:184:15:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:184:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:185:46:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              done = ImageIO_write( im, str, strlen( str )  );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:186:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              res = (done == strlen( str )) ? int(done) : -1;
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:201:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:202:38:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:202:51:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:204:15:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:204:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:205:46:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              done = ImageIO_write( im, str, strlen( str )  );
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:206:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
              res = (done == strlen( str )) ? int(done) : -1;
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:233:24:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
   if (( !strncmp(name+strlen(name)-4, ".dim", 4)) ||
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:234:24:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
       ( !strncmp(name+strlen(name)-4, ".ima", 4)) ||
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:235:24:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
       ( !strncmp(name+strlen(name)-7, ".ima.gz", 7)) ||
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:236:24:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
       ( !strncmp(name+strlen(name)-7, ".dim.gz", 7)) )
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:282:43:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    im->user[n] = (char*)ImageIO_alloc( 1+strlen( s ) ); \
data/cgal-5.1.1/include/CGAL/ImageIO/gis_impl.h:467:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    std::size_t length = strlen(name) ;
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:160:16:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        pos += strlen(im->user[i]) + 2;
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:162:43:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        if(ImageIO_write(im, im->user[i], strlen(im->user[i])) == 0) return -1;
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:174:32:  [1] (buffer) strcat:
  Does not check for buffer overflows when concatenating to destination
  [MS-banned] (CWE-120). Consider using strcat_s, strncat, strlcat, or
  snprintf (warning: strncat is easily misused). Risk is low because the
  source is a constant character.
    for(i = pos; i < 252; i++) strcat(buf, "\n");
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:177:31:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    if(ImageIO_write(im, buf, strlen(buf)) == 0) return -1;
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:382:13:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      while(strlen(str) == 256) {
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:428:38:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  el->string = (char*)ImageIO_alloc( strlen(str)+1);
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:429:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  memcpy(el->string, str,  strlen(str)+1);
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:447:33:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                                strlen(el->string) + strlen(str) + 1);
data/cgal-5.1.1/include/CGAL/ImageIO/inr_impl.h:447:54:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
                                strlen(el->string) + strlen(str) + 1);
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:351:34:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      newname = (char *) malloc((strlen(filename) + 10) * sizeof(char));
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:352:15:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
      for(i = strlen(filename) - 1; i > 0 && filename[i] != '/'; i--) ;
data/cgal-5.1.1/include/CGAL/ImageIO/mincio_impl.h:354:9:  [1] (buffer) strncpy:
  Easily used incorrectly; doesn't always \0-terminate or check for invalid
  pointers [MS-banned] (CWE-120).
        strncpy(newname, filename, i + 1);
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:46:34:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  if( !strncmp(magic, PPM_MAGIC, strlen(PPM_MAGIC)))
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:53:36:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  if (( !strncmp(magic, PGM_MAGIC, strlen(PGM_MAGIC))))
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:60:42:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  if  ( !strncmp(magic, PGM_ASCII_MAGIC, strlen(PGM_ASCII_MAGIC)))
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:154:35:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  if ( strncmp(string, PPM_MAGIC, strlen(PPM_MAGIC) ) ) {
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:316:41:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  if ( strncmp(string, PGM_ASCII_MAGIC, strlen(PGM_ASCII_MAGIC) ) ) {
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:456:35:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  if ( strncmp(string, PGM_MAGIC, strlen(PGM_MAGIC) ) ) {
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:531:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  ImageIO_write( im, string, strlen( string ) );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:533:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  ImageIO_write( im, string, strlen( string ) );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:535:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  ImageIO_write( im, string, strlen( string ) );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:556:30:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  ImageIO_write( im, string, strlen( string ) );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:577:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
            sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:578:34:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
            if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:578:47:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
            if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:580:11:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
          sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:580:24:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
          sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:581:40:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
          if ( ImageIO_write( im, str, strlen( str ) ) <= 0 ) {
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:594:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
            sprintf( str+strlen(str), "%d", theBuf[i] );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:595:34:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
            if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:595:47:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
            if ( j<n && i<size ) sprintf( str+strlen(str), " " );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:597:11:  [1] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source is a constant character.
          sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:597:24:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
          sprintf( str+strlen(str), "\n" );
data/cgal-5.1.1/include/CGAL/ImageIO/pnm_impl.h:598:40:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
          if ( ImageIO_write( im, str, strlen( str ) ) <= 0 ) {
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:490:23:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    if( !strncmp(name+strlen(name)-3, ".gz", 3) )
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:928:12:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    length=strlen(name);
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:947:19:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        extLength=strlen(ext);
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1521:9:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
       (strlen(format->fileExtension)>0) &&
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1522:9:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
       (strlen(format->realName)>0) ) {
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1545:9:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
       (strlen(format->fileExtension)>0) &&
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1546:9:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
       (strlen(format->realName)>0) ) {
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1617:11:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
         (strlen(f->fileExtension)>0) &&
data/cgal-5.1.1/include/CGAL/ImageIO_impl.h:1618:11:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
         (strlen(f->realName)>0)) {
data/cgal-5.1.1/include/CGAL/Image_3.h:162:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  bool read(const char* file)
data/cgal-5.1.1/include/CGAL/In_place_list.h:482:39:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return size() == y.size() && std::equal(begin(), end(), y.begin());
data/cgal-5.1.1/include/CGAL/In_place_list.h:486:41:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return size() != y.size() || ! std::equal(begin(),end(),y.begin());
data/cgal-5.1.1/include/CGAL/Interval_traits.h:162:1:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
equal(Interval interval1,Interval interval2) {
data/cgal-5.1.1/include/CGAL/Interval_traits.h:163:47:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    typename Interval_traits<Interval>::Equal equal;
data/cgal-5.1.1/include/CGAL/Interval_traits.h:164:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return equal(interval1,interval2);
data/cgal-5.1.1/include/CGAL/Kd_tree.h:448:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      return std::equal(ccci(*pp), ccci(*pp,0), ccci(q));
data/cgal-5.1.1/include/CGAL/Kernel_d/DirectionCd_impl.h:61:35:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ dir.copy_on_write(); dir.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/DirectionHd_impl.h:61:35:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ dir.copy_on_write(); dir.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/HyperplaneCd_impl.h:90:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ h.copy_on_write(); h.ptr()->read(I); return I; }
data/cgal-5.1.1/include/CGAL/Kernel_d/HyperplaneHd_impl.h:93:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ h.copy_on_write(); h.ptr()->read(I); return I; }
data/cgal-5.1.1/include/CGAL/Kernel_d/Line_d.h:193:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ l.copy_on_write(); l.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/Matrix__.h:795:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is,rdim);
data/cgal-5.1.1/include/CGAL/Kernel_d/Matrix__.h:796:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is,cdim);
data/cgal-5.1.1/include/CGAL/Kernel_d/Matrix__.h:798:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read(is,M(i/rdim,i%cdim));
data/cgal-5.1.1/include/CGAL/Kernel_d/Pair_d.h:62:6:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
void read(std::istream& is)
data/cgal-5.1.1/include/CGAL/Kernel_d/Pair_d.h:68:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is, _p[0]); CGAL::read(is, _p[1]); break;
data/cgal-5.1.1/include/CGAL/Kernel_d/Pair_d.h:68:36:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is, _p[0]); CGAL::read(is, _p[1]); break;
data/cgal-5.1.1/include/CGAL/Kernel_d/PointCd_impl.h:66:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ p.copy_on_write(); p.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/PointHd_impl.h:66:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ p.copy_on_write(); p.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/Ray_d.h:180:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ r.copy_on_write(); r.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/Segment_d.h:223:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ s.copy_on_write(); s.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/Tuple_d.h:129:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  void read(std::istream& in);
data/cgal-5.1.1/include/CGAL/Kernel_d/Tuple_d.h:236:22:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
void Tuple_d<NT,LA>::read(std::istream& is)
data/cgal-5.1.1/include/CGAL/Kernel_d/Tuple_d.h:244:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(is, d); v = Vector(d);
data/cgal-5.1.1/include/CGAL/Kernel_d/Tuple_d.h:245:29:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      while (i < d) { CGAL::read(is, v[i]); ++i; } break;
data/cgal-5.1.1/include/CGAL/Kernel_d/VectorCd_impl.h:56:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ v.copy_on_write(); v.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Kernel_d/VectorHd_impl.h:51:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
{ v.copy_on_write(); v.ptr()->read(I);
data/cgal-5.1.1/include/CGAL/Line_2.h:275:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, a);
data/cgal-5.1.1/include/CGAL/Line_2.h:276:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, b);
data/cgal-5.1.1/include/CGAL/Line_2.h:277:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, c);
data/cgal-5.1.1/include/CGAL/Mesh_3/C3T3_helpers.h:2104:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
             std::equal(new_boundary.begin(),
data/cgal-5.1.1/include/CGAL/Mesh_3/C3T3_helpers.h:3522:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  if ( ! equal(p, cp(position)) )
data/cgal-5.1.1/include/CGAL/Mesh_3/Mesh_surface_cell_base_3.h:290:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, index);
data/cgal-5.1.1/include/CGAL/Mesh_cell_base_3.h:254:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, index);
data/cgal-5.1.1/include/CGAL/Mesh_vertex_base_3.h:269:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    CGAL::read(is, dimension);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterC2.h:320:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, c.center_x);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterC2.h:321:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, c.center_y);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterC2.h:322:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, c.sqr_rad);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterH2.h:359:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, c.center_hx);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterH2.h:360:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, c.center_hy);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterH2.h:361:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, c.center_hw);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Min_circle_2_adapterH2.h:362:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, c.sqr_rad);
data/cgal-5.1.1/include/CGAL/Min_circle_2/Optimisation_circle_2_impl.h:77:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, squared_radius);
data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Min_ellipse_2_adapterC2.h:386:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, e.n_boundary_points);
data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Min_ellipse_2_adapterH2.h:394:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, e.n_boundary_points);
data/cgal-5.1.1/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2_impl.h:87:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read( is, e.n_boundary_points);
data/cgal-5.1.1/include/CGAL/Nef_2/PM_io_parser.h:144:6:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
void read();
data/cgal-5.1.1/include/CGAL/Nef_2/PM_io_parser.h:313:27:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
void PM_io_parser<PMDEC>::read()
data/cgal-5.1.1/include/CGAL/Nef_2/Polynomial.h:1841:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        CGAL::read(is, d);
data/cgal-5.1.1/include/CGAL/Nef_2/Polynomial.h:1847:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                CGAL::read(is,c);
data/cgal-5.1.1/include/CGAL/Nef_3/SNC_io_parser.h:1072:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  void read();
data/cgal-5.1.1/include/CGAL/Nef_3/SNC_io_parser.h:1400:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
void SNC_io_parser<EW>::read()
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_io_parser.h:115:6:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
void read();
data/cgal-5.1.1/include/CGAL/Nef_S2/SM_io_parser.h:358:32:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
void SM_io_parser<Decorator_>::read()
data/cgal-5.1.1/include/CGAL/Nef_polyhedron_2.h:1110:27:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      I.check_sep(">")) I.read();
data/cgal-5.1.1/include/CGAL/Nef_polyhedron_S2.h:710:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  I.read();
data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Point_d.h:169:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, dim);
data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Point_d.h:182:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, coords[i]);
data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Vector_d.h:163:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, dim);
data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Vector_d.h:176:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, coords[i]);
data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Weighted_point_d.h:120:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, q);
data/cgal-5.1.1/include/CGAL/NewKernel_d/Wrapper/Weighted_point_d.h:121:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, w);
data/cgal-5.1.1/include/CGAL/Partition_2/Rotation_tree_2.h:80:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      Equal equal;
data/cgal-5.1.1/include/CGAL/Partition_2/Rotation_tree_2.h:82:46:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      std::unique(this->begin(), this->end(),equal);
data/cgal-5.1.1/include/CGAL/Periodic_2_offset_2.h:168:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, x);
data/cgal-5.1.1/include/CGAL/Periodic_2_offset_2.h:169:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, y);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4318:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, cx);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4319:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, cy);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4320:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, n);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4376:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  else read(is, m);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4386:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            else read(is, index);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4405:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            else read(is, index);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4426:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
          read(is, off[0]);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4427:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
          read(is, off[1]);
data/cgal-5.1.1/include/CGAL/Periodic_2_triangulation_2.h:4428:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
          read(is, off[2]);
data/cgal-5.1.1/include/CGAL/Periodic_3_offset_3.h:127:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,x);
data/cgal-5.1.1/include/CGAL/Periodic_3_offset_3.h:128:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,y);
data/cgal-5.1.1/include/CGAL/Periodic_3_offset_3.h:129:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,z);
data/cgal-5.1.1/include/CGAL/Periodic_3_regular_triangulation_3.h:651:43:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_triangulation_precondition(this->equal(p, q));
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:609:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(const P& p1, const P& p2) const {
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:3826:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return _t->equal(v->point(), _p);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4033:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,cx);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4034:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,cy);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4035:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,cz);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4036:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,n);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4085:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is,off[0]);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4086:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is,off[1]);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4087:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is,off[2]);
data/cgal-5.1.1/include/CGAL/Periodic_3_triangulation_3.h:4088:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is,off[3]);
data/cgal-5.1.1/include/CGAL/Plane_3.h:258:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, a);
data/cgal-5.1.1/include/CGAL/Plane_3.h:259:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, b);
data/cgal-5.1.1/include/CGAL/Plane_3.h:260:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, c);
data/cgal-5.1.1/include/CGAL/Plane_3.h:261:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, d);
data/cgal-5.1.1/include/CGAL/Point_2.h:244:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Point_2.h:245:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Point_2.h:270:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hx);
data/cgal-5.1.1/include/CGAL/Point_2.h:271:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hy);
data/cgal-5.1.1/include/CGAL/Point_2.h:272:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hw);
data/cgal-5.1.1/include/CGAL/Point_3.h:273:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Point_3.h:274:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Point_3.h:275:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, z);
data/cgal-5.1.1/include/CGAL/Point_3.h:300:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hx);
data/cgal-5.1.1/include/CGAL/Point_3.h:301:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hy);
data/cgal-5.1.1/include/CGAL/Point_3.h:302:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hz);
data/cgal-5.1.1/include/CGAL/Point_3.h:303:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hw);
data/cgal-5.1.1/include/CGAL/Point_with_psc_localisation.h:137:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, dim);
data/cgal-5.1.1/include/CGAL/Point_with_psc_localisation.h:138:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, index);
data/cgal-5.1.1/include/CGAL/Point_with_surface_index.h:83:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, index);
data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_algorithms_impl.h:249:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  while(equal(*previous, *current)) {
data/cgal-5.1.1/include/CGAL/Polygon_2/Polygon_2_algorithms_impl.h:273:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if(equal(*current, *next)) {
data/cgal-5.1.1/include/CGAL/Polygon_mesh_processing/repair_polygon_soup.h:820:69:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  Unique_polygons unique_polygons(polygons_n /*bucket size*/, hash, equal);
data/cgal-5.1.1/include/CGAL/Regular_triangulation_3.h:1074:43:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_triangulation_precondition(this->equal(p, q));
data/cgal-5.1.1/include/CGAL/Search_traits_adapter.h:179:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool equal(const No_lvalue_iterator& other) const
data/cgal-5.1.1/include/CGAL/Snap_rounding_2.h:60:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(const Segment_2 & s);
data/cgal-5.1.1/include/CGAL/Snap_rounding_2.h:224:29:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
bool Segment_data<Traits_>::equal(const Segment_2 & s)
data/cgal-5.1.1/include/CGAL/Sphere_3.h:292:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, squared_radius);
data/cgal-5.1.1/include/CGAL/Sphere_3.h:320:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, squared_radius);
data/cgal-5.1.1/include/CGAL/Straight_skeleton_vertex_base_2.h:95:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      bool equal( Halfedge_circulator_base<OtherHalfedgeHandle,OtherAccessPolicy> const& aOther ) const
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:47:30:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  template <typename T> void read(std::istream& in, T& t)
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:49:8:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    in.read(reinterpret_cast<char*>(&t), sizeof(t));
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:80:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    internal::read(in, nV);
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:81:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    internal::read(in, nF);
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:82:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    internal::read(in, nE);
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:91:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        internal::read(in, p);
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:97:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            internal::read(in, n);
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:104:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            internal::read(in, t);
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:114:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        internal::read(in, nV);
data/cgal-5.1.1/include/CGAL/Surface_mesh/IO.h:118:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            internal::read(in, idx);
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:568:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
              while (!it.equal(other))
data/cgal-5.1.1/include/CGAL/Surface_mesh/Surface_mesh.h:588:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(const Index_iterator& other) const
data/cgal-5.1.1/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h:781:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if(std::equal(subdomains_v0.begin(), subdomains_v0.end(), subdomains_v1.begin()))
data/cgal-5.1.1/include/CGAL/Triangulation.h:1343:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, cd);
data/cgal-5.1.1/include/CGAL/Triangulation.h:1344:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, n);
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:583:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(const Point& p, const Point& q) const
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:655:38:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CGAL_triangulation_precondition(!equal(s, t));
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:2245:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, d);
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:2246:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, n);
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:2310:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, d);
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:2311:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, n);
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:3020:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if(! equal(p, vit->point()))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:3527:37:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  CGAL_triangulation_precondition(! equal(p0, p1));
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7269:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if(equal(cp(p2), cp((*cit)->vertex((inf+1)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7271:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    else if(equal(cp(p2), cp((*cit)->vertex((inf+2)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7273:25:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    else if(dim == 3 && equal(cp(p2), cp((*cit)->vertex((inf+3)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7278:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if(equal(cp(p3), cp((*cit)->vertex((inf+1)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7280:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    else if(equal(cp(p3), cp((*cit)->vertex((inf+2)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7282:25:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    else if(dim == 3 && equal(cp(p3), cp((*cit)->vertex((inf+3)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7289:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if(equal(cp(p4), cp((*cit)->vertex((inf+1)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7291:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      else if(equal(cp(p4), cp((*cit)->vertex((inf+2)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_3.h:7293:15:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      else if(equal(cp(p4), cp((*cit)->vertex((inf+3)%(dim+1))->point())))
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure.h:1348:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, m, io_Read_write());
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure.h:1365:17:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                read(is, index);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure.h:1390:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            read(is, index);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure.h:1496:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, cd);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure.h:1497:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, n, io_Read_write());
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h:1628:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, d);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h:1629:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, n);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h:1959:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is, n);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h:1960:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read(is,d);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h:2526:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, m);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h:2537:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
              read(is, ik);
data/cgal-5.1.1/include/CGAL/Triangulation_data_structure_3.h:2550:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
              read(is, ik);
data/cgal-5.1.1/include/CGAL/Vector_2.h:345:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Vector_2.h:346:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Vector_2.h:371:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hx);
data/cgal-5.1.1/include/CGAL/Vector_2.h:372:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hy);
data/cgal-5.1.1/include/CGAL/Vector_2.h:373:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hw);
data/cgal-5.1.1/include/CGAL/Vector_3.h:325:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, x);
data/cgal-5.1.1/include/CGAL/Vector_3.h:326:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, y);
data/cgal-5.1.1/include/CGAL/Vector_3.h:327:7:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      read(is, z);
data/cgal-5.1.1/include/CGAL/Vector_3.h:351:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hx);
data/cgal-5.1.1/include/CGAL/Vector_3.h:352:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hy);
data/cgal-5.1.1/include/CGAL/Vector_3.h:353:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hz);
data/cgal-5.1.1/include/CGAL/Vector_3.h:354:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hw);
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:149:31:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if ( sv.is_point() && equal(sv, sp) &&
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:151:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b1 = equal(sv, s1.source_site()) || equal(sv, s1.target_site());
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:151:52:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b1 = equal(sv, s1.source_site()) || equal(sv, s1.target_site());
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:152:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b2 = equal(sv, s2.source_site()) || equal(sv, s2.target_site());
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:152:52:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b2 = equal(sv, s2.source_site()) || equal(sv, s2.target_site());
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:190:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b = equal(sv, s1.source_site()) || equal(sv, s1.target_site());
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:190:51:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b = equal(sv, s1.source_site()) || equal(sv, s1.target_site());
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:192:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          if ( b && equal(sv, sp) ) { return *ec; }
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:199:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b = equal(sv.source_site(), s1) || equal(sv.target_site(), s1);
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:199:51:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          bool b = equal(sv.source_site(), s1) || equal(sv.target_site(), s1);
data/cgal-5.1.1/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h:201:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          if ( b && equal(s1, sp) ) { return *ec; }
data/cgal-5.1.1/include/CGAL/Weighted_point_2.h:292:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Weighted_point_2.h:293:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Weighted_point_2.h:294:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, weight);
data/cgal-5.1.1/include/CGAL/Weighted_point_2.h:319:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hx);
data/cgal-5.1.1/include/CGAL/Weighted_point_2.h:320:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hy);
data/cgal-5.1.1/include/CGAL/Weighted_point_2.h:321:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hw);
data/cgal-5.1.1/include/CGAL/Weighted_point_2.h:322:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, weight);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:311:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, x);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:312:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, y);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:313:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, z);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:314:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, weight);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:339:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hx);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:340:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hy);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:341:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hz);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:342:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, hw);
data/cgal-5.1.1/include/CGAL/Weighted_point_3.h:343:9:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        read(is, weight);
data/cgal-5.1.1/include/CGAL/boost/graph/Seam_mesh.h:257:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool equal(const halfedge_iterator& other) const
data/cgal-5.1.1/include/CGAL/boost/graph/Seam_mesh.h:394:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool equal(const vertex_iterator& other) const
data/cgal-5.1.1/include/CGAL/boost/graph/Seam_mesh.h:513:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool equal(const edge_iterator& other) const
data/cgal-5.1.1/include/CGAL/compute_outer_frame_margin.h:61:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if ( !equal(*lPrev,*lCurr) && !equal(*lCurr,*lNext) && !collinear(*lPrev,*lCurr,*lNext) )
data/cgal-5.1.1/include/CGAL/compute_outer_frame_margin.h:61:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if ( !equal(*lPrev,*lCurr) && !equal(*lCurr,*lNext) && !collinear(*lPrev,*lCurr,*lNext) )
data/cgal-5.1.1/include/CGAL/convex_hull_3.h:1012:39:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  while (point2_it != points.end() && equal(*point1_it,*point2_it))
data/cgal-5.1.1/include/CGAL/internal/Mesh_3/Handle_IO_for_pair_of_int.h:85:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(in, t.first);
data/cgal-5.1.1/include/CGAL/internal/Mesh_3/Handle_IO_for_pair_of_int.h:86:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      CGAL::read(in, t.second);
data/cgal-5.1.1/include/CGAL/internal/Mesh_3/indices_management.h:143:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      else CGAL::read(is, ci);
data/cgal-5.1.1/include/CGAL/internal/Mesh_3/indices_management.h:149:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      else CGAL::read(is, si);
data/cgal-5.1.1/include/CGAL/internal/Mesh_3/indices_management.h:203:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      else CGAL::read(is, spi);
data/cgal-5.1.1/include/CGAL/internal/Mesh_3/indices_management.h:210:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      else CGAL::read(is, di);
data/cgal-5.1.1/include/CGAL/iterator_from_indices.h:47:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(Iterator_from_indices const& other)const{
data/cgal-5.1.1/include/CGAL/leda_bigfloat_interval.h:371:38:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            return ::boost::numeric::equal(a,b);
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:481:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  } while (equal(*first, *f));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:501:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  while (equal(*ln, *low));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:507:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  while (equal(*un, *upp));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:520:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    while (equal(*rig, *right));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:527:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    while (equal(*len, *left));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:567:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    while (equal(*ln, *low));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:573:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    while (equal(*un, *upp));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:585:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      while (equal(*rig, *right));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:592:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      while (equal(*len, *left));
data/cgal-5.1.1/include/CGAL/min_quadrilateral_2.h:658:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  } while (equal(*first, *f));
data/cgal-5.1.1/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h:415:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if ( is_certain(equal) )
data/cgal-5.1.1/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h:417:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if ( equal )
data/cgal-5.1.1/include/CGAL/transforming_pair_iterator.h:75:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(transforming_pair_iterator const&i)const{
data/cgal-5.1.1/include/CGAL/vector.h:244:43:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        return size() == y.size() && std::equal( pbegin(), pend(), y.pbegin());

ANALYSIS SUMMARY:

Hits = 1417
Lines analyzed = 1319891 in approximately 27.00 seconds (48880 lines/second)
Physical Source Lines of Code (SLOC) = 915684
Hits@level = [0] 327 [1] 648 [2] 433 [3] 258 [4]  78 [5]   0
Hits@level+ = [0+] 1744 [1+] 1417 [2+] 769 [3+] 336 [4+]  78 [5+]   0
Hits/KSLOC@level+ = [0+] 1.90459 [1+] 1.54748 [2+] 0.839809 [3+] 0.366939 [4+] 0.0851822 [5+]   0
Dot directories skipped = 1 (--followdotdir overrides)
Minimum risk level = 1
Not every hit is necessarily a security vulnerability.
There may be other security vulnerabilities; review your code!
See 'Secure Programming HOWTO'
(https://dwheeler.com/secure-programs) for more information.