catsim-test 0.0.5__cp313-cp313-manylinux_2_31_x86_64.whl

gecatsim/clib_build/src/getMemorySize.cpp

@@ -0,0 +1,105 @@
+// Copyright 2020, General Electric Company. All rights reserved. See https://github.com/xcist/code/blob/master/LICENSE
+
+/*
+ * 2013-11-4   Jiao Wang
+ *             modify the C code to C++ in order to be compatible with other C++ code
+ */
+
+#if defined(_WIN32)
+#include <Windows.h>
+
+#elif defined(__unix__) || defined(__unix) || defined(unix) || (defined(__APPLE__) && defined(__MACH__))
+#include <unistd.h>
+#include <sys/types.h>
+#include <sys/param.h>
+#if defined(BSD)
+#include <sys/sysctl.h>
+#endif
+
+#else
+#error "Unable to define getMemorySize( ) for an unknown OS."
+#endif
+
+
+
+/**
+ * Returns the size of physical memory (RAM) in bytes.
+ */
+long getMemorySize( )
+{
+#if defined(_WIN32) && (defined(__CYGWIN__) || defined(__CYGWIN32__))
+	/* Cygwin under Windows. ------------------------------------ */
+	/* New 64-bit MEMORYSTATUSEX isn't available.  Use old 32.bit */
+	MEMORYSTATUS status;
+	status.dwLength = sizeof(status);
+	GlobalMemoryStatus( &status );
+	return (long)status.dwTotalPhys;
+
+#elif defined(_WIN64)
+	/* Windows. ------------------------------------------------- */
+	/* Use new 64-bit MEMORYSTATUSEX, not old 32-bit MEMORYSTATUS */
+	MEMORYSTATUSEX status;
+	status.dwLength = sizeof(status);
+	GlobalMemoryStatusEx( &status );
+	return (long)status.ullTotalPhys;
+
+#elif defined(__unix__) || defined(__unix) || defined(unix) || (defined(__APPLE__) && defined(__MACH__))
+	/* UNIX variants. ------------------------------------------- */
+	/* Prefer sysctl() over sysconf() except sysctl() HW_REALMEM and HW_PHYSMEM */
+
+#if defined(CTL_HW) && (defined(HW_MEMSIZE) || defined(HW_PHYSMEM64))
+	int mib[2];
+	mib[0] = CTL_HW;
+#if defined(HW_MEMSIZE)
+	mib[1] = HW_MEMSIZE;		/* OSX. --------------------- */
+#elif defined(HW_PHYSMEM64)
+	mib[1] = HW_PHYSMEM64;		/* NetBSD, OpenBSD. --------- */
+#endif
+	int64_t size = 0;		/* 64-bit */
+#if defined(__APPLE__)
+	size_t len = sizeof( size );
+	if ( sysctl( mib, 2, &size, &len, NULL, 0 ) == 0 )
+		return (long)size;
+#else
+	long len = sizeof( size );
+	if ( sysctl( mib, 2, &size, &len, NULL, 0 ) == 0 )
+		return (long)size;
+#endif
+	return 0L;			/* Failed? */
+
+#elif defined(_SC_AIX_REALMEM)
+	/* AIX. ----------------------------------------------------- */
+	return (long)sysconf( _SC_AIX_REALMEM ) * (long)1024L;
+
+#elif defined(_SC_PHYS_PAGES) && defined(_SC_PAGESIZE)
+	/* FreeBSD, Linux, OpenBSD, and Solaris. -------------------- */
+	return (long)sysconf( _SC_PHYS_PAGES ) *
+		(long)sysconf( _SC_PAGESIZE );
+
+#elif defined(_SC_PHYS_PAGES) && defined(_SC_PAGE_SIZE)
+	/* Legacy. -------------------------------------------------- */
+	return (long)sysconf( _SC_PHYS_PAGES ) *
+		(long)sysconf( _SC_PAGE_SIZE );
+
+#elif defined(CTL_HW) && (defined(HW_PHYSMEM) || defined(HW_REALMEM))
+	/* DragonFly BSD, FreeBSD, NetBSD, OpenBSD, and OSX. -------- */
+	int mib[2];
+	mib[0] = CTL_HW;
+#if defined(HW_REALMEM)
+	mib[1] = HW_REALMEM;		/* FreeBSD. ----------------- */
+#elif defined(HW_PYSMEM)
+	mib[1] = HW_PHYSMEM;		/* Others. ------------------ */
+#endif
+	unsigned int size = 0;		/* 32-bit */
+	long len = sizeof( size );
+	if ( sysctl( mib, 2, &size, &len, NULL, 0 ) == 0 )
+		return (long)size;
+	return 0L;			/* Failed? */
+#endif /* sysctl and sysconf variants */
+
+#else
+	return 0L;			/* Unknown OS. */
+#endif
+}
+
+

