a212eb7eab91ae337df82701af0f386c45a755f1
angie
  Thu Sep 5 12:07:09 2013 -0700
Fixing Mac OS X portability issue.
diff --git src/hg/hgTracks/snakeTrack.c src/hg/hgTracks/snakeTrack.c
index d40f41d..53b3ac7 100644
--- src/hg/hgTracks/snakeTrack.c
+++ src/hg/hgTracks/snakeTrack.c
@@ -5,31 +5,31 @@
 #include "hash.h"
 #include "localmem.h"
 #include "linefile.h"
 #include "jksql.h"
 #include "hdb.h"
 #include "hgTracks.h"
 #include "chainBlock.h"
 #include "chainLink.h"
 #include "chainDb.h"
 #include "chainCart.h"
 #include "errCatch.h"
 #include "twoBit.h"
 #include "bigWarn.h"
 #include <pthread.h>
 #include "trackHub.h"
-#include "values.h"
+#include "limits.h"
 #include "snakeUi.h"
 
 #include "halBlockViz.h"
 
 struct snakeFeature
     {
     struct snakeFeature *next;
     int start, end;			/* Start/end in browser coordinates. */
     int qStart, qEnd;			/* query start/end */
     int level;				/* level in snake */
     int orientation;			/* strand... -1 is '-', 1 is '+' */
     boolean drawn;			/* did we draw this feature? */
     char *sequence;			/* may have sequence, or NULL */
     char *qName;			/* chrom name on other species */
     };
@@ -94,31 +94,31 @@
 {
 struct snakeFeature *cb = list;
 struct snakeFeature *proposedList = NULL;
 
 if (level > maxLevel)
     maxLevel = level;
 if (level > ArraySize(Levels))
     errAbort("too many levels");
 
 if (Levels[level].init == FALSE)
     {
     // initialize the level if this is the first time we've seen it
     Levels[level].init = TRUE;
     Levels[level].orientation = list->orientation;
     if (list->orientation == -1)
-	Levels[level].edge = MAXLONG;  // bigger than the biggest chrom
+	Levels[level].edge = LONG_MAX; // bigger than the biggest chrom
     else
 	Levels[level].edge = 0;
     }
 
 // now we step through the blocks and assign them to levels
 struct snakeFeature *next;
 struct snakeFeature *insertHead = NULL;
 for(; cb; cb = next)
     {
     // we're going to add this block to a different list 
     // so keep track of the next pointer
     next = cb->next;
 
     // if this block can't fit on this level add to the insert
     // list and move on to the next block