songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

added std to list::

This commit is contained in:
Mariette Yvinec 1999-09-28 16:57:49 +00:00
parent 4e487f3b1c
commit fee4be1880
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Packages/Triangulation_2/include/CGAL/Triangulation_default_data_structure_2.h
View File

@ -545,15 +545,15 @@ insert_dim_up(Vertex *w, bool orient)
Vertex * v = new Vertex;
list<Face *> faces_list;
std::list<Face *> faces_list;
Iterator_base ib= Iterator_base(this);
Iterator_base ib_end = Iterator_base(this,1);
for ( ; ib != ib_end ; ++ib){
faces_list.push_back( & (*ib));
}
list<Face *> to_delete;
list<Face *>::iterator lfit = faces_list.begin();
std::list<Face *> to_delete;
std::list<Face *>::iterator lfit = faces_list.begin();
int i = dimension()+1; // maximun non NULL index in faces after the insertion
Face *f, *g;
@ -676,15 +676,15 @@ remove_dim_down(Vertex* v)
(dimension() == 2 && number_of_vertices() > 3) );
// the faces incident to v are down graded one dimension
// the other faces are deleted
list<Face* > to_delete;
list<Face* > to_downgrade;
std::list<Face* > to_delete;
std::list<Face* > to_downgrade;
Iterator_base ib = iterator_base_begin();
for( ; ib != iterator_base_end(); ++ib ){
if ( ! ib->has_vertex(v) ) { to_delete.push_back(&(*ib));}
else { to_downgrade.push_back(&(*ib));}
}
list<Face*>::iterator lfit = to_downgrade.begin();
std::list<Face*>::iterator lfit = to_downgrade.begin();
int j;
Face * f;
for( ; lfit != to_downgrade.end() ; ++lfit) {