[Ptinpoly-commits] r10 - in pkg: . src

noreply at r-forge.r-project.org noreply at r-forge.r-project.org
Tue Oct 18 02:54:43 CEST 2011


Author: jmaisog
Date: 2011-10-18 02:54:42 +0200 (Tue, 18 Oct 2011)
New Revision: 10

Modified:
   pkg/DESCRIPTION
   pkg/src/kodtree.h
Log:
Fixed 'const' declarations in class KODTREE, which was causing Solaris build on CRAN to fail.

Modified: pkg/DESCRIPTION
===================================================================
--- pkg/DESCRIPTION	2011-10-16 17:52:26 UTC (rev 9)
+++ pkg/DESCRIPTION	2011-10-18 00:54:42 UTC (rev 10)
@@ -1,7 +1,7 @@
 Package: ptinpoly
 Title: Point-In-Polyhedron Test (2D and 3D)
 Version: 2.0
-Date: 2011-10-16
+Date: 2011-10-17
 Author: Jose M. Maisog, Yuan Wang, George Luta, Jianfei Liu
 Maintainer: Jose M. Maisog <bravas02 at gmail.com>
 Description: This library provides a function 'pip3d', which tests whether a point in 3D space is

Modified: pkg/src/kodtree.h
===================================================================
--- pkg/src/kodtree.h	2011-10-16 17:52:26 UTC (rev 9)
+++ pkg/src/kodtree.h	2011-10-18 00:54:42 UTC (rev 10)
@@ -37,9 +37,9 @@
 	typedef void (*Funcpointofvert)(Point p,void *v);
 	typedef bool (*Funcexinfoshouldbeincell)(void *info, int infotype, CellNode3D *cnode);
 	typedef bool (*Funcexinfooverlapbox) (void *info, int infotype, const Box &bd,double epsi);
-	Kodtree(const Box &bd,Funcpointofvert pofv, const int capacity=10,double epsi=0);
-	Kodtree(void **vti, int numvi,Funcpointofvert pofv,const int capacity=10,double epsi=0);
-	Kodtree(void **vti, int numvi,const Box &bd,Funcpointofvert pofv, const int capacity=10,double epsi=0);
+	Kodtree(const Box &bd,Funcpointofvert pofv, int capacity=10,double epsi=0);
+	Kodtree(void **vti, int numvi,Funcpointofvert pofv, int capacity=10,double epsi=0);
+	Kodtree(void **vti, int numvi,const Box &bd,Funcpointofvert pofv, int capacity=10,double epsi=0);
 	~Kodtree();
 	CellNode3D *getRoot(void){ return root;}
 	WpVert *insertVert(void *v){



More information about the Ptinpoly-commits mailing list