9f5a3871b95f595b5a218f0d05395a8c72d58844
braney
  Tue Aug 25 12:57:10 2026 -0700
remove the bigBedOnePath fallback, leaving a single bigBed load path, refs #36940

bigBedOnePath has defaulted to on since v492 and the setting has been removed
from the hg.conf of the RR, Euro, Asia and hgwbeta.  Drop the check and the code
it guarded at all four sites: the field-count default in
bigBedAddLinkedFeaturesFromExt, the method setup in commonBigBedMethods, the
bedSize default in bigBedClick, and the bigBed case in hgc.  The two branches in
the hgc case differed only in a minimum the surviving path does not want.

complexBedMethods lost its only isBigBed=TRUE caller with that branch, so drop
the parameter.

Retire the setting from the hg.conf catalog and its gate backlog, and repair the
two hgc.c citations whose line numbers this commit shifted, refs #37925.

Verified pixel-identical: 14 scenarios rendered before and after, covering the
four QA sessions on the ticket plus mm10 knownGene, dbSnp155, rmsk,
encRegTfbsClustered, clinvar and tandemDups.  All AE=0.

diff --git src/hg/hgc/bigBedClick.c src/hg/hgc/bigBedClick.c
index 88c809a5325..1641d53466c 100644
--- src/hg/hgc/bigBedClick.c
+++ src/hg/hgc/bigBedClick.c
@@ -426,32 +426,31 @@
 if (start == end)
     {
     // item is an insertion; expand the search range from 0 bases to 2 so we catch it:
     ivStart = max(0, start-1);
     ivEnd++;
     }
 char *quickLiftFile = cloneString(trackDbSetting(tdb, "quickLiftUrl"));
 struct hash *chainHash = NULL;
 struct bigBedInterval *bbList = NULL;
 if (quickLiftFile)
     bbList = quickLiftGetIntervals(quickLiftFile, bbi, chrom, ivStart, ivEnd, &chainHash);
 else
     bbList = bigBedIntervalQuery(bbi, chrom, ivStart, ivEnd, 0, lm);
 
 /* Get bedSize if it's not already defined. */
-boolean bigBedOnePath = cfgOptionBooleanDefault("bigBedOnePath", TRUE);
-if (bigBedOnePath && (bedSize == 0))
+if (bedSize == 0)
     bedSize = bbi->definedFieldCount;
 
 char *scoreFilter = cartOrTdbString(cart, tdb, "scoreFilter", NULL);
 int minScore = 0;
 if (scoreFilter)
     minScore = atoi(scoreFilter);
 
 /* Find particular item in list - matching start, and item if possible. */
 boolean found = FALSE;
 boolean firstTime = TRUE;
 struct bigBedInterval *bb;
 for (bb = bbList; bb != NULL; bb = bb->next)
     {
     if (bedSize > 3)
 	{