| | |
| | | #include<inttypes.h> |
| | | #include<config.h> |
| | | #include <time.h> |
| | | |
| | | #include "io.h" |
| | | /* a helper function that utilizes ts_string data structure and performs same as sprintf */ |
| | | ts_uint ts_sprintf(ts_string *str, char *fmt, ...){ |
| | | va_list ap; |
| | |
| | | fprintf(fh, "<dumpdate>%s</dumpdate>\n", c_time_string); |
| | | |
| | | fprintf(fh, "<tape>\n"); |
| | | |
| | | fprintf(fh,"%s",tapetxt); |
| | | fprintf(fh, "</tape>\n"); |
| | | if(vesicle->poly_list!=NULL){ |
| | | npoly=vesicle->poly_list->n; |
| | |
| | | npoly=0; |
| | | nfono=0; |
| | | } |
| | | fprintf(fh, "<trisurf nvtx=\"%u\" npoly=\"%u\" nfono=\"%u\">\n", vesicle->vlist->n, npoly, nfono); |
| | | fprintf(fh, "<trisurf nvtx=\"%u\" npoly=\"%u\" nmono=\"%u\" compressed=\"false\">\n", vesicle->vlist->n, npoly, nfono); |
| | | return TS_SUCCESS; |
| | | } |
| | | |
| | |
| | | ts_uint i; |
| | | ts_sprintf(data,"<tria>"); |
| | | for(i=0; i<tlist->n;i++){ |
| | | ts_sprintf(data,"%u %u %u",tlist->tria[i]->vertex[0]->idx, tlist->tria[i]->vertex[1]->idx, tlist->tria[i]->vertex[2]->idx); |
| | | ts_sprintf(data,"%u %u %u ",tlist->tria[i]->vertex[0]->idx, tlist->tria[i]->vertex[1]->idx, tlist->tria[i]->vertex[2]->idx); |
| | | } |
| | | ts_sprintf(data,"</tria>"); |
| | | return TS_SUCCESS; |
| | |
| | | ts_uint i; |
| | | ts_sprintf(data,"<trianeigh>\n"); |
| | | for(i=0; i<tlist->n;i++){ |
| | | ts_sprintf(data,"%u %u %u",tlist->tria[i]->neigh[0]->idx, tlist->tria[i]->neigh[1]->idx, tlist->tria[i]->neigh[2]->idx); |
| | | ts_sprintf(data,"%u %u %u ",tlist->tria[i]->neigh[0]->idx, tlist->tria[i]->neigh[1]->idx, tlist->tria[i]->neigh[2]->idx); |
| | | } |
| | | ts_sprintf(data,"</trianeigh>\n"); |
| | | return TS_SUCCESS; |