inc/boxClump.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	boxIn
struct	boxClump
Functions
void	boxClumpFree (struct boxClump **pClump)
void	boxClumpFreeList (struct boxClump **pList)
int	boxClumpCmpCount (const void *va, const void *vb)
boxClump *	boxFindClumps (struct boxIn **pBoxList)

---

Function Documentation

int boxClumpCmpCount	(	const void *	va,
		const void *	vb
	)

Definition at line 39 of file boxClump.c.

References boxClump::boxCount.

{
const struct boxClump *a = *((struct boxClump **)va);
const struct boxClump *b = *((struct boxClump **)vb);
return b->boxCount - a->boxCount;
}

void boxClumpFree

(

struct boxClump **

pClump

)

Some simple utility function on globally declared data structures.

Definition at line 15 of file boxClump.c.

References boxClump::boxList, freez(), and slFreeList().

Referenced by boxClumpFreeList().

{
struct boxClump *clump = *pClump;
if (clump != NULL)
    {
    slFreeList(&clump->boxList);
    freez(pClump);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void boxClumpFreeList

(

struct boxClump **

pList

)

Definition at line 26 of file boxClump.c.

References boxClumpFree(), and boxClump::next.

Referenced by boxLump().

{
struct boxClump *el, *next;

for (el = *pList; el != NULL; el = next)
    {
    next = el->next;
    boxClumpFree(&el);
    }
*pList = NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

struct boxClump* boxFindClumps

(

struct boxIn **

pBoxList

)

[read]

Definition at line 234 of file boxClump.c.

References AllocVar, BIGNUM, cluster::boxList, box::cluster, dlAddTail(), dlEnd, dlListInit(), dlList::head, box::in, lm, lmAllocVar, lmInit(), boxIn::next, dlNode::next, box::next, cluster::node, boxIn::qEnd, boxIn::qStart, rBoxJoin(), slAddHead, boxIn::tEnd, boxIn::tStart, and dlNode::val.

{
struct boxIn *in;
struct boxClump *clumpList = NULL, *clump;
struct boxRef *refList = NULL, *ref;
struct box *box;
struct cluster *cluster;
struct dlNode *node;
struct dlList clusterList;
int qStart = BIGNUM, qEnd = -BIGNUM;
int tStart = BIGNUM, tEnd = -BIGNUM;


dlListInit(&clusterList);
lm = lmInit(0);

/* Make local box structure, cluster, and reference
 * for each input box.  Calculate overall bounds. */
for (in = *pBoxList; in != NULL; in = in->next)
    {
    lmAllocVar(lm, box);
    box->in = in;
    if (in->qStart < qStart) qStart = in->qStart;
    if (in->qEnd > qEnd) qEnd = in->qEnd;
    if (in->tStart < tStart) tStart = in->tStart;
    if (in->tEnd > tEnd) tEnd = in->tEnd;
    lmAllocVar(lm,cluster);
    lmAllocVar(lm, cluster->node);
    cluster->node->val = cluster;
    dlAddTail(&clusterList, cluster->node);
    cluster->boxList = box;
    box->cluster = cluster;
    lmAllocVar(lm, ref);
    ref->box = box;
    slAddHead(&refList, ref);
    }

/* Call to recursive joiner. */
rBoxJoin(refList, qStart, qEnd, tStart, tEnd);

/* Copy from local memory and local data structures
 * to global memory and global data structures. */
for (node = clusterList.head; !dlEnd(node); node = node->next)
    {
    int boxCount = 0;
    int qStart = BIGNUM, qEnd = -BIGNUM;
    int tStart = BIGNUM, tEnd = -BIGNUM;
    struct boxIn *boxList = NULL;
    cluster = node->val;
    for (box = cluster->boxList; box != NULL; box = box->next)
        {
        in = box->in;
        slAddHead(&boxList, in);
        if (in->qStart < qStart) qStart = in->qStart;
        if (in->qEnd > qEnd) qEnd = in->qEnd;
        if (in->tStart < tStart) tStart = in->tStart;
        if (in->tEnd > tEnd) tEnd = in->tEnd;
        ++boxCount;
        }
    if (boxCount > 0)
        {
        AllocVar(clump);
        slAddHead(&clumpList, clump);
        clump->boxList = boxList;
        clump->boxCount = boxCount;
        clump->qStart = qStart;
        clump->qEnd = qEnd;
        clump->tStart = tStart;
        clump->tEnd = tEnd;
        }
    }
*pBoxList = NULL;
lmCleanup(&lm);
return clumpList;
}

Here is the call graph for this function:

---