3a8cb4fa0dcee679f52e45dd8d407c8eebe9c9ba
ceisenhart
  Mon Mar 7 13:06:27 2016 -0800
Changed the underlying library file and had to update this program. The program will run the same, now it passes an extra NULL into one of the library functions.

diff --git src/utils/bigWigCluster/bigWigCluster.c src/utils/bigWigCluster/bigWigCluster.c
index f2d0a4b..00eecae 100644
--- src/utils/bigWigCluster/bigWigCluster.c
+++ src/utils/bigWigCluster/bigWigCluster.c
@@ -366,31 +366,31 @@
 struct hash *distanceHash = hashNew(0);
 char *precalcFile = optionVal("precalc", NULL);
 if (precalcFile)
     preloadDistances(precalcFile, list, distanceHash);
 
 /* Supply better labels if they exist */
 char *labelFile = optionVal("labels", NULL);
 if (labelFile)
     addLabels(labelFile, list);
 
 struct hacTree *clusters;
 struct lm *localMem = lmInit(0);
 if (gThreadCount > 1)
     {
     clusters = hacTreeMultiThread(gThreadCount, (struct slList *)list, localMem,
-					    slBigWigDistance, slBigWigMerge, chromSizes, distanceHash);
+					    slBigWigDistance, slBigWigMerge, NULL, chromSizes, distanceHash);
     }
 else
     {
     /* Use older code for single threaded case, just to be able to compare results to
      * parallelized version */
     clusters = hacTreeFromItems((struct slList *)list, localMem,
 					    slBigWigDistance, slBigWigMerge, NULL, chromSizes);
     }
 
 /* Convert tree to ordered list, do coloring, and make outputs */
 struct slRef *orderedList = getOrderedLeafList(clusters);
 colorLeaves(orderedList, distanceHash);
 printHierarchicalJson(outputJson, clusters, 20, 20);
 printOrderedTab(outputTab, orderedList);