inc/trix.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	trix
struct	trixSearchResult
Defines
#define	trixPrefixSize   5
Functions
trix *	trixOpen (char *ixFile)
void	trixClose (struct trix **pTrix)
trixSearchResult *	trixSearch (struct trix *trix, int wordCount, char **words, boolean expand)
void	trixSearchResultFree (struct trixSearchResult **pTsr)
void	trixSearchResultFreeList (struct trixSearchResult **pList)

---

Define Documentation

#define trixPrefixSize   5

Definition at line 25 of file trix.h.

Referenced by trixCopyToPrefix(), trixFindIndexStartLine(), and trixOpen().

---

Function Documentation

void trixClose

(

struct trix **

pTrix

)

Definition at line 92 of file trix.c.

References freeHitCallback(), freeMem(), freez(), hashFree, hashTraverseVals(), trix::ixx, and trix::wordHitHash.

{
struct trix *trix = *pTrix;
if (trix != NULL)
    {
    freeMem(trix->ixx);
    hashTraverseVals(trix->wordHitHash, freeHitCallback);
    hashFree(&trix->wordHitHash);       /* Need to free items? */
    freez(pTrix);
    }
}

Here is the call graph for this function:

struct trix* trixOpen

(

char *

ixFile

)

[read]

Definition at line 194 of file trix.c.

References initUnhexTable(), trix::lf, lineFileClose(), lineFileNext(), lineFileOpen(), PATH_LEN, safef(), trixAddToIxx(), trixNew(), trixPrefixSize, TRUE, and unhex().

{
char ixxFile[PATH_LEN];
struct trix *trix;
struct lineFile *lf;
char *line;

initUnhexTable();
safef(ixxFile, sizeof(ixxFile), "%sx", ixFile);
lf = lineFileOpen(ixxFile, TRUE);
trix = trixNew();
while (lineFileNext(lf, &line, NULL))
    {
    off_t pos = unhex(line+trixPrefixSize);
    trixAddToIxx(trix, pos, line);
    }
lineFileClose(&lf);
trix->lf = lineFileOpen(ixFile, TRUE);
return trix;
}

Here is the call graph for this function:

struct trixSearchResult* trixSearch	(	struct trix *	trix,
		int	wordCount,
		char **	words,
		boolean	expand
	)			[read]

Definition at line 654 of file trix.c.

References AllocVar, FALSE, findMultipleWordHits(), trixWordResult::hitList, trixHitPos::itemId, trixSearchResult::itemId, trixSearchResult::leftoverLetters, trixHitPos::leftoverLetters, trixHitPos::next, trixSearchResult::orderedSpan, sameString, slAddHead, slReverse(), slSort(), trixSearchResultCmp(), trixSearchWordResults(), trixWordResultFreeList(), TRUE, trixSearchResult::unorderedSpan, trixHitPos::wordIx, and trixSearchResult::wordPos.

{
struct trixWordResult *twr, *twrList = NULL;
struct trixSearchResult *ts, *tsList = NULL;
int wordIx;
boolean gotMiss = FALSE;

if (wordCount == 1)
    {
    struct trixHitPos *hit;
    char *lastId = "";
    twr = twrList = trixSearchWordResults(trix, words[0], expand);
    if (twr == NULL)
        return NULL;
    for (hit = twr->hitList; hit != NULL; hit = hit->next)
        {
        if (!sameString(lastId, hit->itemId))
            {
            lastId = hit->itemId;
            AllocVar(ts);
            ts->itemId = hit->itemId;   /* Transfer itemId */
            hit->itemId = NULL;
            ts->orderedSpan = 1;
            ts->unorderedSpan = 1;
            ts->wordPos = hit->wordIx;
            ts->leftoverLetters = hit->leftoverLetters;
            slAddHead(&tsList, ts);
            }
        }
    }
else
    {
    for (wordIx=0; wordIx<wordCount; ++wordIx)
        {
        char *searchWord = words[wordIx];
        twr = trixSearchWordResults(trix, searchWord, expand);
        if (twr == NULL)
            {
            gotMiss = TRUE;
            break;
            }
        slAddHead(&twrList, twr);
#ifdef DEBUG
        trwDump(twr);
#endif /* DEBUG */
        }
    if (!gotMiss)
        {
        slReverse(&twrList);
        tsList = findMultipleWordHits(twrList);
        }
    }
trixWordResultFreeList(&twrList);
slSort(&tsList, trixSearchResultCmp);
return tsList;
}

Here is the call graph for this function:

void trixSearchResultFree

(

struct trixSearchResult **

pTsr

)

Definition at line 105 of file trix.c.

References freeMem(), freez(), and trixSearchResult::itemId.

Referenced by trixSearchResultFreeList().

{
struct trixSearchResult *tsr = *pTsr;
if (tsr != NULL)
    {
    freeMem(tsr->itemId);
    freez(pTsr);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void trixSearchResultFreeList

(

struct trixSearchResult **

pList

)

Definition at line 116 of file trix.c.

References trixSearchResult::next, and trixSearchResultFree().

{
struct trixSearchResult *el, *next;
for (el = *pList; el != NULL; el = next)
    {
    next = el->next;
    trixSearchResultFree(&el);
    }
*pList = NULL;
}

Here is the call graph for this function:

---