struct slRef *rbmTreeItems(struct rbmTree *tree)
/* Return sorted list of items. */
{
itList = NULL;
rbmTreeTraverse(tree, addRef);
slReverse(&itList);
return itList;
}
void dumpOneRbmTree(struct hashEl *hel)
/* Given a hel that associates a chrom name with an rbmTree of non-overlapping
* ranges, dump out bed 4 like featureBits -bed. */
{
struct rbmTree *t = (struct rbmTree *)hel->val;
dumpChrom = hel->name;
dumpSeq = 0;
rbmTreeTraverse(t, dumpRange);
}
void rbmTreeFreeAll(struct rbmTree **pTree)
/* Frees space used by the red-black tree pointed to by t and t's items. */
{
struct rbmTree *tree = *pTree;
if (tree != NULL)
{
rbmTreeTraverse(tree, tree->itemFree);
lmCleanup(&tree->lm);
freez(pTree);
}
}
