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

Use Uniue_hash_map instead of std::map; Replace endl

This commit is contained in:
Andreas Fabri 2016-04-11 17:19:56 +02:00
parent dbb2be1462
commit e36d199738
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
TDS_3/include/CGAL/Triangulation_data_structure_3.h
View File

@ -2324,7 +2324,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
if(is_ascii(os)) { if(is_ascii(os)) {
os << V[it->vertex(j)]; os << V[it->vertex(j)];
if ( j==3 ) if ( j==3 )
os << std::endl; os << '\n';
else else
os << ' '; os << ' ';
} }
@ -2340,7 +2340,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
if(is_ascii(os)){ if(is_ascii(os)){
os << C[it->neighbor(j)]; os << C[it->neighbor(j)];
if(j==3) if(j==3)
os << std::endl; os << '\n';
else else
os << ' '; os << ' ';
} }
@ -2354,7 +2354,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
{ {
size_type m = number_of_facets(); size_type m = number_of_facets();
if(is_ascii(os)) if(is_ascii(os))
os << m << std::endl; os << m << '\n';
else else
write(os, m); write(os, m);
@ -2366,7 +2366,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
if(is_ascii(os)) { if(is_ascii(os)) {
os << V[(*it).first->vertex(j)]; os << V[(*it).first->vertex(j)];
if ( j==2 ) if ( j==2 )
os << std::endl; os << '\n';
else else
os << ' '; os << ' ';
} }
@ -2383,7 +2383,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
if(is_ascii(os)){ if(is_ascii(os)){
os << C[(*it).first->neighbor(j)]; os << C[(*it).first->neighbor(j)];
if(j==2) if(j==2)
os << std::endl; os << '\n';
else else
os << ' '; os << ' ';
} }
@ -2398,7 +2398,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
{ {
size_type m = number_of_edges(); size_type m = number_of_edges();
if(is_ascii(os)) if(is_ascii(os))
os << m << std::endl; os << m << '\n';
else else
write(os, m); write(os, m);
// write the edges // write the edges
@ -2409,7 +2409,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
if(is_ascii(os)) { if(is_ascii(os)) {
os << V[(*it).first->vertex(j)]; os << V[(*it).first->vertex(j)];
if ( j==1 ) if ( j==1 )
os << std::endl; os << '\n';
else else
os << ' '; os << ' ';
} }
@ -2426,7 +2426,7 @@ print_cells(std::ostream& os, const Unique_hash_map<Vertex_handle, std::size_t>
if(is_ascii(os)){ if(is_ascii(os)){
os << C[(*it).first->neighbor(j)]; os << C[(*it).first->neighbor(j)];
if(j==1) if(j==1)
os << std::endl; os << '\n';
else else
os << ' '; os << ' ';
} }