gecatsim/clib_build/src/getMemorySize.h

@@ -0,0 +1,5 @@
+// Copyright 2020, General Electric Company. All rights reserved. See https://github.com/xcist/code/blob/master/LICENSE
+
+long getMemorySize();
+
+

gecatsim/clib_build/src/hull2.c

@@ -0,0 +1,77 @@
+// Copyright 2020, General Electric Company. All rights reserved. See https://github.com/xcist/code/blob/master/LICENSE
+
+/*
+
+  hull2 computes the convex hull of a finite set of points in a plane
+
+  It takes the 2D coordinates as inputs and produces a list of index values of the points on the boundary of the hull in counter clockwise order.
+
+ */
+
+struct pnt
+{
+  double x;
+  double y;
+  double tan_angle;
+  short index;
+};
+
+int compare_pts (const void *a, const void *b)
+
+{
+  const struct pnt *da = (const struct pnt *) a;
+  const struct pnt *db = (const struct pnt *) b;
+  
+  return (da[0].tan_angle > db[0].tan_angle) - (da[0].tan_angle < db[0].tan_angle);
+}
+
+int hull2(double* x,double* y,short pts,short* list)
+
+{
+  short min_index=0,i,list_length=2;
+  double min_y=y[0];
+  struct pnt *points = NULL;
+  const short one_based = 1;
+
+  for(i=1;i<pts;i++)
+    if (y[i]<min_y) 
+      {min_y=y[i];min_index=i;}
+
+  points = malloc(sizeof(struct pnt)*pts);
+  for(i=0;i<pts;i++)
+    {
+      points[i].x = x[i];
+      points[i].y = y[i];
+      points[i].index = i;
+      points[i].tan_angle = -(x[i] - x[min_index]) / (y[i] - y[min_index]);
+    }
+  points[min_index].tan_angle = -1e300;
+
+  //for(i=0;i<pts;i++) printf("angle: %1.7lf  index: %d\n\r",points[i].tan_angle,points[i].index);
+
+  qsort(points,pts,sizeof(struct pnt),compare_pts);
+
+  //for(i=0;i<pts;i++) printf("angle: %1.7lf  index: %d\n\r",points[i].tan_angle,points[i].index);
+
+  list[0]=0;list[1]=1;
+  
+  for(i=2;i<pts;i++)
+    {
+      while ((list_length >= 2) && (((points[list[list_length-1]].x - points[list[list_length-2]].x) * (points[i].y - points[list[list_length-2]].y) - (points[list[list_length-1]].y - points[list[list_length-2]].y) * (points[i].x - points[list[list_length-2]].x)) <= 0))
+	  list_length--;
+      list[list_length] = i;
+      list_length++;
+    }
+  for(i=0;i<list_length;i++)
+    list[i] = points[list[i]].index + one_based;
+
+  free(points);
+  return (int) list_length;
+
+}
+
+
+// gcc -shared -fPIC -O3 -mfpmath=sse -msse -o hull2.so hull2.c
+// gcc -shared -fPIC -O3 -mfpmath=sse -msse -m32 -o hull2.so hull2.c
+
+

