*** empty log message ***

Packages/Spatial_searching/doc_tex/Spatial_searching_ref/main.tex

@@ -5,7 +5,7 @@
 % | of this package. Do not edit manually, you may loose your changes.
 % +------------------------------------------------------------------------+
 % alfabatisch 
-\input{intro.tex}
+\input{introduction.tex}
 \input{Fair.tex}
 \input{GeneralDistance.tex}
 \input{General_priority_search.tex}

Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/main.tex

@@ -5,7 +5,7 @@
 % | of this package. Do not edit manually, you may loose your changes.
 % +------------------------------------------------------------------------+
 % alfabatisch 
-\input{intro.tex}
+\input{introduction.tex}
 \input{Fair.tex}
 \input{GeneralDistance.tex}
 \input{General_priority_search.tex}

Packages/Spatial_searching/examples/Spatial_searching/Example04.C

@@ -259,6 +259,8 @@ int generate_kd_tree(CGAL::Split_rule_enumeration::Split_rule s) {
      std::cout << " d(q,nn1)= " << nearest_neighbours1[i].second << 
      " d(q,nn2)= " << nearest_neighbours2[i].second << std::endl; 
   } 
+
+  return 0;
 };
 
 int main() {

Packages/Spatial_searching/examples/Spatial_searching/Example06.C

@@ -1,6 +1,6 @@
 // Approximate spatial searching: Example06.C
 // Example illustrating for each separate splitting rule
-// building a kd-tree 
+// building a kd-tree   
 
 #include <vector>
 #include <numeric>

Packages/Spatial_searching/examples/Spatial_searching/Example08.C

@@ -1,5 +1,5 @@
 // Approximate spatial searching: Example08.C
-// Example illustrating for each separate splitting rule
+// Example illustrating for each separate splitting rule 
 // building a kd-tree 
 
 #include <vector>
@@ -16,7 +16,7 @@
 #include <CGAL/Random.h>
 #include <CGAL/Splitting_rules.h>
 #include <CGAL/Orthogonal_priority_search.h>
-#include <CGAL/Algorithm.h>
+#include <CGAL/algorithm.h>
 
 
 

Packages/Spatial_searching/examples/Spatial_searching/ExampleC.C

@@ -6,6 +6,7 @@
 #include <iostream>
 #include <fstream> 
 
+
 #include <CGAL/Kd_tree_rectangle.h>
 #include <CGAL/Kd_tree.h>
 #include <CGAL/Kd_tree_traits_point.h>

Packages/Spatial_searching/examples/Spatial_searching/ExampleD.C

@@ -6,6 +6,7 @@
 #include <iostream>
 #include <fstream> 
 
+
 #include <CGAL/Kd_tree_rectangle.h>
 #include <CGAL/Kd_tree.h>
 #include <CGAL/Kd_tree_traits_point.h>

Packages/Spatial_searching/include/CGAL/General_priority_search.h

@@ -72,7 +72,7 @@ class Cell
 typedef typename Tree_traits::Item_with_distance Item_with_distance;
 typedef std::pair<Cell*,NT> Cell_with_distance;
 
-// this forward declaration causes problems for g++ 
+// this forward declaration may problems for g++ 
 class iterator;
 
 
@@ -140,7 +140,7 @@ class iterator;
     }
 
     // copy constructor
-    iterator(iterator& Iter) {
+    iterator(const iterator& Iter) {
         Ptr_implementation = Iter.Ptr_implementation;
         if (Ptr_implementation != 0) Ptr_implementation->reference_count++;
     }

Packages/Spatial_searching/include/CGAL/Orthogonal_priority_search.h

@@ -45,7 +45,7 @@ typedef Kd_tree<Traits> Tree;
 typedef typename Traits::Item_with_distance Item_with_distance;
 typedef std::pair<Node*,NT> Node_with_distance;
 
-private:
+
 
 // this forward declaration may cause problems for g++ 
 class iterator;
@@ -121,7 +121,7 @@ class iterator;
     }
 
     // copy constructor
-    iterator(iterator& Iter) {
+    iterator(const iterator& Iter) {
         Ptr_implementation = Iter.Ptr_implementation;
         if (Ptr_implementation != 0) Ptr_implementation->reference_count++;
     }