cbf4c7b6c3904b38057e689cef37baedaa10a9f9
galt
  Sat May 11 21:49:56 2019 -0700
swapping field order as requested. moving lab and data_set_id further down in the list.

diff --git src/hg/cirm/cdw/cdwWebBrowse/cdwWebBrowse.c src/hg/cirm/cdw/cdwWebBrowse/cdwWebBrowse.c
index 4bc8ae3..cabc515b 100644
--- src/hg/cirm/cdw/cdwWebBrowse/cdwWebBrowse.c
+++ src/hg/cirm/cdw/cdwWebBrowse/cdwWebBrowse.c
@@ -58,31 +58,31 @@
 /* Print out keys in hash alphabetically. */
 {
 struct hashEl *list, *el;
 list = hashElListHash(hash);
 slSort(&list, hashElCmp);
 printf("%s:\n", label);
 for (el = list; el != NULL; el = el->next)
     printf("    %s\n", el->name);
 hashElFreeList(&list);
 }
 
 // fields/columns of the browse file table
 char *fileTableFields = NULL;
 char *visibleFacetFields = NULL;
 #define FILEFIELDS "file_name,file_size,ucsc_db"
-#define FILEFACETFIELDS "lab,data_set_id,species,assay,format,output,organ_anatomical_name,biosample_cell_type,read_size,sample_label"
+#define FILEFACETFIELDS "species,assay,format,output,organ_anatomical_name,lab,data_set_id,biosample_cell_type,read_size,sample_label"
 
 struct dyString *printPopularTags(struct hash *hash, int maxSize)
 /* Get all hash elements, sorted by count, and print all the ones that fit */
 {
 maxSize -= 3;  // Leave room for ...
 struct dyString *dy = dyStringNew(0);
 
 struct hashEl *hel, *helList = hashElListHash(hash);
 slSort(&helList, hashElCmpIntValDesc);
 for (hel = helList; hel != NULL; hel = hel->next)
     {
     int oldSize = dy->stringSize;
     if (oldSize != 0)
         dyStringAppend(dy, ", ");
     dyStringPrintf(dy, "%s (%d)", hel->name, ptToInt(hel->val));