Home
last modified time | relevance | path

Searched refs:nonodes (Results 1 – 25 of 86) sorted by relevance

1234

/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/phylip/src/
H A Ddist.cpp49 if(!memLocker.tryAcquire(nonodes*sizeof(node *) + spp * sizeof(node) + nonodes*3*sizeof(node))) { in dist_alloctree()
55 for (i = spp; i < nonodes; i++) { in dist_alloctree()
75 for (i = spp; i < nonodes; i++) { in dist_freetree()
99 for (i = spp; i < nonodes; i++) { in allocd()
109 void freed(long nonodes, pointptr treenode) in freed() argument
118 for (i = spp; i < nonodes; i++) { in freed()
137 for (i = spp; i < nonodes; i++) { in allocw()
147 void freew(long nonodes, pointptr treenode) in freew() argument
156 for (i = spp; i < nonodes; i++) { in freew()
166 void dist_setuptree(tree *a, long nonodes) in dist_setuptree() argument
[all …]
H A Dseq.cpp105 for (i = spp; i < nonodes; i++) { in freetree2()
238 for (i = spp; i < nonodes; i++) { in alloctree()
270 for (i = spp; i < nonodes; i++) { in allocx()
321 for (i = 1; i <= nonodes; i++) { in setuptree()
1610 last = nonodes; in flipindexes()
1664 min = nonodes; in smallest()
1808 for (i = 0; i < nonodes; i++) in savetree()
1918 for (i = 0; i < nonodes; i++) { in clearcollapse()
1937 for (i = 0; i < nonodes; i++) { in clearbottom()
2370 for (i = 0; i < nonodes; i++) { in clearvisited()
[all …]
H A Dseq.h83 extern long nonodes, endsite, outgrno, nextree, which;
220 void prot_freex_notip(long nonodes, pointarray treenode);
221 void prot_freex(long nonodes, pointarray treenode);
H A Dphylip.h729 void unroot_r(node* p,node ** nodep, long nonodes);
730 void unroot(tree* t,long nonodes);
731 void unroot_here(node* root, node** nodep, long nonodes);
732 void clear_connections(tree *t, long nonodes);
H A Dphylip.cpp1209 *nonodes = *spp * 2 - n; in inputnumbersold()
1225 *nonodes = *spp * 2 - n; in inputnumbers()
1239 *nonodes = *spp * 2 - n; in inputnumbers2()
2837 void unroot(tree *t, long nonodes) in unroot() argument
2857 unroot_r(t->start,t->nodep,nonodes); in unroot()
2858 unroot_r(t->start->back, t->nodep, nonodes); in unroot()
2880 while ( root->index != nonodes ) { in unroot_here()
2904 unroot_here(q, nodep, nonodes); in unroot_r()
2905 else unroot_r(q->back, nodep, nonodes); in unroot_r()
2910 void clear_connections(tree *t, long nonodes) in clear_connections() argument
[all …]
H A Dneighbor.cpp250 void inputnumbers2_modified(long *spp, long *nonodes, long n) in inputnumbers2_modified() argument
252 *nonodes = *spp * 2 - n; in inputnumbers2_modified()
/dports/science/elmerfem/elmerfem-release-9.0/elmergrid/src/
H A Degexport.c49 int noknots,noelements,nonodes; in SaveAbaqusInput() local
56 nonodes = data->maxnodes; in SaveAbaqusInput()
58 if(nonodes != 4 && nonodes != 8) { in SaveAbaqusInput()
80 if(nonodes == 4) fprintf(out,"DC2D4 "); in SaveAbaqusInput()
81 else if(nonodes == 8) fprintf(out,"DC2D8 "); in SaveAbaqusInput()
87 for(j=1;j<nonodes;j++) in SaveAbaqusInput()
89 fprintf(out,"%6d\n",data->topology[i][nonodes-1]); in SaveAbaqusInput()
121 int noknots,noelements,dim,nonodes; in SaveFidapOutput() local
197 nonodes = elemcodes[no]%100; in SaveFidapOutput()
201 nogroup,cellelem,nonodes,1,1); in SaveFidapOutput()
[all …]
H A Degnative.c344 grid->nonodes = 4; in InitGrid()
438 grid->nonodes = 2; in ExampleGrid1D()
1174 cell[cnew].nonodes = grid->nonodes; in SetCellData()
1263 nonodes = grid->nonodes; in SetCellKnots()
1470 nonodes = grid->nonodes; in SetCellKnots1D()
1589 else if(cell->nonodes == 8 || cell->nonodes == 9) in GetKnotIndex()
1591 else if(cell->nonodes == 12 || cell->nonodes == 16) in GetKnotIndex()
1654 nonodes = cell->nonodes; in GetElementIndices()
1811 k = nonodes = cell->nonodes; in GetElementCoordinates()
1872 else if(nonodes == 8 || nonodes == 9) { in GetElementCoordinates()
[all …]
H A Degmesh.c1296 nonodes = grid->nonodes; in CreateKnots()
1483 dy = globalcoord[nonodes]-globalcoord[nonodes+1]; in CreateKnots()
1488 dy = globalcoord[nonodes]-globalcoord[2*nonodes-1]; in CreateKnots()
3633 cands[2] = (i+nonodes-1)%nonodes; in ReorderAutomatic()
4638 if(nonodes == 3 || nonodes == 4) { in FindBulkBoundary()
4643 dx2 = data->x[ind[(k+nonodes-1)%nonodes]] - data->x[ind[k]]; in FindBulkBoundary()
4644 dy2 = data->y[ind[(k+nonodes-1)%nonodes]] - data->y[ind[k]]; in FindBulkBoundary()
4645 dz2 = data->z[ind[(k+nonodes-1)%nonodes]] - data->z[ind[k]]; in FindBulkBoundary()
4847 dx2 = data->x[sideind[(k+nonodes-1)%nonodes]] - data->x[sideind[k]]; in FindBoundaryBoundary()
4848 dy2 = data->y[sideind[(k+nonodes-1)%nonodes]] - data->y[sideind[k]]; in FindBoundaryBoundary()
[all …]
H A Degparallel.c1080 x = x / nonodes; in PartitionSimpleElementsNonRecursive()
1081 y = y / nonodes; in PartitionSimpleElementsNonRecursive()
1082 z = z / nonodes; in PartitionSimpleElementsNonRecursive()
1248 x = x / nonodes; in PartitionSimpleElementsRotational()
1249 y = y / nonodes; in PartitionSimpleElementsRotational()
1250 z = z / nonodes; in PartitionSimpleElementsRotational()
1305 x = x / nonodes; in PartitionSimpleElementsRotational()
1306 y = y / nonodes; in PartitionSimpleElementsRotational()
1307 z = z / nonodes; in PartitionSimpleElementsRotational()
2366 int elemfamily,nonodes; in LinearNodes() local
[all …]
H A Degconvert.c5096 for(i=0;i<nonodes;i++) { in UnvRedundantIndexes()
5103 for(i=0;i<nonodes;i++) in UnvRedundantIndexes()
5323 nonodes = next_int(&cp); in LoadUniversalMesh()
5484 nonodes = next_int(&cp); in LoadUniversalMesh()
5515 for(i=0;i<nonodes;i++) in LoadUniversalMesh()
5912 switch( nonodes ) { in FluxToElmerType()
6031 nonodes = next_int(&cp); in LoadFluxMesh()
6040 for(k=0;k<nonodes;k++) { in LoadFluxMesh()
6220 switch( nonodes ) { in FluxToElmerType3D()
6237 switch( nonodes ) { in FluxToElmerType3D()
[all …]
H A Degtypes.h78 nonodes, /* number of nodes in one element */ member
141 int nonodes, /* number of nodes within an element */ member
H A Degextra.c486 int elemtype,nonodes,i,j,k; in InspectElement() local
495 nonodes = elemtype % 100; in InspectElement()
500 for(k=0;k<nonodes;k++) { in InspectElement()
509 for(i=0;i<nonodes;i++) { in InspectElement()
511 for(j=i+1;j<nonodes;j++) { in InspectElement()
1121 nonodes1 = grid1->nonodes; in SolutionFromMeshToMesh()
1122 nonodes2 = grid2->nonodes; in SolutionFromMeshToMesh()
/dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/Application/plugins/
H A Degnative.cpp344 grid->nonodes = 4; in InitGrid()
438 grid->nonodes = 2; in ExampleGrid1D()
1174 cell[cnew].nonodes = grid->nonodes; in SetCellData()
1263 nonodes = grid->nonodes; in SetCellKnots()
1470 nonodes = grid->nonodes; in SetCellKnots1D()
1589 else if(cell->nonodes == 8 || cell->nonodes == 9) in GetKnotIndex()
1591 else if(cell->nonodes == 12 || cell->nonodes == 16) in GetKnotIndex()
1654 nonodes = cell->nonodes; in GetElementIndices()
1811 k = nonodes = cell->nonodes; in GetElementCoordinates()
1872 else if(nonodes == 8 || nonodes == 9) { in GetElementCoordinates()
[all …]
H A Degmesh.cpp1296 nonodes = grid->nonodes; in CreateKnots()
1483 dy = globalcoord[nonodes]-globalcoord[nonodes+1]; in CreateKnots()
1488 dy = globalcoord[nonodes]-globalcoord[2*nonodes-1]; in CreateKnots()
3633 cands[2] = (i+nonodes-1)%nonodes; in ReorderAutomatic()
4638 if(nonodes == 3 || nonodes == 4) { in FindBulkBoundary()
4643 dx2 = data->x[ind[(k+nonodes-1)%nonodes]] - data->x[ind[k]]; in FindBulkBoundary()
4644 dy2 = data->y[ind[(k+nonodes-1)%nonodes]] - data->y[ind[k]]; in FindBulkBoundary()
4645 dz2 = data->z[ind[(k+nonodes-1)%nonodes]] - data->z[ind[k]]; in FindBulkBoundary()
4847 dx2 = data->x[sideind[(k+nonodes-1)%nonodes]] - data->x[sideind[k]]; in FindBoundaryBoundary()
4848 dy2 = data->y[sideind[(k+nonodes-1)%nonodes]] - data->y[sideind[k]]; in FindBoundaryBoundary()
[all …]
H A Degconvert.cpp5096 for(i=0;i<nonodes;i++) { in UnvRedundantIndexes()
5103 for(i=0;i<nonodes;i++) in UnvRedundantIndexes()
5323 nonodes = next_int(&cp); in LoadUniversalMesh()
5484 nonodes = next_int(&cp); in LoadUniversalMesh()
5515 for(i=0;i<nonodes;i++) in LoadUniversalMesh()
5912 switch( nonodes ) { in FluxToElmerType()
6031 nonodes = next_int(&cp); in LoadFluxMesh()
6040 for(k=0;k<nonodes;k++) { in LoadFluxMesh()
6220 switch( nonodes ) { in FluxToElmerType3D()
6237 switch( nonodes ) { in FluxToElmerType3D()
[all …]
H A Degtypes.h78 nonodes, /* number of nodes in one element */ member
141 int nonodes, /* number of nodes within an element */ member
/dports/graphics/argyllcms/Argyll_V1.9.2/rspl/
H A Dgam.c246 *nonodes = 0; in get_ssimplex_nodes()
307 if (*nonodes >= aonodes) in get_ssimplex_nodes()
312 onodes[*nonodes] = get_vert(s, gix); in get_ssimplex_nodes()
316 (*nonodes)++; in get_ssimplex_nodes()
781 if (nonodes == 0) in gam_comp_gamut()
785 for(i = 0; i < nonodes; i++) in gam_comp_gamut()
790 for (i = 0; i < nonodes; i++) { in gam_comp_gamut()
815 if (nonodes == 0) in gam_comp_gamut()
819 for(i = 0; i < nonodes; i++) in gam_comp_gamut()
824 for (i = 0; i < nonodes; i++) { in gam_comp_gamut()
[all …]
/dports/biology/seaview/seaview/csrc/
H A Dseq.c99 for (i = spp; i < nonodes; i++) { in freetree2()
232 for (i = spp; i < nonodes; i++) { in alloctree()
264 for (i = spp; i < nonodes; i++) { in allocx()
315 for (i = 1; i <= nonodes; i++) { in setuptree()
1603 last = nonodes; in flipindexes()
1657 min = nonodes; in smallest()
1801 for (i = 0; i < nonodes; i++) in savetree()
1911 for (i = 0; i < nonodes; i++) { in clearcollapse()
1930 for (i = 0; i < nonodes; i++) { in clearbottom()
2363 for (i = 0; i < nonodes; i++) { in clearvisited()
[all …]
H A Dseq.h82 extern long nonodes, endsite, outgrno, nextree, which;
220 void prot_freex_notip(long nonodes, pointarray treenode);
221 void prot_freex(long nonodes, pointarray treenode);
H A Dphylip.h718 void unroot_r(node* p,node ** nodep, long nonodes);
719 void unroot(tree* t,long nonodes);
720 void unroot_here(node* root, node** nodep, long nonodes);
721 void clear_connections(tree *t, long nonodes);
H A Dphylip.c1169 *nonodes = *spp * 2 - n; in inputnumbersold()
1185 *nonodes = *spp * 2 - n; in inputnumbers()
1199 *nonodes = *spp * 2 - n; in inputnumbers2()
2787 void unroot(tree *t, long nonodes) in unroot() argument
2807 unroot_r(t->start,t->nodep,nonodes); in unroot()
2808 unroot_r(t->start->back, t->nodep, nonodes); in unroot()
2830 while ( root->index != nonodes ) { in unroot_here()
2854 unroot_here(q, nodep, nonodes); in unroot_r()
2855 else unroot_r(q->back, nodep, nonodes); in unroot_r()
2860 void clear_connections(tree *t, long nonodes) in clear_connections() argument
[all …]
H A Dprotpars.c556 treenode = (pointarray)Malloc(nonodes*sizeof(node *)); in protalloctree()
563 for (i = spp; i < (nonodes); i++) { in protalloctree()
583 for (i = 0; i < nonodes; i++) { in protfreetree()
638 for (i = 0; i < nonodes; i++) { in reallocchars()
683 place = (long *)Malloc(nonodes*sizeof(long)); in allocrest()
704 nonodes = (spp * 2 - 1); in doinit()
918 for (i = 1; i <= nonodes; i++) { in protmakevalues()
1247 for (i = 0; i < (nonodes); i++) in protsavetree()
1929 for (j = 0; j < (nonodes); j++) { in maketree()
H A Ddnapars.c381 bestrees[i - 1].btree = (long *)Malloc(nonodes*sizeof(long)); in allocrest()
384 place = (long *)Malloc(nonodes*sizeof(long)); in allocrest()
400 nonodes = (spp * 2 - 1); in doinit()
405 alloctree(&treenode, nonodes, usertree); in doinit()
1257 for (j = 0; j < nonodes; j++) { in globrearrange()
1504 &haslengths, &grbg, initdnaparsnode,false,nonodes); in maketree()
1615 freenodes(nonodes, treenode); in freerest()
1672 freetree(nonodes, treenode); in dnapars()
/dports/devel/mercurial/mercurial-6.0/mercurial/
H A Drevlog.py1174 nonodes = ([], [], [])
1178 return nonodes
1201 return nonodes
1234 return nonodes
1250 return nonodes

1234