bd3510d7039cd79ca3286a197d48366cba918e34
kent
  Fri Jan 7 15:46:25 2011 -0800
Removing some ugly debugging statements.
diff --git src/hg/lib/hdb.c src/hg/lib/hdb.c
index 6c0bac9..bc2582e 100644
--- src/hg/lib/hdb.c
+++ src/hg/lib/hdb.c
@@ -3645,51 +3645,49 @@
     theTdbs = hTrackDb(db);
     if (tdbList != NULL)
         *tdbList = theTdbs;
     }
 else
     theTdbs = *tdbList;
 return rFindTrack(0, theTdbs, track);
 }
 
 struct trackDb *hTrackDbForTrackAndAncestors(char *db, char *track)
 /* Load trackDb object for a track. If need be grab its ancestors too.
  * This does not load children. hTrackDbForTrack will handle children, and
  * is actually faster if being called on lots of tracks.  This function
  * though is faster on one or two tracks. */
 {
-uglyf("hTrackDbForTrackAndAncestors(%s,%s)\n", db, track);
 struct sqlConnection *conn = hAllocConn(db);
 struct trackDb *tdb = loadTrackDbForTrack(conn, track);
 struct trackDb *ancestor = tdb;
 for (;;)
     {
     /* Get name of previous generation if any handling both
      * composite and supertrack ancestor tags. */
     char *parentTrack = NULL;
     char *parent = trackDbLocalSetting(ancestor, "parent");
     if (parent != NULL)
 	parentTrack = cloneFirstWord(parent);
     if (parentTrack == NULL)
         {
 	char *super = trackDbLocalSetting(ancestor, "superTrack");
 	if (super != NULL && !startsWith("on", super))
 	    parentTrack = cloneFirstWord(super);
 	}
 
     /* If no parent we're done. */
-    uglyf("parentTrack = %s\n", parentTrack);
     if (parentTrack == NULL)
         break;
 
     ancestor->parent = loadTrackDbForTrack(conn, parentTrack);
     ancestor = ancestor->parent;
     }
 
 hFreeConn(&conn);
 return tdb;
 }
 
 struct trackDb *hCompositeTrackDbForSubtrack(char *db, struct trackDb *sTdb)
 /* Given a trackDb that may be for a subtrack of a composite track,
  * return the trackDb for the composite track if we can find it, else NULL.
  * Note: if the composite trackDb is found and returned, then its subtracks