trisurf-ng.git - Gitblit

Added spherical harmonics as-is into rbc

Samo Penic

2014-04-09 dc77e8ef10378188ee0a9657cedd1b7991a0a29f

commit \| author \| age
7958e9	1	#include<stdlib.h>
SP	2	#include<math.h>
	3	#include<stdio.h>
	4	#include "general.h"
	5	#include "vertex.h"
	6	#include "bond.h"
	7	#include "vesicle.h"
	8	#include "vertex.h"
	9	#include "triangle.h"
	10	#include "initial_distribution.h"
f74313	11	#include "energy.h"
1ab449	12	#include "poly.h"
8a6614	13	#include "io.h"
dc77e8	14	#include "sh.h"
7958e9	15
SP	16	ts_vesicle *initial_distribution_dipyramid(ts_uint nshell, ts_uint ncmax1, ts_uint ncmax2, ts_uint ncmax3, ts_double stepsize){
1ab449	17	ts_fprintf(stdout,"Starting initial_distribution on vesicle with %u shells!...\n",nshell);
7958e9	18	ts_bool retval;
1ab449	19	ts_uint no_vertices=5nshellnshell+2;
SP	20	ts_vesicle *vesicle=init_vesicle(no_vertices,ncmax1,ncmax2,ncmax3,stepsize);
	21	vesicle->nshell=nshell;
	22	//retval = vtx_set_global_values(vesicle);
	23	retval = pentagonal_dipyramid_vertex_distribution(vesicle->vlist);
	24	retval = init_vertex_neighbours(vesicle->vlist);
	25	vesicle->vlist = init_sort_neighbours(vesicle->blist,vesicle->vlist);
b01cc1	26	// retval = init_vesicle_bonds(vesicle); // bonds are created in sort_neigh
1ab449	27	retval = init_triangles(vesicle);
SP	28	retval = init_triangle_neighbours(vesicle);
	29	retval = init_common_vertex_triangle_neighbours(vesicle);
	30	retval = init_normal_vectors(vesicle->tlist);
	31	retval = mean_curvature_and_energy(vesicle);
	32	ts_fprintf(stdout,"initial_distribution finished!\n");
41a035	33	if(retval);
7958e9	34	return vesicle;
SP	35	}
	36
	37
1ab449	38
SP	39	ts_vesicle create_vesicle_from_tape(ts_tape tape){
	40	ts_vesicle *vesicle;
bcf455	41	ts_vertex *vtx;
M	42
1ab449	43	vesicle=initial_distribution_dipyramid(tape->nshell,tape->ncxmax,tape->ncymax,tape->nczmax,tape->stepsize);
58230a	44	// Nucleus:
fe24d2	45	vesicle->R_nucleus=tape->R_nucleus*tape->R_nucleus;
M	46
	47	vesicle->clist->dmin_interspecies = tape->dmin_interspecies*tape->dmin_interspecies;
bcf455	48
58230a	49	//Initialize grafted polymers (brush):
624f81	50	vesicle->poly_list=init_poly_list(tape->npoly,tape->nmono, vesicle->vlist, vesicle);
1ab449	51	vesicle->spring_constant=tape->kspring;
SP	52	poly_assign_spring_const(vesicle);
bcf455	53
58230a	54	//Initialize filaments (polymers inside the vesicle):
M	55	vesicle->filament_list=init_poly_list(tape->nfil,tape->nfono, NULL, vesicle);
bcf455	56	poly_assign_filament_xi(vesicle,tape);
58230a	57
bcf455	58	ts_uint i,j;
M	59	for(i=0;i<vesicle->filament_list->n;i++){
	60	for(j=0;j<vesicle->filament_list->poly[i]->blist->n;j++){
	61	bond_vector(vesicle->filament_list->poly[i]->blist->bond[j]);
	62	vesicle->filament_list->poly[i]->blist->bond[j]->bond_length = sqrt(vtx_distance_sq(vesicle->filament_list->poly[i]->blist->bond[j]->vtx1,vesicle->filament_list->poly[i]->blist->bond[j]->vtx2));
	63	}
58230a	64	}
bcf455	65
M	66	for(i=0;i<vesicle->filament_list->n;i++){
	67	for(j=0;j<vesicle->filament_list->poly[i]->vlist->n;j++){
	68	vtx = vesicle->filament_list->poly[i]->vlist->vtx[j];
	69	if(vtx->bond_no == 2){
	70	vtx->energy = -(vtx->bond[0]->xvtx->bond[1]->x + vtx->bond[0]->yvtx->bond[1]->y + vtx->bond[0]->z*vtx->bond[1]->z)/vtx->bond[0]->bond_length/vtx->bond[1]->bond_length;
	71	}
	72	}
58230a	73	}
bcf455	74
ea1cce	75	for(i=0;i<vesicle->filament_list->n;i++){
M	76	vertex_list_assign_id(vesicle->filament_list->poly[i]->vlist,TS_ID_FILAMENT);
	77	}
bcf455	78
58230a	79	// vesicle->spring_constant=tape->kspring;
M	80	// poly_assign_spring_const(vesicle);
	81
1ab449	82
SP	83	vesicle->nshell=tape->nshell;
	84	vesicle->dmax=tape->dmaxtape->dmax; / dmax^2 in the vesicle dmax variable */
	85	vesicle->bending_rigidity=tape->xk0;
	86	vtx_set_global_values(vesicle); /* make xk0 default value for every vertex */
	87	ts_fprintf(stdout, "Tape setting: xk0=%e\n",tape->xk0);
	88	vesicle->stepsize=tape->stepsize;
	89	vesicle->clist->ncmax[0]=tape->ncxmax;
	90	vesicle->clist->ncmax[1]=tape->ncymax;
	91	vesicle->clist->ncmax[2]=tape->nczmax;
	92	vesicle->clist->max_occupancy=8; /* hard coded max occupancy? */
	93
	94	vesicle->pressure= tape->pressure;
	95	vesicle->pswitch=tape->pswitch;
dc77e8	96	vesicle->sphHarmonics=sph_init(vesicle->vlist,tape->shc);
1ab449	97	return vesicle;
SP	98
	99	}
	100
	101
	102
	103
	104
