| " "back " "gene-list " "refresh " " |
| \n"
);
printf("geneList: %s \n", geneList ); puts( " |
| " "gene-list\n" " |
| " "screen\n" ); puts( " |
\n");
uglyf("name xrays nrays ring? ringRank \n");
uglyf("-------------------------------------- \n");
}
for(nl=allNodes;nl;nl=nl->next)
{
if (nl->node->ring)
{
ringCount++;
}
else
{
if (nl->node->ringRank > 1)
{
insideCount++;
}
else
{
outsideCount++;
}
}
if (showAll)
{
uglyf("%11s %4d %4d %4s %3d \n",
nl->node->name,
slCount(nl->node->xrays),
slCount(nl->node->nrays),
nl->node->ring ? "ring":"not!",
nl->node->ringRank
);
}
}
if (showAll)
{
uglyf("\n");
}
// TODO: add some real code for freeing these things properly
// e.g. for xrays and nrays lists, free up the nodelist list itself,
// but not the *node values themselves, which are allocated
// in the main nodelist/hash. If the nodelist is freed up
// properly then hash freeing should be easy enough.
// Do we use valgrind or some other util to verify mem-release?
return TRUE;
}
/* Count up elements in list that are outside ring. */
int slCountOutside(void *list)
{
struct slList *pt = (struct slList *)list;
int len = 0;
while (pt != NULL)
{
struct node *n = ((struct nodelist *)pt)->node;
if ((!n->ring) && (n->ringRank==1))
len += 1;
pt = pt->next;
}
return len;
}
#define NODE_SIZE 10
void addMap(struct nodelist *nl)
{
struct node *node = nl->node;
int x=node->xpos;
int y=node->ypos;
int r=NODE_SIZE;
char *name = node->name;
if (node->alias)
{
name = node->alias;
}
printf(
"",
x,y,r,
name,
node->name,
name,
name
);
}
void drawScreen()
/*
Draw Gene Ring using given genes and interactions
and display it in a page as a .gif
*/
{
#define SCREEN_SIZE 800
#define RING_SIZE 200
#define INRING_SIZE 140
#define OUTRING_SIZE 340
struct tempName filename;
int width,height;
char *mapName="ring_map";
ZeroVar(&filename);
makeTempName(&filename, "hgGeneRing_screen", ".gif");
printf("\n");
mgSaveGif(mg, filename.forCgi, FALSE);
width=height=SCREEN_SIZE;
printf("| " "back " "gene-list " "refresh " " |