Index: trunk/Ohana/src/opihi/dvo/dvomisc.c
===================================================================
--- trunk/Ohana/src/opihi/dvo/dvomisc.c	(revision 7680)
+++ trunk/Ohana/src/opihi/dvo/dvomisc.c	(revision 16040)
@@ -33,110 +33,2 @@
 
 }
-
-/* values are ave[i].R, ave[i].D, ave[i].M */
-void sortave (Average *ave, int N) {
-
-  int l,j,ir,i;
-  Average tmp;
-
-  if (N < 2) return;
-  l = N >> 1;
-  ir = N - 1;
-  for (;;) {
-    if (l > 0) {
-      l--;
-      tmp = ave[l];
-    }
-    else {
-      tmp = ave[ir];
-      ave[ir] = ave[0];
-      if (--ir == 0) {
-	ave[0] = tmp;
-	return;
-      }
-    }
-    i = l;
-    j = (l << 1) + 1;
-    while (j <= ir) {
-      if (j < ir && ave[j].R < ave[j+1].R) j++;
-      if (tmp.R < ave[j].R) {
-	ave[i] = ave[j];
-	j += (i=j) + 1;
-      }
-      else j = ir + 1;
-    }
-    ave[i] = tmp;
-  }
-}
-
-/** this does not seem to be used at the moment */
-/* values are ave[i].R, ave[i].D, ave[i].M */
-void sort_images (Image *image, int N) {
-
-  int l,j,ir,i;
-  Image tmp;
-
-  if (N < 2) return;
-  l = N >> 1;
-  ir = N - 1;
-  for (;;) {
-    if (l > 0) {
-      l--;
-      tmp = image[l];
-    }
-    else {
-      tmp = image[ir];
-      image[ir] = image[0];
-      if (--ir == 0) {
-	image[0] = tmp;
-	return;
-      }
-    }
-    i = l;
-    j = (l << 1) + 1;
-    while (j <= ir) {
-      if (j < ir && image[j].tzero < image[j+1].tzero) j++;
-      if (tmp.tzero < image[j].tzero) {
-	image[i] = image[j];
-	j += (i=j) + 1;
-      }
-      else j = ir + 1;
-    }
-    image[i] = tmp;
-  }
-}
-
-/* sort subset by image[subset[i]].tzero */
-void sort_image_subset (Image *image, int *subset, int N) {
-
-  int l, j, ir, i, tmp;
-
-  if (N < 2) return;
-  l = N >> 1;
-  ir = N - 1;
-  for (;;) {
-    if (l > 0) {
-      l--;
-      tmp = subset[l];
-    }
-    else {
-      tmp = subset[ir];
-      subset[ir] = subset[0];
-      if (--ir == 0) {
-	subset[0] = tmp;
-	return;
-      }
-    }
-    i = l;
-    j = (l << 1) + 1;
-    while (j <= ir) {
-      if (j < ir && image[subset[j]].tzero < image[subset[j+1]].tzero) j++;
-      if (image[tmp].tzero < image[subset[j]].tzero) {
-	subset[i] = subset[j];
-	j += (i=j) + 1;
-      }
-      else j = ir + 1;
-    }
-    subset[i] = tmp;
-  }
-}
