eea5c3f688ba673e4a7af3d3a9441690aaaeeb2e tdreszer Tue Aug 10 16:43:07 2010 -0700 Removed the CB_SELECTION ifndefs diff --git src/hg/hgTracks/searchTracks.c src/hg/hgTracks/searchTracks.c index 25071b9..b5a7f79 100644 --- src/hg/hgTracks/searchTracks.c +++ src/hg/hgTracks/searchTracks.c @@ -1,664 +1,638 @@ /* Track search code used by hgTracks CGI */ #include "common.h" #include "searchTracks.h" #include "hCommon.h" #include "memalloc.h" #include "obscure.h" #include "dystring.h" #include "hash.h" #include "cheapcgi.h" #include "hPrint.h" #include "htmshell.h" #include "cart.h" #include "hgTracks.h" #include "web.h" #include "jksql.h" #include "hdb.h" #include "trix.h" #include "jsHelper.h" static char const rcsid[] = "$Id: searchTracks.c,v 1.11 2010/06/11 18:21:40 larrym Exp $"; #define ANYLABEL "Any" #define METADATA_NAME_PREFIX "hgt.metadataName" #define METADATA_VALUE_PREFIX "hgt.metadataValue" static int gCmpGroup(const void *va, const void *vb) /* Compare groups based on label. */ { const struct group *a = *((struct group **)va); const struct group *b = *((struct group **)vb); return strcmp(a->label, b->label); } static int gCmpTrack(const void *va, const void *vb) /* Compare tracks based on longLabel. */ { const struct slRef *aa = *((struct slRef **)va); const struct slRef *bb = *((struct slRef **)vb); const struct track *a = ((struct track *) aa->val); const struct track *b = ((struct track *) bb->val); return strcmp(a->longLabel, b->longLabel); } // XXXX make a matchString function to support "contains", "is" etc. and wildcards in contains // ((sameString(op, "is") && !strcasecmp(track->shortLabel, str)) || static boolean isNameMatch(struct track *track, char *str, char *op) { return str && strlen(str) && ((sameString(op, "is") && !strcasecmp(track->shortLabel, str)) || (sameString(op, "is") && !strcasecmp(track->longLabel, str)) || (sameString(op, "contains") && containsStringNoCase(track->shortLabel, str) != NULL) || (sameString(op, "contains") && containsStringNoCase(track->longLabel, str) != NULL)); } static boolean isDescriptionMatch(struct track *track, char **words, int wordCount) // We parse str and look for every word at the start of any word in track description (i.e. google style). { if(words) { // We do NOT lookup up parent hierarchy for html descriptions. char *html = track->tdb->html; if(!isEmpty(html)) { /* This probably could be made more efficient by parsing the html into some kind of b-tree, but I am assuming that the inner html loop while only happen for 1-2 words for vast majority of the tracks. */ int i, numMatches = 0; html = stripRegEx(html, "<[^>]*>", REG_ICASE); for(i = 0; i < wordCount; i++) { char *needle = words[i]; char *haystack, *tmp = cloneString(html); boolean found = FALSE; while((haystack = nextWord(&tmp))) { char *ptr = strstrNoCase(haystack, needle); if(ptr != NULL && ptr == haystack) { found = TRUE; break; } } if(found) numMatches++; else break; } if(numMatches == wordCount) return TRUE; } } return FALSE; } static int getTermArray(struct sqlConnection *conn, char ***terms, char *type) // Pull out all term fields from ra entries with given type // Returns count of items found and items via the terms argument. { struct sqlResult *sr = NULL; char **row = NULL; char query[256]; struct slName *termList = NULL; int i, count = 0; char **retVal; safef(query, sizeof(query), "select distinct val from metaDb where var = '%s'", type); sr = sqlGetResult(conn, query); while ((row = sqlNextRow(sr)) != NULL) { slNameAddHead(&termList, row[0]); count++; } sqlFreeResult(&sr); slSort(&termList, slNameCmpCase); count++; // make room for "Any" AllocArray(retVal, count); retVal[0] = cloneString(ANYLABEL); for(i = 1; termList != NULL;termList = termList->next, i++) { retVal[i] = cloneString(termList->name); } *terms = retVal; return count; } static struct slName *metaDbSearch(struct sqlConnection *conn, char *name, char *val, char *op) // Search the assembly's metaDb table for var; If name == NULL, we search every metadata field. // Search is via mysql, so it's case-insensitive. { struct slName *retVal = NULL; char query[256]; struct sqlResult *sr = NULL; char **row = NULL; if(sameString(op, "contains")) if(name == NULL) safef(query, sizeof(query), "select obj from metaDb where val like '%%%s%%'", val); else safef(query, sizeof(query), "select obj from metaDb where var = '%s' and val like '%%%s%%'", name, val); else if(name == NULL) safef(query, sizeof(query), "select distinct obj from metaDb where val = '%s'", val); else safef(query, sizeof(query), "select obj from metaDb where var = '%s' and val = '%s'", name, val); sr = sqlGetResult(conn, query); while ((row = sqlNextRow(sr)) != NULL) { slNameAddHead(&retVal, row[0]); } sqlFreeResult(&sr); return retVal; } static int metaDbVars(struct sqlConnection *conn, char *** metaValues) // Search the assemblies metaDb table; If name == NULL, we search every metadata field. { char query[256]; struct sqlResult *sr = NULL; char **row = NULL; int i; struct slName *el, *varList = NULL; char **retVal; safef(query, sizeof(query), "select distinct var from metaDb"); sr = sqlGetResult(conn, query); while ((row = sqlNextRow(sr)) != NULL) slNameAddHead(&varList, row[0]); sqlFreeResult(&sr); retVal = needMem(sizeof(char *) * slCount(varList)); slNameSort(&varList); for (el = varList, i = 0; el != NULL; el = el->next, i++) retVal[i] = el->name; *metaValues = retVal; return i; } void doSearchTracks(struct group *groupList) { struct group *group; char *ops[] = {"is", "contains"}; char *op_labels[] = {"is", "contains"}; char *groups[128]; char *labels[128]; int numGroups = 1; groups[0] = ANYLABEL; labels[0] = ANYLABEL; char *currentTab = cartUsualString(cart, "hgt.currentSearchTab", "simpleTab"); char *nameSearch = cartOptionalString(cart, "hgt.nameSearch"); char *nameOp = cartOptionalString(cart, "hgt.nameOp"); char *descSearch; char *groupSearch = cartOptionalString(cart, "hgt.groupSearch"); boolean doSearch = sameString(cartOptionalString(cart, searchTracks), "Search"); struct sqlConnection *conn = hAllocConn(database); boolean metaDbExists = sqlTableExists(conn, "metaDb"); struct slRef *tracks = NULL; int numMetadataSelects, tracksFound = 0; int numMetadataNonEmpty = 0; char **metadataName; char **metadataValue; struct hash *parents = newHash(4); boolean simpleSearch; struct trix *trix; char trixFile[HDB_MAX_PATH_STRING]; char **descWords = NULL; int descWordCount = 0; if(sameString(currentTab, "simpleTab")) { descSearch = cartOptionalString(cart, "hgt.simpleSearch"); simpleSearch = TRUE; freez(&nameSearch); freez(&groupSearch); } else { descSearch = cartOptionalString(cart, "hgt.descSearch"); simpleSearch = FALSE; } getSearchTrixFile(database, trixFile, sizeof(trixFile)); trix = trixOpen(trixFile); getTrackList(&groupList, -2); slSort(&groupList, gCmpGroup); for (group = groupList; group != NULL; group = group->next) { if (group->trackList != NULL) { groups[numGroups] = cloneString(group->name); labels[numGroups] = cloneString(group->label); numGroups++; if (numGroups >= ArraySize(groups)) internalErr(); } } webStartWrapperDetailedNoArgs(cart, database, "", "Track Search", FALSE, FALSE, FALSE, FALSE); hPrintf("
\n\n", hgTracksName()); hPrintf("\n", database); hPrintf("\n", currentTab); hPrintf("\n"); hPrintf("\n"); -hPrintf("
\n" +hPrintf("\n"); -#ifndef CB_SELECTION -hPrintf("\n", searchTracks); -hPrintf("\n"); -#endif///ndef CB_SELECTION hPrintf("\n"); if(descSearch != NULL && !strlen(descSearch)) descSearch = NULL; if(groupSearch != NULL && sameString(groupSearch, ANYLABEL)) groupSearch = NULL; if(!isEmpty(descSearch)) { char *tmp = cloneString(descSearch); char *val = nextWord(&tmp); struct slName *el, *descList = NULL; int i; while (val != NULL) { slNameAddTail(&descList, val); val = nextWord(&tmp); } descWordCount = slCount(descList); descWords = needMem(sizeof(char *) * descWordCount); for(i = 0, el = descList; el != NULL; i++, el = el->next) descWords[i] = strLower(el->name); } if(doSearch) { if(simpleSearch) { struct trixSearchResult *tsList; struct hash *trackHash = newHash(0); // Create a hash of tracks, so we can map the track name into a track struct. for (group = groupList; group != NULL; group = group->next) { struct trackRef *tr; for (tr = group->trackList; tr != NULL; tr = tr->next) { struct track *track = tr->track; hashAdd(trackHash, track->track, track); struct track *subTrack = track->subtracks; for (subTrack = track->subtracks; subTrack != NULL; subTrack = subTrack->next) hashAdd(trackHash, subTrack->track, subTrack); } } for(tsList = trixSearch(trix, descWordCount, descWords, TRUE); tsList != NULL; tsList = tsList->next) { struct track *track = (struct track *) hashFindVal(trackHash, tsList->itemId); refAdd(&tracks, track); tracksFound++; } slReverse(&tracks); } else if(!isEmpty(nameSearch) || descSearch != NULL || groupSearch != NULL || numMetadataNonEmpty) { // First do the metaDb searches, which can be done quickly for all tracks with db queries. struct hash *matchingTracks = newHash(0); struct hash *trackMetadata = newHash(0); struct slName *el, *metaTracks = NULL; int i; for(i = 0; i < numMetadataSelects; i++) { if(!isEmpty(metadataValue[i])) { struct slName *tmp = metaDbSearch(conn, metadataName[i], metadataValue[i], "is"); if(metaTracks == NULL) metaTracks = tmp; else metaTracks = slNameIntersection(metaTracks, tmp); } } for (el = metaTracks; el != NULL; el = el->next) hashAddInt(matchingTracks, el->name, 1); if(metaDbExists && !isEmpty(descSearch)) { // Load all metadata words for each track to facilitate metadata search. char query[256]; struct sqlResult *sr = NULL; char **row; safef(query, sizeof(query), "select obj, val from metaDb"); sr = sqlGetResult(conn, query); while ((row = sqlNextRow(sr)) != NULL) { char *str = cloneString(row[1]); hashAdd(trackMetadata, row[0], str); } sqlFreeResult(&sr); } for (group = groupList; group != NULL; group = group->next) { if(groupSearch == NULL || sameString(group->name, groupSearch)) { if (group->trackList != NULL) { struct trackRef *tr; for (tr = group->trackList; tr != NULL; tr = tr->next) { struct track *track = tr->track; if((isEmpty(nameSearch) || isNameMatch(track, nameSearch, nameOp)) && (isEmpty(descSearch) || isDescriptionMatch(track, descWords, descWordCount)) && (!numMetadataNonEmpty || hashLookup(matchingTracks, track->track) != NULL)) { tracksFound++; refAdd(&tracks, track); } if (track->subtracks != NULL) { struct track *subTrack; for (subTrack = track->subtracks; subTrack != NULL; subTrack = subTrack->next) { if((isEmpty(nameSearch) || isNameMatch(subTrack, nameSearch, nameOp)) && (isEmpty(descSearch) || isDescriptionMatch(subTrack, descWords, descWordCount)) && (!numMetadataNonEmpty || hashLookup(matchingTracks, subTrack->track) != NULL)) { // XXXX to parent hash. - use tdb->parent instead. hashAdd(parents, subTrack->track, track); tracksFound++; refAdd(&tracks, subTrack); } } } } } } } slSort(&tracks, gCmpTrack); } } -if(tracksFound) +if(tracksFound < 1) + { + if(doSearch) + hPrintf("

