static boolean mdbSelectsAddFoundComposites(struct slPair **pMdbSelects,struct trackDb *tdbsFound)
// Adds a composite mdbSelect (if found in tdbsFound) to the head of the pairs list.
// If tdbsFound is NULL, then add dummy composite search criteria
{
// create comma separated list of composites
struct dyString *dyComposites = dyStringNew(256);
struct trackDb *tdb = tdbsFound;
for (;tdb != NULL; tdb = tdb->next)
{
if (tdbIsComposite(tdb))
dyStringPrintf(dyComposites,"%s,",tdb->track);
else if (tdbIsCompositeChild(tdb))
{
struct trackDb *composite = tdbGetComposite(tdb);
dyStringPrintf(dyComposites,"%s,",composite->track);
}
}
if (dyStringLen(dyComposites) > 0)
{
char *composites = dyStringCannibalize(&dyComposites);
composites[strlen(composites) - 1] = '\0'; // drop the last ','
slPairAdd(pMdbSelects,MDB_VAR_COMPOSITE,composites);
// Composite should not already be in the list, because it is only indirectly sortable
return TRUE;
}
//warn("No composites found");
dyStringFree(&dyComposites);
return FALSE;
}
static int addDownloadOnlyTracks(char *db,struct group **pGroupList,struct track **pTrackList)
// Download only tracks are not normaly incorporated into the grou and track lists
{
int count = 0;
struct track *track = NULL;
struct group *group = NULL;
struct trackDb *tdbList = hTrackDb(db);
struct trackDb *tdb = tdbList;
for (;tdb != NULL; tdb = tdb->next)
{
if (!tdbIsDownloadsOnly(tdb)
|| tdbIsFolderContent(tdb)
|| tdbIsCompositeChild(tdb))
continue;
// Must find group
if (tdb->grp == NULL)
continue;
for (group = *pGroupList;group != NULL; group = group->next)
{
if (sameWord(group->name,tdb->grp))
break;
}
if (group == NULL)
continue;
// Make the track
track = trackFromTrackDb(tdb);
track->group = group;
track->groupName = cloneString(group->name);
slAddHead(pTrackList,track);
count++;
}
if (count > 0)
{
// Going to have to make all new group->trackLists
slSort(pGroupList, gCmpPriority);
for (group = *pGroupList;group != NULL; group = group->next)
slFreeList(&group->trackList);
// Sort the tracks anew and add each on into it's group.
slSort(pTrackList, tgCmpPriority);
for (track = *pTrackList; track != NULL; track = track->next)
{
struct trackRef *tr;
AllocVar(tr);
tr->track = track;
slAddHead(&track->group->trackList, tr);
}
/* Straighten things out, clean up, and go home. */
for (group = *pGroupList;group != NULL; group = group->next)
slReverse(&group->trackList);
}
return count;
}
static void pubsMapItem(struct track *tg, struct hvGfx *hvg, void *item,
char *itemName, char *mapItemName, int start, int end,
int x, int y, int width, int height)
/* create mouse over with title for pubs blat features. */
{
if (!theImgBox || tg->limitedVis != tvDense || !tdbIsCompositeChild(tg->tdb))
{
struct linkedFeatures *lf = item;
pubsAddExtra(tg, lf);
struct pubsExtra* extra = lf->extra;
char *mouseOver = NULL;
if (extra != NULL)
mouseOver = extra->mouseOver;
else
mouseOver = itemName;
mapBoxHc(hvg, start, end, x, y, width, height, tg->track, mapItemName, mouseOver);
}
}
static struct slRef *advancedSearchForTracks(struct sqlConnection *conn,struct group *groupList,
char *nameSearch, char *typeSearch, char *descSearch,
char *groupSearch, struct slPair *mdbPairs)
// Performs the advanced search and returns the found tracks.
{
int tracksFound = 0;
struct slRef *tracks = NULL;
int numMetadataNonEmpty = 0;
struct slPair *pair = mdbPairs;
for (; pair!= NULL;pair=pair->next)
{
if (!isEmpty((char *)(pair->val)))
numMetadataNonEmpty++;
}
if (!isEmpty(groupSearch) && sameString(groupSearch,ANYLABEL))
groupSearch = NULL;
if (!isEmpty(typeSearch) && sameString(typeSearch,ANYLABEL))
typeSearch = NULL;
if (isEmpty(nameSearch) && isEmpty(typeSearch) && isEmpty(descSearch)
&& isEmpty(groupSearch) && numMetadataNonEmpty == 0)
return NULL;
// First do the metaDb searches, which can be done quickly for all tracks with db queries.
struct hash *matchingTracks = NULL;
if (numMetadataNonEmpty)
{
struct mdbObj *mdbObj, *mdbObjs = mdbObjRepeatedSearch(conn,mdbPairs,TRUE,FALSE);
if (mdbObjs)
{
for (mdbObj = mdbObjs; mdbObj != NULL; mdbObj = mdbObj->next)
{
if (matchingTracks == NULL)
matchingTracks = newHash(0);
hashAddInt(matchingTracks, mdbObj->obj, 1);
}
mdbObjsFree(&mdbObjs);
}
if (matchingTracks == NULL)
return NULL;
}
// Set the word lists up once
struct slName *nameList = NULL;
if (!isEmpty(nameSearch))
nameList = slNameListOfUniqueWords(cloneString(nameSearch),TRUE); // TRUE means respect quotes
struct slName *descList = NULL;
if (!isEmpty(descSearch))
descList = slNameListOfUniqueWords(cloneString(descSearch),TRUE);
struct group *group;
for (group = groupList; group != NULL; group = group->next)
{
if (isEmpty(groupSearch) || sameString(group->name, groupSearch))
{
if (group->trackList == NULL)
continue;
struct trackRef *tr;
for (tr = group->trackList; tr != NULL; tr = tr->next)
{
struct track *track = tr->track;
char *trackType = cloneFirstWord(track->tdb->type); // will be spilled
if ((matchingTracks == NULL || hashLookup(matchingTracks, track->track) != NULL)
&& ( isEmpty(typeSearch)
|| (sameWord(typeSearch, trackType) && !tdbIsComposite(track->tdb)))
&& (isEmpty(nameSearch) || searchNameMatches(track->tdb, nameList))
&& (isEmpty(descSearch) || searchDescriptionMatches(track->tdb, descList)))
{
if (track != NULL)
{
tracksFound++;
refAdd(&tracks, track);
}
else
warn("found group track is NULL.");
}
if (track->subtracks != NULL)
{
struct track *subTrack;
for (subTrack = track->subtracks; subTrack != NULL; subTrack = subTrack->next)
{
trackType = cloneFirstWord(subTrack->tdb->type); // will be spilled
if ( (matchingTracks == NULL
|| hashLookup(matchingTracks, subTrack->track) != NULL)
&& (isEmpty(typeSearch) || sameWord(typeSearch, trackType))
&& (isEmpty(nameSearch) || searchNameMatches(subTrack->tdb, nameList))
&& (isEmpty(descSearch) // subtracks inherit description
|| searchDescriptionMatches(subTrack->tdb, descList)
|| (tdbIsCompositeChild(subTrack->tdb) && subTrack->parent
&& searchDescriptionMatches(subTrack->parent->tdb, descList))))
{
if (track != NULL)
{
tracksFound++;
refAdd(&tracks, subTrack);
}
else
warn("found subtrack is NULL.");
}
}
}
}
}
}
return tracks;
}
