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

VC8 STL iterator fixes

This commit is contained in:
Fernando Cacciola 2007-01-18 14:05:05 +00:00
parent 0635012692
commit 40e17118d5
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
Polyhedron/include/CGAL/Polyhedron_incremental_builder_3.h
View File

@ -83,8 +83,8 @@ protected:
// the halfedge pointer in the vertices (if supported).
// ----------------------------------------------------
void initialize_vertex_to_edge_map( size_type n, bool mode, Tag_true) {
vertex_to_edge_map = std::vector< Halfedge_handle>();
vertex_to_edge_map.reserve(n);
vertex_to_edge_map.clear();
vertex_to_edge_map.resize(n);
if ( mode) {
// go through all halfedges and keep a halfedge for each
// vertex found in a hashmap.
@ -98,8 +98,8 @@ protected:
}
}
void initialize_vertex_to_edge_map( size_type n, bool mode, Tag_false){
vertex_to_edge_map = std::vector< Halfedge_handle>();
vertex_to_edge_map.reserve(n);
vertex_to_edge_map.clear();
vertex_to_edge_map.resize(n);
if ( mode) {
// go through all halfedges and keep a halfedge for each
// vertex found in a hashmap.
@ -152,6 +152,7 @@ protected:
}
void set_vertex_to_edge_map( int i, Halfedge_handle h, Tag_false) {
// Use the self-managed array vertex_to_edge_map.
CGAL_assertion(i>=0 && i < vertex_to_edge_map.size());
vertex_to_edge_map[i] = h;
}
void set_vertex_to_edge_map( int i, Halfedge_handle h) {