No tracks found

\n"); + } +else { struct hash *tdbHash = makeTrackHash(database, chromName); -#ifndef CB_SELECTION - hPrintf("   %d tracks found\n", tracksFound); -#endif///ndef CB_SELECTION hPrintf("
\n\n", hgTracksName()); -#ifdef CB_SELECTION - hPrintf("
"); - if(tracksFound > 9) + #define MAX_FOUND_TRACKS 100 + if(tracksFound > MAX_FOUND_TRACKS) + { + hPrintf("
Found %d tracks, but only the first %d are displayed.",tracksFound,MAX_FOUND_TRACKS); + hPrintf("
Please narrow search criteria to find fewer tracks.
\n"); + } + + #define ENOUGH_FOUND_TRACKS 10 + if(tracksFound >= ENOUGH_FOUND_TRACKS) { hPrintf(""); hPrintf("    "); - //hPrintf("   %d tracks found\n", tracksFound); } -#endif///def CB_SELECTION hPrintf("\n"); -#else///ifndef CB_SELECTION - hButton("submit", "View in Browser"); - hPrintf(""); - hPrintf("\n"); -#endif///ndef CB_SELECTION // FIXME: I believe that only data tracks should appear in found tracks. If composite is found, show its children instead - // FIXME: I believe if the fount track list is too large, a warning should be shown instead: "Found 237 tracks... Please narrow search criteria to find fewer tracks." + + int trackCount=0; struct slRef *ptr; while((ptr = slPopHead(&tracks))) { + if(++trackCount > MAX_FOUND_TRACKS) + break; + struct track *track = (struct track *) ptr->val; // trackDbOutput(track->tdb, stderr, ',', '\n'); hPrintf("\n",COLOR_BG_ALTDEFAULT); -#ifdef CB_SELECTION + // FIXME: I think we have now changed the paradigm for subtrack vis: // There must be a {trackName}_sel to have subtrack level vis override. // This means rightClick must make a {trackName}_sel, which is needed for hgTrackUi conformity anyway // AND hgTracks.c should now be keyed off the "_sel" for subtrack without composite. // THIS would make ajax calls to clean up vis (currently in hgTracks.js) uneeded. // ONE MORE COMPLICATION: non-subtracks do not currently have a "_sel" setting! // Distinguish here? Only subtracks get "_sel" CB set here? Control by "name" of CB? hPrintf("\n"); -#endif///def CB_SELECTION + hPrintf("\n"); -#ifdef CB_SELECTION hPrintf("\n", trackUrl(track->track, NULL), track->shortLabel); hPrintf("\n"); - hPrintf("\n"); } hPrintf("
\n"); -#ifdef CB_SELECTION hPrintf("\n"); #define PM_BUTTON "" hPrintf("
",HG_COL_HEADER); printf(PM_BUTTON,"true", "plus_all", "add_sm.gif", "Select"); printf(PM_BUTTON,"false","minus_all","remove_sm.gif","Unselect"); hPrintf("VisibilityNameDescription
\n"); - hButtonWithOnClick("hgt.ignoreme", "Select All", "show all found tracks", "changeSearchVisibilityPopups('full'); return false;"); - hButtonWithOnClick("hgt.ignoreme", "Unselect All", "show all found tracks", "changeSearchVisibilityPopups('hide'); return false;"); - hPrintf("