gecatsim/clib_build/src/intersections.c

@@ -0,0 +1,131 @@
+// Copyright 2020, General Electric Company. All rights reserved. See https://github.com/xcist/code/blob/master/LICENSE
+
+void intersections(int *objlist,int lol,double *a,double *alpha,double maxD,double *mb)
+
+{
+  int i,n,p11,j,pri_list[lol*2],mat_list[lol*2],num_int=0,out,*ibuff,sp,ep,lm,*ien,*ist,ibuffs,p,ip,nn,ii;
+  double tc2[4],a0[3],st_list[lol*2],en_list[lol*2],den_list[lol*2],lc,ld,*el,*sl;  //[lol*2] used to be [50]
+
+  //  printf("objlist: %d lol: %d a=[%lf %lf %lf] alpha=[%lf %lf %lf] maxD: %lf mb[0]: %lf\n",objlist[0],lol,a[0],a[1],a[2],alpha[0],alpha[1],alpha[2],maxD,mb[0]);
+  for(n=0;n<lol;n++){
+    i=objlist[n];         // Loop over objects of interest
+    //    if((i==4)&&(prnt)) pnt=1; else pnt=0;
+    p11=idatavec[1][i];
+    for(j=0;j<3;j++) a0[j]=(a[j]-datavec[5][i*3+j]);              // vector pointing from obj. center to src
+    for(j=0;j<4;j++) tc2[j]=0.0;
+    if((p11!=3)&&(p11!=7))                  // If not a torus or vessel segment
+      out=quadratic_intersect(a0,alpha,p11,tc2,i);
+    else                                   // The torus ca$e requires solving a quartic
+      out=quartic_intersect(a0,alpha,tc2,i);
+    //if((pnt)&&(tc2[0]>100.0))
+    //  printf("Intersection points for object 5, module 181:\r\n   %1.12lf   %1.12lf\r\n\r\n",tc2[0],tc2[1]);
+    //if (out!=0) {for(ii=0;ii<out;ii++) printf("%1.12lf  ",tc2[ii]); printf("\r\n");}
+    if(out)        // At least part of the ray is inside the quadratic/quartic surface
+      num_int=clip_all(a,alpha,maxD,tc2,out,st_list,en_list,den_list,pri_list,mat_list,num_int,i);
+  }                            // Loop over objects is done
+  //printf("%d\r\n",num_int);
+
+  if(num_int){
+    ien=malloc(sizeof(double)*num_int);
+    ist=malloc(sizeof(double)*num_int);
+    el=malloc(sizeof(double)*num_int);
+    sl=malloc(sizeof(double)*(num_int+1));
+    ibuff=malloc(sizeof(int)*num_int);
+    for(i=0;i<num_int;i++) ibuff[i]=0;
+  //printf("a%d\r\n",num_int);
+    if (num_int>1){
+      for(i=0;i<num_int;i++) {ien[i]=i;ist[i]=i;}
+      vector=en_list;//for(i=0;i<num_int;i++) printf("en_vector: %1.12f\r\n",vector[i]);
+      qsort(ien,num_int,sizeof(int),comp);
+      vector=st_list;//for(i=0;i<num_int;i++) printf("st_vector: %1.12f\r\n",vector[i]);
+      qsort(ist,num_int,sizeof(int),comp);
+      for(i=0;i<num_int;i++) 
+	{
+	  el[i]=en_list[ien[i]];sl[i]=st_list[ist[i]];
+	  //printf("sl %1.12lf  el %1.12lf  ist: %d  ien: %d\r\n",sl[i],el[i],ist[i],ien[i]);
+	  //if (i>0) if(sl[i]<sl[i-1]) printf("ERROR!! %1.12lf\r\n",a0[10000]);
+	}
+      //printf("b%d\r\n",num_int);
+    }
+    else {
+      sl[0]=st_list[0];
+      el[0]=en_list[0];
+      ien[0]=0;
+      ist[0]=0;
+    }
+    //printf("c%d\r\n",num_int);
+    sl[num_int]=el[num_int-1]+1;
+    sp=0;ep=0;lc=0;ld=0;lm=1;ibuffs=0;                 // sp points to the current interval start
+                                                               // ep points to the current interval End
+							       // lc : last change (transition from one object to another)
+							       // ld : last density
+							       // lm : last material
+    //printf("d%d\r\n",num_int);
+    while(ep<num_int){
+      //printf("E  %1.12lf  %1.12lf  %1.12lf  %d  %d\r\n",sl[0],el[0],sl[1],sp,ep);
+      if (sl[sp]<el[ep]){
+	//printf("f%d\r\n",num_int);
+	p=ist[sp];
+	// push into ibuff
+	ip=0;
+	while(ibuffs>ip){
+	  if(pri_list[p]>pri_list[ibuff[ip]]) 
+	    break;
+	  ip++;
+	}
+	for(i=ibuffs;i>ip;i--) ibuff[i]=ibuff[i-1];
+	ibuff[ip]=p;
+	ibuffs++;
+	//for(i=0;i<ibuffs;i++) printf("Ibuff: %d\n\r",ibuff[i]);
+	if(ip==0) {
+	  mb[lm-1]=mb[lm-1]+ld*(st_list[p]-lc);
+	  lc=st_list[p];
+	  ld=den_list[p];
+	  lm=mat_list[p];
+	}
+	sp++;
+      }
+      else {
+	//printf("g%d\r\n",num_int);
+	//printf("g%d%d\r\n",num_int,ibuff[0]);
+	p=ien[ep];
+	// pull out of ibuff
+	ip=0;
+  //printf("h%d %d\r\n",p,ibuffs);
+  //for(i=0;i<ibuffs;i++) printf("ibuff/w: %d\n\r",ibuff[i]);
+	while(ibuff[ip]!=p) ip++;
+  //printf("i%d\r\n",num_int);
+	for(i=ip;i<(ibuffs-1);i++) ibuff[i]=ibuff[i+1];
+  //printf("j%d\r\n",num_int);
+	ibuffs--;
+	//for(i=0;i<ibuffs;i++) printf("ibuff/wo: %d\n\r",ibuff[i]);
+  //printf("k%d\r\n",num_int);
+	if(ip==0){
+  //printf("l   %1.12lf %d %1.12lf %1.12lf %d %1.12lf\r\n",mb[0],lm,ld,en_list[0],p,lc);
+	  mb[lm-1]=mb[lm-1]+ld*(en_list[p]-lc);
+	  //	  printf("ld: %1.12lf diff: %1.12lf\r\n",ld,en_list[p]-lc);
+  //printf("m%d\r\n",num_int);
+	  lc=en_list[p];
+  //printf("n%d\r\n",num_int);
+	  if(ibuffs) {
+  //printf("o%d\r\n",num_int);
+	    ld=den_list[ibuff[0]];
+  //printf("p%d\r\n",num_int);
+	    lm=mat_list[ibuff[0]];
+  //printf("q%d\r\n",num_int);
+	  }
+	  else
+	    ld=0;  // lm shouldn't matter when ld=0 so we leave it alone
+	}
+	ep++;
+      }
+    }
+    free(ien);
+    free(ist);
+    free(el);
+    free(sl);
+    free(ibuff);
+  }
+}
+
+

gecatsim/clib_build/src/label.h

@@ -0,0 +1,10 @@
+// Copyright 2020, General Electric Company. All rights reserved. See https://github.com/xcist/code/blob/master/LICENSE
+
+#ifndef __LABEL_H__
+#define __LABEL_H__
+
+
+char *pLabel = "Program Name: libcatsim Organization: GE Research Copyright 2020, General Electric Company. All rights reserved. See https://github.com/xcist/code/blob/master/LICENSE";
+
+#endif
+