7958e9	105	ts_bool pentagonal_dipyramid_vertex_distribution(ts_vertex_list *vlist){
SP	106	/* Some often used relations */
	107	const ts_double s1= sin(2.0*M_PI/5.0);
	108	const ts_double s2= sin(4.0*M_PI/5.0);
	109	const ts_double c1= cos(2.0*M_PI/5.0);
	110	const ts_double c2= cos(4.0*M_PI/5.0);
	111
	112	/* Calculates projection lenght of an edge bond to pentagram plane */
	113	const ts_double xl0=A0/(2.0*sin(M_PI/5.0));
	114	#ifdef TS_DOUBLE_DOUBLE
	115	const ts_double z0=sqrt(pow(A0,2)-pow(xl0,2));
	116	#endif
	117	#ifdef TS_DOUBLE_FLOAT
	118	const ts_double z0=sqrtf(powf(A0,2)-powf(xl0,2));
	119	#endif
	120	#ifdef TS_DOUBLE_LONGDOUBLE
	121	const ts_double z0=sqrtl(powl(A0,2)-powl(xl0,2));
	122	#endif
	123	// const z0=sqrt(A0A0 -xl0xl0); /* I could use pow function but if pow is used make a check on the float type. If float then powf, if long double use powl */
	124
	125	/placeholder for the pointer to vertex datastructure list... DIRTY: actual pointer points towards invalid address, one position before actual beginning of the list... This is to solve the difference between 1 based indexing in original program in fortran and 0 based indexing in C. All algorithms remain unchanged because of this!/
	126	ts_vertex **vtx=vlist->vtx -1 ;
	127
	128
	129	ts_uint nshell=(ts_uint)( sqrt((ts_double)(vlist->n-2)/5));
	130	// printf("nshell=%u\n",nshell);
	131	ts_uint i,n0; // some for loop prereq
	132	ts_int j,k;
	133	ts_double dx,dy; // end loop prereq
	134
	135	/* topmost vertex */
8f6a69	136	vtx[1]->x=0.0;
SP	137	vtx[1]->y=0.0;
	138	vtx[1]->z=z0*(ts_double)nshell;
7958e9	139
SP	140	/* starting from to in circular order on pentagrams */
	141	for(i=1;i<=nshell;i++){
	142	n0=2+5i(i-1)/2; //-1 would be for the reason that C index starts from 0
8f6a69	143	vtx[n0]->x=0.0;
SP	144	vtx[n0]->y=(ts_double)i*xl0;
	145	vtx[n0+i]->x=vtx[n0]->y*s1;
	146	vtx[n0+i]->y=vtx[n0]->y*c1;
	147	vtx[n0+2i]->x=vtx[n0]->ys2;
	148	vtx[n0+2i]->y=vtx[n0]->yc2;
	149	vtx[n0+3i]->x=-vtx[n0+2i]->x;
	150	vtx[n0+3i]->y=vtx[n0+2i]->y;
	151	vtx[n0+4*i]->x=-vtx[n0+i]->x;
	152	vtx[n0+4*i]->y=vtx[n0+i]->y;
7958e9	153	}
SP	154
	155	/* vertexes on the faces of the dipyramid */
	156	for(i=1;i<=nshell;i++){
	157	n0=2+5i(i-1)/2; // -1 would be because of C!
	158	for(j=1;j<=i-1;j++){
8f6a69	159	dx=(vtx[n0]->x-vtx[n0+4*i]->x)/(ts_double)i;
SP	160	dy=(vtx[n0]->y-vtx[n0+4*i]->y)/(ts_double)i;
	161	vtx[n0+4i+j]->x=(ts_double)jdx+vtx[n0+4*i]->x;
	162	vtx[n0+4i+j]->y=(ts_double)jdy+vtx[n0+4*i]->y;
7958e9	163	}
SP	164	for(k=0;k<=3;k++){ // I would be worried about zero starting of for
8f6a69	165	dx=(vtx[n0+(k+1)i]->x - vtx[n0+ki]->x)/(ts_double) i;
SP	166	dy=(vtx[n0+(k+1)i]->y - vtx[n0+ki]->y)/(ts_double) i;
7958e9	167	for(j=1; j<=i-1;j++){
8f6a69	168	vtx[n0+ki+j]->x= (ts_double)jdx+vtx[n0+k*i]->x;
SP	169	vtx[n0+ki+j]->y= (ts_double)jdy+vtx[n0+k*i]->y;
7958e9	170	}
SP	171	}
	172	}
	173
	174	for(i=1;i<=nshell;i++){
	175	n0= 2+ 5i(i-1)/2;
	176	for(j=0;j<=5*i-1;j++){
8f6a69	177	vtx[n0+j]->z= z0*(ts_double)(nshell-i); // I would be worried about zero starting of for
7958e9	178	}
SP	179	}
	180
	181	/* for botom part of dipyramide we calculate the positions of vertices */
	182	for(i=2+5nshell(nshell+1)/2;i<=vlist->n;i++){
8f6a69	183	vtx[i]->x=vtx[vlist->n - i +1]->x;
SP	184	vtx[i]->y=vtx[vlist->n - i +1]->y;
	185	vtx[i]->z=-vtx[vlist->n - i +1]->z;
7958e9	186	}
SP	187
	188	for(i=1;i<=vlist->n;i++){
	189	for(j=1;j<=vlist->n;j++){
	190	if(i!=j && vtx_distance_sq(vtx[i],vtx[j])<0.001){
	191	printf("Vertices %u and %u are the same!\n",i,j);
	192	}
	193	}
	194	}
	195	return TS_SUCCESS;
	196	}
	197
	198
	199
	200	ts_bool init_vertex_neighbours(ts_vertex_list *vlist){
	201	ts_vertex **vtx=vlist->vtx -1; // take a look at dipyramid function for comment.
	202	const ts_double eps=0.001; //TODO: find out if you can use EPS from math.h
	203	ts_uint i,j;
	204	ts_double dist2; // Square of distance of neighbours
	205	/this is not required if we zero all data in vertex structure at initialization /
	206	/if we force zeroing at initialization this for loop can safely be deleted /
	207	//for(i=1;i<=vlist->n;i++){
	208	// vtx[i].neigh_no=0;
	209	//}
	210	for(i=1;i<=vlist->n;i++){
	211	for(j=1;j<=vlist->n;j++){
	212	dist2=vtx_distance_sq(vtx[i],vtx[j]);
	213	if( (dist2>eps) && (dist2<(A0*A0+eps))){
	214	//if it is close enough, but not too much close (solves problem of comparing when i==j)
	215	vtx_add_neighbour(vtx[i],vtx[j]);
	216	}
	217	}
	218	// printf ("vertex %u ima %u sosedov!\n",i,vtx[i]->data->neigh_no);
	219	}
	220
	221	return TS_SUCCESS;
	222	}
	223