NameDescription
\n"); char name[256]; safef(name,sizeof(name),"%s_sel",track->track); boolean checked = FALSE; if(tdbIsCompositeChild(track->tdb)) { // FIXME: four state logic is for subtracks only and exists as static in hui.c. When time is right, make this logic non-static #define FOURSTATE_CHECKED 1 checked = (FOURSTATE_CHECKED == cartUsualInt(cart, name, 0)); // Don't need all 4 states here. Just checked/not // FIXME: four state logic is for subtracks only and exists as static in hui.c. When time is right, make this logic non-static } else checked = track->visibility != tvHide; cgiMakeCheckBoxIdAndJS(name,checked,name,"class='selCb' onchange=\"findTracksClickedOne(this,true);\""); hPrintf("\n"); if (tdbIsSuper(track->tdb)) { superTrackDropDown(cart, track->tdb, superTrackHasVisibleMembers(track->tdb)); } else { hTvDropDownClassVisOnly(track->track, track->visibility, track->canPack, -#ifdef CB_SELECTION - "normalText", -#else///ifndef CB_SELECTION - (track->visibility == tvHide) ? "hiddenText" : "normalText", -#endif///ndef CB_SELECTION + "normalText", // Show hide as normal text too! (track->visibility == tvHide) ? "hiddenText" : "normalText", trackDbSetting(track->tdb, "onlyVisibility")); } hPrintf("%s%s", track->longLabel); compositeMetadataToggle(database, track->tdb, "...", TRUE, FALSE, tdbHash); -#else///ifndef CB_SELECTION - hPrintf("%s", track->shortLabel); - compositeMetadataToggle(database, track->tdb, "...", TRUE, FALSE, tdbHash); - hPrintf("%s", trackUrl(track->track, NULL), track->longLabel); -#endif///ndef CB_SELECTION hPrintf("
\n"); -#ifdef CB_SELECTION hPrintf(""); hPrintf("    "); - //hPrintf("   %d tracks found\n", tracksFound); hPrintf("\n"); -#else///ifndef CB_SELECTION - hButton("submit", "View in Browser"); -#endif///ndef CB_SELECTION hPrintf("\n
\n"); } -else - { - if(doSearch) - hPrintf("

No tracks found

\n"); - } -hPrintf("

Recently Done

\n"); webEndSectionTables(); }