1 files changed, 0 insertions, 124 deletions
diff --git a/test/ccured_olden/tsp/build.c b/test/ccured_olden/tsp/build.c
deleted file mode 100644
index 090439bc..00000000
--- a/test/ccured_olden/tsp/build.c
+++ /dev/null
@@ -1,124 +0,0 @@
-/* build.c
- *
- * By:  Martin C. Carlisle
- *      Princeton University
- *      6/24/94
- * 
- * builds a two-dimensional tree for TSP
- * 
- * distribution of median is given by modification of exponential to
- * be [-1,1]
- */ 
-
-#include <stdio.h>
-
-extern double drand48();
-extern void srand48(long seedval);
-extern double exp(double x);
-extern double log(double x);
-#define  M_E      2.7182818284590452354
-#define  M_E2     7.3890560989306502274
-#define  M_E3     20.08553692318766774179
-#define M_E6 403.42879349273512264299
-#define M_E12 162754.79141900392083592475
-#ifndef NULL
-#define NULL 0
-#endif
-
-#include "tsp.h"
-#include <stdlib.h>
-
-#ifndef PLAIN
-#include "mem-ref.h"
-#ifdef FUTURES
-#include "future-cell.h"
-#endif
-#endif
-
-static double median(double min,double max,int n);
-static double uniform(double min, double max);
-
-double drand48(void) {
-  return (double)rand() / (double)RAND_MAX;
-}
-
-/* Return an estimate of median of n values distributed in [min,max) */
-static double median(double min,double max,int n) {
-  double t;
-  double retval;
-  
-  t = drand48(); /* in [0.0,1.0) */
-  if (t>0.5) {
-    retval=log(1.0-(2.0*(M_E12-1)*(t-0.5)/M_E12))/12.0;   
-    }
-  else {
-    retval=-log(1.0-(2.0*(M_E12-1)*t/M_E12))/12.0;
-    }
-  /* We now have something distributed on (-1.0,1.0) */
-  retval = (retval+1.0) * (max-min)/2.0;
-  retval = retval + min;
-  return retval;
-}
-
-/* Get double uniformly distributed over [min,max) */
-static double uniform(double min, double max) {
-  double retval;
-  
-  retval = drand48(); /* in [0.0,1.0) */
-  retval = retval * (max-min);
-  return retval + min;
-}
-
-/* Builds a 2D tree of n nodes in specified range with dir as primary 
-   axis (0 for x, 1 for y) */
-// post:
-//   if n!=0, make a node, set its left & right to valid or null,
-//   set next/prev to null; if n==0 return null
-Tree build_tree(int n,int dir,int lo,int num_proc,double min_x,
-                double max_x,double min_y,double max_y) {
-  double med;
-  Tree t;
-#ifdef FUTURES
-  future_cell_int fc;
-#endif
-
-  if (n==0) return NULL;
-
-  t = (Tree) malloc(sizeof(*t));
-  if (dir) {
-    dir = !dir;
-    med = median(min_x,max_x,n);
-#ifndef FUTURES
-    t->left=build_tree(n/2,dir,lo+num_proc/2,num_proc/2,min_x,med,min_y,max_y);
-    t->right=build_tree(n/2,dir,lo,num_proc/2,med,max_x,min_y,max_y);
-#else
-    FUTURE(n/2,dir,lo+num_proc/2,num_proc/2,min_x,med,min_y,max_y,
-           build_tree,&fc);
-    t->right=build_tree(n/2,dir,lo,num_proc/2,med,max_x,min_y,max_y);
-#endif
-    t->x = med;
-    t->y = uniform(min_y,max_y);
-    }
-  else {
-    dir = !dir;
-    med = median(min_y,max_y,n);
-#ifndef FUTURES
-    t->left=build_tree(n/2,dir,lo+num_proc/2,num_proc/2,min_x,max_x,min_y,med);
-    t->right=build_tree(n/2,dir,lo,num_proc/2,min_x,max_x,med,max_y);
-#else
-    FUTURE(n/2,dir,lo+num_proc/2,num_proc/2,min_x,max_x,min_y,med,
-           build_tree,&fc);
-    t->right=build_tree(n/2,dir,lo,num_proc/2,min_x,max_x,med,max_y);
-#endif
-    t->y = med;
-    t->x = uniform(min_x,max_x);
-    }
-  t->sz = n;
-  t->next = NULL;
-  t->prev = NULL;
-#ifdef FUTURES
-  TOUCH(&fc);
-  t->left = (Tree) fc.value;
-#endif
-  return t;
-}