mirror of https://github.com/CGAL/cgal
extract_list_output => list_output
This commit is contained in:
parent
2e6db170a5
commit
0d881dc092
|
|
@ -406,7 +406,7 @@ public:
|
|||
std::vector<Point> isolated_points;
|
||||
std::vector<Segment> edges;
|
||||
|
||||
m_pwsrec->extract_list_output(std::back_inserter(isolated_points), std::back_inserter(edges));
|
||||
m_pwsrec->list_output (std::back_inserter(isolated_points), std::back_inserter(edges));
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -57,7 +57,7 @@ int main ()
|
|||
std::vector<Point> isolated_vertices;
|
||||
std::vector<Segment> edges;
|
||||
|
||||
rs2.extract_list_output(std::back_inserter(isolated_vertices), std::back_inserter(edges));
|
||||
rs2.list_output (std::back_inserter(isolated_vertices), std::back_inserter(edges));
|
||||
|
||||
std::cerr << "Isolated vertices" << std::endl;
|
||||
std::vector<Point>::iterator vit;
|
||||
|
|
|
|||
|
|
@ -34,7 +34,7 @@ void list_output(Rs_2& rs2)
|
|||
std::vector<Point> isolated_points;
|
||||
std::vector<Segment> segments;
|
||||
|
||||
rs2.extract_list_output(
|
||||
rs2.list_output (
|
||||
std::back_inserter(isolated_points), std::back_inserter(segments));
|
||||
|
||||
std::vector<Point>::iterator pit;
|
||||
|
|
|
|||
|
|
@ -1502,7 +1502,7 @@ bool create_pedge(const Edge& edge, Rec_edge_2& pedge) {
|
|||
std::vector<Point> isolated_points_;
|
||||
std::vector<Segment> edges;
|
||||
|
||||
extract_list_output(
|
||||
list_output (
|
||||
std::back_inserter(isolated_points_), std::back_inserter(edges));
|
||||
|
||||
// vertices_of_edges
|
||||
|
|
@ -1566,7 +1566,7 @@ bool create_pedge(const Edge& edge, Rec_edge_2& pedge) {
|
|||
\tparam SegmentOutputIterator The output iterator type for storing the edges as segments.
|
||||
*/
|
||||
template<class PointOutputIterator, class SegmentOutputIterator>
|
||||
void extract_list_output(PointOutputIterator v_it, SegmentOutputIterator e_it) {
|
||||
void list_output (PointOutputIterator v_it, SegmentOutputIterator e_it) {
|
||||
|
||||
for (Vertex_iterator vi = m_dt.vertices_begin();
|
||||
vi != m_dt.vertices_end(); ++vi)
|
||||
|
|
|
|||
|
|
@ -109,7 +109,7 @@ void test_list_output(Rs_2& rs2) {
|
|||
std::vector<Point> isolated_points;
|
||||
std::vector<Segment> edges;
|
||||
|
||||
rs2.extract_list_output(std::back_inserter(isolated_points), std::back_inserter(edges));
|
||||
rs2.list_output (std::back_inserter(isolated_points), std::back_inserter(edges));
|
||||
|
||||
int vertex_count = 0;
|
||||
for (std::vector<Point>::iterator it = isolated_points.begin();
|
||||
|
|
|
|||
|
|
@ -39,7 +39,7 @@ int main ()
|
|||
std::vector<Point> isolated_points;
|
||||
std::vector<Segment> edges;
|
||||
|
||||
rs2.extract_list_output(std::back_inserter(isolated_points), std::back_inserter(edges));
|
||||
rs2.list_output (std::back_inserter(isolated_points), std::back_inserter(edges));
|
||||
|
||||
std::cout << "isolated_points " << isolated_points.size() << std::endl;
|
||||
std::cout << "edges " << edges.size() << std::endl;
|
||||
|
|
|
|||
Loading…
Reference in New Issue