033a7cd10442ee88f63ca9d0778c33530e058021
kent
  Tue Apr 5 15:27:41 2011 -0700
Moving routine to find next on list with a different chromosome to library since it keeps coming up.
diff --git src/inc/basicBed.h src/inc/basicBed.h
index 69efc8f..b52fba8 100644
--- src/inc/basicBed.h
+++ src/inc/basicBed.h
@@ -202,30 +202,33 @@
 /* Get size of all parts of all exons between rangeStart and rangeEnd. */
 
 struct bed *bedFromPsl(struct psl *psl);
 /* Convert a single psl to a bed structure */
 
 void makeItBed12(struct bed *bedList, int numFields);
 /* If it's less than bed 12, make it bed 12. The numFields */
 /* param is for how many fields the bed *currently* has. */
 
 struct bed *cloneBed(struct bed *bed);
 /* Make an all-newly-allocated copy of a single bed record. */
 
 struct bed *cloneBedList(struct bed *bed);
 /* Make an all-newly-allocated list copied from bed. */
 
+struct bed *bedListNextDifferentChrom(struct bed *bedList);
+/* Return next bed in list that is from a different chrom than the start of the list. */
+
 struct bed *lmCloneBed(struct bed *bed, struct lm *lm);
 /* Make a copy of bed in local memory. */
 
 struct bed *bedCommaInN(char **pS, struct bed *ret, int fieldCount);
 /* Create a bed out of a comma separated string looking for fieldCount
  * fields. This will fill in ret if non-null, otherwise will return a
  * new bed */
 
 struct hash *readBedToBinKeeper(char *sizeFileName, char *bedFileName, int wordCount);
 /* Read a list of beds and return results in hash of binKeeper structure for fast query
  * See also bedsIntoKeeperHash, which takes the beds read into a list already, but
  * dispenses with the need for the sizeFile. */
 
 int bedParseRgb(char *itemRgb);
 /*	parse a string: "r,g,b" into three unsigned char values