b01cc1	224	// TODO: with new datastructure can be rewritten. Partially it is done, but it is complicated.
SP	225	ts_vertex_list init_sort_neighbours(ts_bond_list blist,ts_vertex_list *vlist){
7958e9	226	ts_vertex **vtx=vlist->vtx -1; // take a look at dipyramid function for comment.
SP	227	ts_uint i,l,j,jj,jjj,k=0;
	228	ts_double eps=0.001; // Take a look if EPS from math.h can be used
	229
	230	/lets initialize memory for temporary vertex_list. Should we write a function instead /
b01cc1	231	ts_vertex_list *tvlist=vertex_list_copy(vlist);
7958e9	232	ts_vertex *tvtx=tvlist->vtx -1; / again to compensate for 0-indexing */
SP	233
	234	ts_double dist2; // Square of distance of neighbours
	235	ts_double direct; // Something, dont know what, but could be normal of some kind
	236	for(i=1;i<=vlist->n;i++){
	237	k++; // WHY i IS NOT GOOD??
8f6a69	238	vtx_add_cneighbour(blist,tvtx[k], tvtx[vtx[i]->neigh[0]->idx+1]); //always add 1st
7958e9	239	jjj=1;
SP	240	jj=1;
8f6a69	241	for(l=2;l<=vtx[i]->neigh_no;l++){
SP	242	for(j=2;j<=vtx[i]->neigh_no;j++){
	243	dist2=vtx_distance_sq(vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
	244	direct=vtx_direct(vtx[i],vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
	245	// TODO: check if fabs can be used with all floating point types!!
7958e9	246	if( (fabs(dist2-A0*A0)<=eps) && (direct>0.0) && (j!=jjj) ){
8f6a69	247	vtx_add_cneighbour(blist,tvtx[k],tvtx[vtx[i]->neigh[j-1]->idx+1]);
7958e9	248	jjj=jj;
SP	249	jj=j;
	250	break;
	251	}
	252	}
	253	}
	254	}
b01cc1	255	/* We use the temporary vertex for our main vertices and we abandon main
SP	256	* vertices, because their neighbours are not correctly ordered */
	257	// tvtx=vlist->vtx;
	258	// vlist->vtx=tvtx;
	259	// tvlist->vtx=vtx;
	260	vtx_list_free(vlist);
	261	/* Let's make a check if the number of bonds is correct */
	262	if((blist->n)!=3*(tvlist->n-2)){
	263	ts_fprintf(stderr,"Number of bonds is %u should be %u!\n", blist->n, 3*(tvlist->n-2));
	264	fatal("Number of bonds is not 3*(no_vertex-2).",4);
7958e9	265	}
SP	266
b01cc1	267	return tvlist;
7958e9	268	}
SP	269
	270
	271	ts_bool init_vesicle_bonds(ts_vesicle *vesicle){
	272	ts_vertex_list *vlist=vesicle->vlist;
	273	ts_bond_list *blist=vesicle->blist;
	274	ts_vertex **vtx=vesicle->vlist->vtx - 1; // Because of 0 indexing
	275	/* lets make correct clockwise ordering of in nearest neighbour list */
	276	ts_uint i,j,k;
	277	for(i=1;i<=vlist->n;i++){
	278	for(j=i+1;j<=vlist->n;j++){
8f6a69	279	for(k=0;k<vtx[i]->neigh_no;k++){ // has changed 0 to < instead of 1 and <=
SP	280	if(vtx[i]->neigh[k]==vtx[j]){ //if addresses matches it is the same
7958e9	281	bond_add(blist,vtx[i],vtx[j]);
SP	282	break;
	283	}
	284	}
	285	}
	286	}
	287	/* Let's make a check if the number of bonds is correct */
	288	if((blist->n)!=3*(vlist->n-2)){
	289	ts_fprintf(stderr,"Number of bonds is %u should be %u!\n", blist->n, 3*(vlist->n-2));
	290	fatal("Number of bonds is not 3*(no_vertex-2).",4);
	291	}
	292	return TS_SUCCESS;
	293	}
	294
	295
	296
	297	ts_bool init_triangles(ts_vesicle *vesicle){
	298	ts_uint i,j,jj,k;
	299	ts_vertex **vtx=vesicle->vlist->vtx -1; // difference between 0 indexing and 1 indexing
	300	ts_triangle_list *tlist=vesicle->tlist;
	301	ts_double dist, direct;
	302	ts_double eps=0.001; // can we use EPS from math.h?
	303	k=0;
	304	for(i=1;i<=vesicle->vlist->n;i++){
8f6a69	305	for(j=1;j<=vtx[i]->neigh_no;j++){
SP	306	for(jj=1;jj<=vtx[i]->neigh_no;jj++){
7958e9	307	// ts_fprintf(stderr,"%u: (%u,%u) neigh_no=%u ",i,j,jj,vtx[i].neigh_no);
SP	308	// ts_fprintf(stderr,"%e, %e",vtx[i].neigh[j-1]->x,vtx[i].neigh[jj-1]->x);
8f6a69	309	dist=vtx_distance_sq(vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
SP	310	direct=vtx_direct(vtx[i],vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
	311	// TODO: same as above
	312	if(fabs(dist-A0*A0)<=eps && direct < 0.0 && vtx[i]->neigh[j-1]->idx+1 > i && vtx[i]->neigh[jj-1]->idx+1 >i){
	313	triangle_add(tlist,vtx[i],vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
7958e9	314	}
SP	315	}
	316	}
	317	}
	318	/* We check if all triangles have 3 vertices and if the number of triangles
	319	* matches the theoretical value.
	320	*/
	321	for(i=0;i<tlist->n;i++){
	322	k=0;
	323	for(j=0;j<3;j++){
41a035	324	if(tlist->tria[i]->vertex[j]!=NULL)
7958e9	325	k++;
SP	326	}
	327	if(k!=3){
8f6a69	328	fatal("Some triangles have less than 3 vertices..",4);
7958e9	329	}
SP	330	}
	331	if(tlist->n!=2*(vesicle->vlist->n -2)){
	332	ts_fprintf(stderr,"The number of triangles is %u but should be %u!\n",tlist->n,2*(vesicle->vlist->n -2));
	333	fatal("The number of triangles doesn't match 2*(no_vertex -2).",4);
	334	}
	335	return TS_SUCCESS;
	336	}
	337
	338
	339
	340	ts_bool init_triangle_neighbours(ts_vesicle *vesicle){
	341	ts_uint i,j,nobo;
	342	ts_vertex i1,i2,i3,j1,j2,j3;
	343	// ts_vertex **vtx=vesicle->vlist->vtx -1; // difference between 0 indexing and 1 indexing
	344	ts_triangle_list *tlist=vesicle->tlist;
	345	ts_triangle **tria=tlist->tria -1;
	346	nobo=0;
	347	for(i=1;i<=tlist->n;i++){
41a035	348	i1=tria[i]->vertex[0];
SP	349	i2=tria[i]->vertex[1];
	350	i3=tria[i]->vertex[2];
7958e9	351	for(j=1;j<=tlist->n;j++){
SP	352	if(j==i) continue;
41a035	353	j1=tria[j]->vertex[0];
SP	354	j2=tria[j]->vertex[1];
	355	j3=tria[j]->vertex[2];
7958e9	356	if((i1==j1 && i3==j2) \|\| (i1==j2 && i3==j3) \|\| (i1==j3 && i3==j1)){
SP	357	triangle_add_neighbour(tria[i],tria[j]);
	358	nobo++;
	359	}
	360	}
	361	}
	362	for(i=1;i<=tlist->n;i++){
41a035	363	i1=tria[i]->vertex[0];
SP	364	i2=tria[i]->vertex[1];
	365	i3=tria[i]->vertex[2];
7958e9	366	for(j=1;j<=tlist->n;j++){
SP	367	if(j==i) continue;
41a035	368	j1=tria[j]->vertex[0];
SP	369	j2=tria[j]->vertex[1];
	370	j3=tria[j]->vertex[2];
7958e9	371	if((i1==j1 && i2==j3) \|\| (i1==j3 && i2==j2) \|\| (i1==j2 && i2==j1)){
SP	372	triangle_add_neighbour(tria[i],tria[j]);
	373	nobo++;
	374	}
	375	}
	376	}
	377	for(i=1;i<=tlist->n;i++){
41a035	378	i1=tria[i]->vertex[0];
SP	379	i2=tria[i]->vertex[1];
	380	i3=tria[i]->vertex[2];
7958e9	381	for(j=1;j<=tlist->n;j++){
SP	382	if(j==i) continue;
41a035	383	j1=tria[j]->vertex[0];
SP	384	j2=tria[j]->vertex[1];
	385	j3=tria[j]->vertex[2];
7958e9	386	if((i2==j1 && i3==j3) \|\| (i2==j3 && i3==j2) \|\| (i2==j2 && i3==j1)){
SP	387	triangle_add_neighbour(tria[i],tria[j]);
	388	nobo++;
	389	}
	390	}
	391	}
	392	if(nobo != vesicle->blist->n*2) {
	393	ts_fprintf(stderr,"Number of triangles= %u, number of bonds= %u\n",nobo/2, vesicle->blist->n);
	394	fatal("Number of triangle neighbour pairs differs from double the number of bonds!",4);
	395	}
	396	return TS_SUCCESS;
	397	}
	398
	399
	400	ts_bool init_common_vertex_triangle_neighbours(ts_vesicle *vesicle){
	401	ts_uint i,j,jp,k;
	402	ts_vertex k1,k2,k3,k4,*k5;
	403	ts_vertex **vtx=vesicle->vlist->vtx -1; // difference between 0 indexing and 1 indexing
	404	ts_triangle_list *tlist=vesicle->tlist;
	405	ts_triangle **tria=tlist->tria -1;
	406
	407	for(i=1;i<=vesicle->vlist->n;i++){
8f6a69	408	for(j=1;j<=vtx[i]->neigh_no;j++){
SP	409	k1=vtx[i]->neigh[j-1];
7958e9	410	jp=j+1;
8f6a69	411	if(j == vtx[i]->neigh_no) jp=1;
SP	412	k2=vtx[i]->neigh[jp-1];
7958e9	413	for(k=1;k<=tlist->n;k++){ // VERY NON-OPTIMAL!!! too many loops (vlist.n * vtx.neigh * tlist.n )!
41a035	414	k3=tria[k]->vertex[0];
SP	415	k4=tria[k]->vertex[1];
	416	k5=tria[k]->vertex[2];
7958e9	417	// ts_fprintf(stderr,"%u %u: k=(%u %u %u)\n",k1,k2,k3,k4,k5);
SP	418	if((vtx[i]==k3 && k1==k4 && k2==k5) \|\|
	419	(vtx[i]==k4 && k1==k5 && k2==k3) \|\|
	420	(vtx[i]==k5 && k1==k3 && k2==k4)){
b01cc1	421
SP	422	//TODO: probably something wrong with neighbour distribution.
	423	// if(vtx[i]==k3 \|\| vtx[i]==k4 \|\| vtx[i]==k5){
dac2e5	424	// if(i==6) ts_fprintf(stdout, "Vtx[%u] > Added to tristar!\n",i);
7958e9	425	vertex_add_tristar(vtx[i],tria[k]);
SP	426	}
	427	}
	428	}
	429	/* ts_fprintf(stderr,"TRISTAR for %u (%u):",i-1,vtx[i].tristar_no);
	430	for(j=0;j<vtx[i].tristar_no;j++){
	431	ts_fprintf(stderr," %u,",vtx[i].tristar[j]->idx);
	432	}
	433	ts_fprintf(stderr,"\n"); */
	434	}
	435	return TS_SUCCESS;
	436	}
	437
	438
	439	ts_bool init_normal_vectors(ts_triangle_list *tlist){
	440	/* Normals point INSIDE vesicle */
	441	ts_uint k;
	442	ts_triangle **tria=tlist->tria -1; //for 0 indexing
	443	for(k=1;k<=tlist->n;k++){
	444	triangle_normal_vector(tria[k]);
	445	}
	446	return TS_SUCCESS;
	447	}