extra run of the script to remove tabs and trailing whitespaces

Author: sloriot

Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h

@@ -1232,7 +1232,7 @@ int
 Sliver_perturber<C3T3,Md,Sc,V_>::
 update_priority_queue(const PVertex& pv, PQueue& pqueue) const
 {
-  typename Handle_map::iterator pvh = 
+  typename Handle_map::iterator pvh =
       h.find(pv.id());
   if ( pvh != h.end() )
   {

Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h

@@ -264,7 +264,7 @@ operator()()
 
     if((*u)->is_removable()){
       boost::optional<FT> dist = cost(pct, u);
-      typename boost::unordered_map<int,typename MPQ::handle>::iterator find_result_u = 
+      typename boost::unordered_map<int,typename MPQ::handle>::iterator find_result_u =
           h.find(u.base()->id);
       if(! dist){
         // cost is undefined
@@ -288,7 +288,7 @@ operator()()
 
     if((*w)->is_removable()){
       boost::optional<FT> dist = cost(pct, w);
-      typename boost::unordered_map<int,typename MPQ::handle>::iterator find_result_w = 
+      typename boost::unordered_map<int,typename MPQ::handle>::iterator find_result_w =
           h.find(w.base()->id);
       if(! dist){
         // cost is undefined

STL_Extension/test/STL_Extension/test_Modifiable_priority_queue.cpp

@@ -3,9 +3,9 @@
 #include <CGAL/Modifiable_priority_queue.h>
 #include <boost/unordered_map.hpp>
 #include <iostream>
-#include <functional> 
+#include <functional>
 
-//first is the index (id) and second the value compared, 
+//first is the index (id) and second the value compared,
 typedef std::pair<std::size_t,int> Type;
 
 //property map
@@ -43,87 +43,87 @@ int main()
   Heap_map h;
   assert( queue_size(h,45) == 0 );
   assert( q.empty() );
-  
+
   std::vector<Type> data;
-  
+
   data.push_back(Type(0,10));
   data.push_back(Type(1,20));
   data.push_back(Type(2,30));
   data.push_back(Type(3,40));
   data.push_back(Type(4,1));
   data.push_back(Type(5,2));
-  
+
   h[&data[0]] = q.push(&data[0]);
   h[&data[0]+1] = q.push(&data[0]+1);
   h[&data[0]+2] = q.push(&data[0]+2);
   h[&data[0]+3] = q.push(&data[0]+3);
-  
+
   assert( q.top()->first == 0 );
   assert( queue_size(h,45) == 4 );
-  
+
   Type *top = q.top();
   q.pop();
   h.erase(top);
   assert( q.top()->first == 1 );
   assert( queue_size(h,45) == 3 );
-  
+
   h[&data[0]+4] = q.push(&data[0]+4);
-  
+
   assert( q.top()->first == 4 );
   assert( queue_size(h,45) == 4 );
 
   q.erase(&data[0]+4, h[&data[0]+4]);
   h.erase(&data[0]+4);
-  
+
   assert( q.top()->first == 1 );
-  assert( queue_size(h,45) == 3 ); 
-  
+  assert( queue_size(h,45) == 3 );
+
   h[&data[0]+5] = q.push(&data[0]+5);
-  
+
   assert( q.top()->first == 5 );
   assert( queue_size(h,45) == 4 );
-  
+
   Queue::handle ex_h = h[&data[0]+5];
   data[5].second=43;
   q.update(&data[0]+5,ex_h);
   h[&data[0]+5] = ex_h;
-  
+
   assert( q.top()->first == 1 );
-  assert( queue_size(h,45) == 4 );  
-  
+  assert( queue_size(h,45) == 4 );
+
   top = q.top();
   q.pop();
   h.erase(top);
-  
+
   assert( q.top()->first == 2 );
-  assert( queue_size(h,45) == 3 );  
+  assert( queue_size(h,45) == 3 );
 
   top=q.top();
   q.pop();
   h.erase(top);
   assert( q.top()->first == 3 );
-  assert( queue_size(h,45) == 2 );  
+  assert( queue_size(h,45) == 2 );
 
   top = q.top();
   q.pop();
   h.erase(top);
   assert( q.top()->first == 5 );
-  assert( queue_size(h,45) == 1 );  
-  
+  assert( queue_size(h,45) == 1 );
+
   top=q.top();
   q.pop();
   h.erase(top);
   assert( queue_size(h,45) == 0 );
   assert( q.empty() );
-  
+
   h[&data[0]] = q.push(&data[0]);
   h[&data[0]+1] = q.push(&data[0]+1);
   h[&data[0]+2] = q.push(&data[0]+2);
   h[&data[0]+3] = q.push(&data[0]+3);
-  
+
   assert( q.top()->first == 0 );
   assert( queue_size(h,45) == 4 );
-  
+
   q.erase(&data[0]+1,h[&data[0]+1]);
   h.erase(&data[0]+1);
   assert( q.top()->first == 0 );
@@ -138,11 +138,11 @@ int main()
   h.erase(&data[0]);
   assert( q.top()->first == 3 );
   assert( queue_size(h,45) == 1 );
-  
+
   q.erase(&data[0]+3,h[&data[0]+3]);
   h.erase(&data[0]+3);
   assert( queue_size(h,45) == 0 );
-  assert( q.empty() );  
+  assert( q.empty() );
 
 //testing correctness of the order
   int array[10] = {0,1,2,3,4,5,6,7,8,9};
@@ -153,23 +153,23 @@ int main()
     data.push_back(Type(i,array[i]));
     h[&data[0]+i] = q.push(&data[0]+i);
   }
-  
+
   for (int i=0;i<10;++i){
     top = q.top();
     assert(top->second==i);
     q.pop();
     h.erase(top);
   }
   assert( q.empty() );
-  
+
 //testing update (increase key)
   data.clear();
   data.reserve(10);
   for (int i=0;i<10;++i){
     data.push_back(Type(i,10+i));
     h[&data[0]+i] = q.push(&data[0]+i);
   }
-  
+
   for (unsigned int i=0;i<10;++i){
     ex_h = h[&data[0]+i];
     data[i].second=9-i;
@@ -184,7 +184,7 @@ int main()
     h.erase(&data[0]+i);
     assert(queue_size(h,45)==9-i);
   }
-  
+
 //testing update (decrease key of top)
   data.clear();
   data.reserve(10);
@@ -200,31 +200,31 @@ int main()
     h[&data[0]+i] = ex_h;
     assert(q.top()->first==i+1);
   }
-  
+
 //revert order
   for (unsigned int i=0;i<10;++i){
     ex_h = h[&data[0]+9-i];
     data[9-i].second=i;
     q.update(&data[0]+9-i,ex_h);
     h[&data[0]+9-i] = ex_h;
     assert(q.top()->first==9);
-  }  
-//testing remove (emulate pop)  
+  }
+//testing remove (emulate pop)
   for (std::size_t i=0;i<10;++i){
     assert(q.top()->first==9-i);
     q.erase(&data[0]-i+9,h[&data[0]+9-i]);
     h.erase(&data[0]+9-i);
   }
   assert( q.empty() );
-  
+
   //testing remove+contains
   data.clear();
   data.reserve(10);
   for (int i=0;i<10;++i){
     data.push_back(Type(i,i));
     h[&data[0]+i] = q.push(&data[0]+i);
   }
-  
+
   for (std::size_t i=0;i<10;++i){
     assert(q.top()->first==0);
     q.erase(&data[0]-i+9,h[&data[0]-i+9]);
@@ -235,9 +235,9 @@ int main()
       assert(h.find(&data[0]+9-k) == h.end());
   }
   assert( q.empty() );
-  
+
   std::cout << "OK" << std::endl;
- 
+
   return 0;
   #else
   std::cerr << "ERROR: Nothing is tested" << std::endl;