[GRASS-SVN] r67157 - grass/trunk/lib/btree2

[svn_grass at osgeo.org]

Author: wenzeslaus
Date: 2015-12-15 11:37:12 -0800 (Tue, 15 Dec 2015)
New Revision: 67157

Modified:
   grass/trunk/lib/btree2/kdtree.h
Log:
keep inline comments between parentheses to be accepted by Doxygen

Tested with Doxygen 1.8.9.1.
The indent script was exectuted.


Modified: grass/trunk/lib/btree2/kdtree.h
===================================================================
--- grass/trunk/lib/btree2/kdtree.h	2015-12-15 19:29:51 UTC (rev 67156)
+++ grass/trunk/lib/btree2/kdtree.h	2015-12-15 19:37:12 UTC (rev 67157)
@@ -100,7 +100,8 @@
 
 /*! creae a new k-d tree */
 struct kdtree *kdtree_create(char ndims,        /*!< number of dimensions */
-                             int *btol);        /*!< optional balancing tolerance */
+                             int *btol  /*!< optional balancing tolerance */
+    );
 
 /*! destroy a tree */
 void kdtree_destroy(struct kdtree *t);
@@ -112,13 +113,15 @@
 int kdtree_insert(struct kdtree *t,     /*!< k-d tree */
                   double *c,    /*!< coordinates */
                   int uid,      /*!< the point's unique id */
-                  int dc);      /*!< allow duplicate coordinates */
+                  int dc        /*!< allow duplicate coordinates */
+    );
 
 /*! remove an item from the k-d tree
  * coordinates c and uid must match */
 int kdtree_remove(struct kdtree *t,     /*!< k-d tree */
                   double *c,    /*!< coordinates */
-                  int uid);     /*!< the point's unique id */
+                  int uid       /*!< the point's unique id */
+    );
 
 /*! find k nearest neighbors 
  * results are stored in uid (uids) and d (squared distances)
@@ -130,9 +133,9 @@
                int *uid,        /*!< unique ids of the neighbors */
                double *d,       /*!< squared distances to the neighbors */
                int k,           /*!< number of neighbors to find */
-               int *skip);      /*!< unique id to skip */
+               int *skip        /*!< unique id to skip */
+    );
 
-
 /*! find all nearest neighbors within distance aka radius search
  * results are stored in puid (uids) and pd (squared distances)
  * memory is allocated as needed, the calling fn must free the memory
@@ -142,7 +145,8 @@
                int **puid,      /*!< unique ids of the neighbors */
                double **pd,     /*!< squared distances to the neighbors */
                double maxdist,  /*!< radius to search around the given coordinates */
-               int *skip);      /*!< unique id to skip */
+               int *skip        /*!< unique id to skip */
+    );
 
 /*! find all nearest neighbors within range aka box search
  * the range is specified with min and max for each dimension as
@@ -153,13 +157,15 @@
 int kdtree_rnn(struct kdtree *t,        /*!< k-d tree */
                double *c,       /*!< coordinates for range */
                int **puid,      /*!< unique ids of the neighbors */
-               int *skip);      /*!< unique id to skip */
+               int *skip        /*!< unique id to skip */
+    );
 
 /*! k-d tree optimization, only useful if the tree will be heavily used
  * (more searches than items in the tree)
  * level 0 = a bit, 1 = more, 2 = a lot */
 void kdtree_optimize(struct kdtree *t,  /*!< k-d tree */
-                     int level);        /*!< optimization level */
+                     int level  /*!< optimization level */
+    );
 
 /*! initialize tree traversal
  * (re-)sets trav structure