inc/rangeTree.h File Reference

#include "rbTree.h"

Include dependency graph for rangeTree.h:

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

Go to the source code of this file.

Data Structures
struct	range
Defines
#define	rangeTreeFree(a)   rbTreeFree(a)
Functions
rbTree *	rangeTreeNew ()
int	rangeCmp (void *va, void *vb)
range *	rangeTreeAdd (struct rbTree *tree, int start, int end)
boolean	rangeTreeOverlaps (struct rbTree *tree, int start, int end)
int	rangeTreeOverlapSize (struct rbTree *tree, int start, int end)
range *	rangeTreeFindEnclosing (struct rbTree *tree, int start, int end)
range *	rangeTreeAllOverlapping (struct rbTree *tree, int start, int end)
range *	rangeTreeList (struct rbTree *tree)
rbTree *	rangeTreeNewDetailed (struct lm *lm, struct rbTreeNode *stack[128])

---

Define Documentation

#define rangeTreeFree

(

a

)

rbTreeFree(a)

Definition at line 26 of file rangeTree.h.

---

Function Documentation

int rangeCmp	(	void *	va,
		void *	vb
	)

Definition at line 13 of file rangeTree.c.

References range::end, and range::start.

Referenced by rangeTreeNew(), and rangeTreeNewDetailed().

{
struct range *a = va;
struct range *b = vb;
if (a->end <= b->start)
    return -1;
else if (b->end <= a->start)
    return 1;
else
    return 0;
}

Here is the caller graph for this function:

struct range* rangeTreeAdd	(	struct rbTree *	tree,
		int	start,
		int	end
	)			[read]

Definition at line 27 of file rangeTree.c.

References range::end, rbTree::lm, lmCloneMem(), max, min, rbTreeAdd(), rbTreeRemove(), range::start, and range::val.

{
struct range tempR, *existing;
tempR.start = start;
tempR.end = end;
tempR.val = NULL;
while ((existing = rbTreeRemove(tree, &tempR)) != NULL)
     {
     tempR.start = min(tempR.start, existing->start);
     tempR.end = max(tempR.end, existing->end);
     }
struct range *r = lmCloneMem(tree->lm, &tempR, sizeof(tempR));
rbTreeAdd(tree, r);
return r;
}

Here is the call graph for this function:

struct range* rangeTreeAllOverlapping	(	struct rbTree *	tree,
		int	start,
		int	end
	)			[read]

Definition at line 86 of file rangeTree.c.

References range::end, rangeList, rangeListAdd(), rbTreeTraverseRange(), slReverse(), and range::start.

{
struct range tempR;
tempR.start = start;
tempR.end = end;
rangeList = NULL;
rbTreeTraverseRange(tree, &tempR, &tempR, rangeListAdd);
slReverse(&rangeList);
return rangeList;
}

Here is the call graph for this function:

struct range* rangeTreeFindEnclosing	(	struct rbTree *	tree,
		int	start,
		int	end
	)			[read]

Definition at line 73 of file rangeTree.c.

References range::end, rbTreeFind(), and range::start.

{
struct range tempR, *r;
tempR.start = start;
tempR.end = end;
r = rbTreeFind(tree, &tempR);
if (r != NULL && r->start <= start && r->end >= end)
    return r;
return NULL;
}

Here is the call graph for this function:

struct range* rangeTreeList

(

struct rbTree *

tree

)

[read]

Definition at line 63 of file rangeTree.c.

References rangeList, rangeListAdd(), rbTreeTraverse(), and slReverse().

{
rangeList = NULL;
rbTreeTraverse(tree, rangeListAdd);
slReverse(&rangeList);
return rangeList;
}

Here is the call graph for this function:

struct rbTree* rangeTreeNew

(

)

[read]

Definition at line 126 of file rangeTree.c.

References rangeCmp(), and rbTreeNew().

{
return rbTreeNew(rangeCmp);
}

Here is the call graph for this function:

struct rbTree* rangeTreeNewDetailed	(	struct lm *	lm,
		struct rbTreeNode *	stack[128]
	)			[read]

Definition at line 132 of file rangeTree.c.

References lm, rangeCmp(), rbTreeNewDetailed(), and rbTree::stack.

{
return rbTreeNewDetailed(rangeCmp, lm, stack);
}

Here is the call graph for this function:

boolean rangeTreeOverlaps	(	struct rbTree *	tree,
		int	start,
		int	end
	)

Definition at line 44 of file rangeTree.c.

References range::end, rbTreeFind(), range::start, and range::val.

{
struct range tempR;
tempR.start = start;
tempR.end = end;
tempR.val = NULL;
return rbTreeFind(tree, &tempR) != NULL;
}

Here is the call graph for this function:

int rangeTreeOverlapSize	(	struct rbTree *	tree,
		int	start,
		int	end
	)

Definition at line 112 of file rangeTree.c.

References addOverlap(), range::end, overlapEnd, overlapStart, rbTreeTraverseRange(), range::start, and totalOverlap.

Referenced by pslRangeTreeOverlap().

{
struct range tempR;
tempR.start = overlapStart = start;
tempR.end = overlapEnd = end;
totalOverlap = 0;
rbTreeTraverseRange(tree, &tempR, &tempR, addOverlap);
return totalOverlap;
}

Here is the call graph for this function:

Here is the caller graph for this function:

---