Home
last modified time | relevance | path

Searched refs:n_pgn (Results 1 – 4 of 4) sorted by relevance

/dports/math/cgal/CGAL-5.3/include/CGAL/Boolean_set_operations_2/
H A DGps_bfs_join_visitor.h38 Gps_bfs_join_visitor(Edges_hash* edges_hash, Faces_hash* faces_hash, unsigned int n_pgn): in Gps_bfs_join_visitor() argument
39 Base(edges_hash, faces_hash, n_pgn) in Gps_bfs_join_visitor()
H A DGps_agg_op.h113 unsigned int n_pgn = 0; // number of polygons (arrangements) in sweep_arrangements() local
116 for (i = lower; i <= upper; i += jump, ++n_pgn) { in sweep_arrangements()
141 Bfs_visitor visitor(&m_edges_hash, &m_faces_hash, n_pgn); in sweep_arrangements()
H A DGps_bfs_base_visitor.h50 unsigned int n_pgn): in Gps_bfs_base_visitor() argument
53 m_num_of_polygons(n_pgn) in Gps_bfs_base_visitor()
H A DGps_bfs_xor_visitor.h39 unsigned int n_pgn) : in Gps_bfs_xor_visitor() argument
40 Base(edges_hash, faces_hash, n_pgn) in Gps_bfs_xor_visitor()