void workspace_print_plot( workspace *w) {
int i, j;
for( i = 0; i < w->npoints; i++) {
printf("%g %g\n", w->points[i].x, w->points[i].y);
}
printf("\n");
for( i = 0; i < w->nleaves; i++) {
tri *t = w->tris[w->leaves[i]->i];
printf("%i %i %i\n", t->p[0], t->p[1], t->p[2]);
if( w->leaves[i]->hp) {
int r = w->leaves[i]->info.hp->r;
int q = find_n( r);
printf("%i %i", r, (q+2)*(q+1)/2);
int k = (q+2)*(q+1)/2;
for( j = 0; j < k; j++) {
printf(" %g", tree_get_gamma( w, w->leaves[i], j));
}
} else {
int r = w->leaves[i]->info.h->r;
int q = find_n( r);
printf("%i %i", r, (q+2)*(q+1)/2);
int k = (q+2)*(q+1)/2;
for( j = 0; j < k; j++) {
printf(" %g", tree_get_gamma( w, w->leaves[i], j));
}
}
printf("\n");
}
printf("\n");
}
char *buffer_char(t_buffer *buff)
{
char *tmp;
char c;
if (buff->e == buff->l)
return (NULL);
if (find_n(buff))
{
tmp = NULL;
while ((c = ((char *)buff->buff)[buff->l]) != '\n')
{
tmp = addchar(tmp, c);
buff->l++;
if (buff->l == P_MAX + 1)
buff->l = 0;
}
tmp = addchar(tmp, '\n');
buff->l++;
if (buff->l == P_MAX + 1)
buff->l = 0;
return (tmp);
}
return (NULL);
}
int syntax(t_dlist *list)
{
check_dump(list);
check_paral(list);
check_para(list);
find_a(list);
find_n(list);
return (0);
}
int main(int argc, char * argv[]){
find_n();
return 0;
}
