Home
last modified time | relevance | path

Searched refs:numcells (Results 1 – 25 of 180) sorted by relevance

12345678

/dports/science/openems/openEMS-0.0.35-71-g4c24b6e/matlab/
H A DAddPML.m1 function mesh = AddPML( mesh, numcells, CoordSystem )
2 % mesh = AddPML( mesh, numcells, <CoordSystem> )
42 if (numel(numcells)==1)
43 numcells = ones(6,1)*numcells; variable
46 numcells = reshape( numcells, 1, [] ); variable
47 if numel(numcells) ~= 6
66 start = mesh.(dir_names(1))(1) - numcells(1)*delta;
71 stop = mesh.(dir_names(1))(end) + numcells(2)*delta;
76 start = mesh.(dir_names(2))(1) - numcells(3)*delta;
81 stop = mesh.(dir_names(2))(end) + numcells(4)*delta;
[all …]
/dports/math/vtk8/VTK-8.2.0/Rendering/Core/
H A DvtkCellCenterDepthSort.cxx131 vtkIdType numcells = this->Input->GetNumberOfCells(); in ComputeCellCenters() local
132 this->CellCenters->SetNumberOfTuples(numcells); in ComputeCellCenters()
138 for (vtkIdType i = 0; i < numcells; i++) in ComputeCellCenters()
155 vtkIdType numcells = this->Input->GetNumberOfCells(); in ComputeDepths() local
159 for (vtkIdType i = 0; i < numcells; i++) in ComputeDepths()
170 vtkIdType numcells = this->Input->GetNumberOfCells(); in InitTraversal() local
179 this->CellDepths->SetNumberOfTuples(numcells); in InitTraversal()
180 this->SortedCells->SetNumberOfTuples(numcells); in InitTraversal()
185 for (vtkIdType i = 0; i < numcells; i++) in InitTraversal()
194 this->ToSort->Stack.push(vtkIdPair(0, numcells)); in InitTraversal()
[all …]
/dports/math/vtk9/VTK-9.1.0/Rendering/Core/
H A DvtkCellCenterDepthSort.cxx132 vtkIdType numcells = this->Input->GetNumberOfCells(); in ComputeCellCenters() local
133 this->CellCenters->SetNumberOfTuples(numcells); in ComputeCellCenters()
139 for (vtkIdType i = 0; i < numcells; i++) in ComputeCellCenters()
158 vtkIdType numcells = this->Input->GetNumberOfCells(); in ComputeDepths() local
162 for (vtkIdType i = 0; i < numcells; i++) in ComputeDepths()
173 vtkIdType numcells = this->Input->GetNumberOfCells(); in InitTraversal() local
181 this->CellDepths->SetNumberOfTuples(numcells); in InitTraversal()
182 this->SortedCells->SetNumberOfTuples(numcells); in InitTraversal()
187 for (vtkIdType i = 0; i < numcells; i++) in InitTraversal()
197 this->ToSort->Stack.push(vtkIdPair(0, numcells)); in InitTraversal()
[all …]
/dports/math/vtk6/VTK-6.2.0/Rendering/Core/
H A DvtkCellCenterDepthSort.cxx131 vtkIdType numcells = this->Input->GetNumberOfCells(); in ComputeCellCenters() local
132 this->CellCenters->SetNumberOfTuples(numcells); in ComputeCellCenters()
138 for (vtkIdType i = 0; i < numcells; i++) in ComputeCellCenters()
155 vtkIdType numcells = this->Input->GetNumberOfCells(); in ComputeDepths() local
159 for (vtkIdType i = 0; i < numcells; i++) in ComputeDepths()
170 vtkIdType numcells = this->Input->GetNumberOfCells(); in InitTraversal() local
179 this->CellDepths->SetNumberOfTuples(numcells); in InitTraversal()
180 this->SortedCells->SetNumberOfTuples(numcells); in InitTraversal()
185 for (vtkIdType i = 0; i < numcells; i++) in InitTraversal()
194 this->ToSort->Stack.push(vtkIdPair(0, numcells)); in InitTraversal()
[all …]
/dports/math/gap/gap-4.11.0/pkg/grape-4.8.3/nauty22/
H A Dnauty.c239 int numcells; in nauty() local
403 numcells = 1; in nauty()
408 numcells = 0; in nauty()
411 else ++numcells; in nauty()
457 retval = firstpathnode(lab,ptn,1,numcells); in nauty()
555 if (numcells != n) in firstpathnode0()
858 else if (numcells == n) in processnode()
1026 int numorbits, int numcells) in writemarker() argument
1036 if (numcells != numorbits) in writemarker()
1038 PUTINT(numcells); in writemarker()
[all …]
H A Dgtnauty.c81 int numcells,code; in fcanonise() local
103 numcells = 1; in fcanonise()
127 ++numcells; in fcanonise()
154 gt_numorbits = numcells; in fcanonise()
201 int numcells,code; in fcanonise_inv() local
223 numcells = 1; in fcanonise_inv()
274 gt_numorbits = numcells; in fcanonise_inv()
325 int numcells,code; in fgroup() local
346 numcells = 1; in fgroup()
461 int numcells,code; in fgroup_inv() local
[all …]
H A Ddreadnaut.c222 int i,worksize,numcells,refcode,umask,qinvar; in main() local
642 unitptn(lab,ptn,&numcells,n); in main()
656 SS(numcells,"","s"),refcode); in main()
666 if (numcells > 1) pvalid = TRUE; in main()
671 unitptn(lab,ptn,&numcells,n); in main()
681 SS(numcells,"","s"),refcode); in main()
682 if (numcells > 1) pvalid = TRUE; in main()
1130 if (numcells == n) in usernode()
1133 fprintf(OUTFILE,"(%d/%d)\n",numcells,code); in usernode()
1135 fprintf(OUTFILE,"(%d/%d/%d)\n",numcells,code,tc); in usernode()
[all …]
H A Dnaugraph.c169 refine(graph *g, int *lab, int *ptn, int level, int *numcells, in refine() argument
174 refine1(g,lab,ptn,level,numcells,count,active,code,m,n); in refine()
193 longcode = *numcells;
228 ++*numcells;
300 ++*numcells;
317 longcode = MASH(longcode,*numcells);
332 refine1(graph *g, int *lab, int *ptn, int level, int *numcells, in refine1() argument
348 longcode = *numcells; in refine1()
384 ++*numcells; in refine1()
450 ++*numcells; in refine1()
[all …]
H A Dnautil.c457 doref(graph *g, int *lab, int *ptn, int level, int *numcells, in doref() argument
478 (*refproc)(g,lab,ptn,level,numcells,invar,active,code,M,n); in doref()
482 if (invarproc != NULL && *numcells < n in doref()
485 (*invarproc)(g,lab,ptn,level,*numcells,tvpos,invar,invararg, in doref()
489 nc = *numcells; in doref()
528 ++*numcells; in doref()
533 if (*numcells > nc) in doref()
537 (*refproc)(g,lab,ptn,level,numcells,invar,active,code,M,n); in doref()
566 targetcell(graph *g, int *lab, int *ptn, int level, int numcells, in targetcell() argument
/dports/math/nauty/nauty27r3/
H A Dgtnauty.c174 int numcells,code; in fcanonise() local
204 if (numcells == n || (numcells == n-1 && !digraph)) in fcanonise()
208 gt_numorbits = numcells; in fcanonise()
255 int numcells,code; in fcanonise_inv() local
284 if (numcells == n || (!digraph && numcells >= n-1)) in fcanonise_inv()
288 gt_numorbits = numcells; in fcanonise_inv()
341 int numcells,code; in fcanonise_inv_sg() local
372 if (numcells == n || (!digraph && numcells == n-1)) in fcanonise_inv_sg()
376 gt_numorbits = numcells; in fcanonise_inv_sg()
426 int numcells,code; in fgroup() local
[all …]
H A Dnauty.c256 int numcells; in nauty() local
431 numcells = 1; in nauty()
436 numcells = 0; in nauty()
439 else ++numcells; in nauty()
500 retval = firstpathnode(lab,ptn,1,numcells); in nauty()
608 if (numcells != n) in firstpathnode0()
931 else if (numcells == n) in processnode()
1111 int numorbits, int numcells) in writemarker() argument
1121 if (numcells != numorbits) in writemarker()
1123 PUTINT(numcells); in writemarker()
[all …]
H A Ddreadnaut.c1294 if (numcells > 1) pvalid = TRUE; in main()
1304 if (numcells > 1) pvalid = TRUE; in main()
1353 savednc = numcells; in main()
1375 numcells = savednc; in main()
1447 savednc = numcells; in main()
1880 ++numcells; in main()
1968 numcells = 0; in main()
1983 ++numcells; in main()
2017 numcells = 0; in main()
2024 ++numcells; in main()
[all …]
H A Dnaugraph.c178 refine(graph *g, int *lab, int *ptn, int level, int *numcells, in refine() argument
183 refine1(g,lab,ptn,level,numcells,count,active,code,m,n); in refine()
202 longcode = *numcells;
237 ++*numcells;
309 ++*numcells;
326 longcode = MASH(longcode,*numcells);
341 refine1(graph *g, int *lab, int *ptn, int level, int *numcells, in refine1() argument
357 longcode = *numcells; in refine1()
393 ++*numcells; in refine1()
459 ++*numcells; in refine1()
[all …]
/dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/
H A Dgtnauty.c174 int numcells,code; in fcanonise() local
204 if (numcells == n || (numcells == n-1 && !digraph)) in fcanonise()
208 gt_numorbits = numcells; in fcanonise()
255 int numcells,code; in fcanonise_inv() local
284 if (numcells == n || (!digraph && numcells >= n-1)) in fcanonise_inv()
288 gt_numorbits = numcells; in fcanonise_inv()
341 int numcells,code; in fcanonise_inv_sg() local
372 if (numcells == n || (!digraph && numcells == n-1)) in fcanonise_inv_sg()
376 gt_numorbits = numcells; in fcanonise_inv_sg()
426 int numcells,code; in fgroup() local
[all …]
H A Dnauty.c256 int numcells; in nauty() local
431 numcells = 1; in nauty()
436 numcells = 0; in nauty()
439 else ++numcells; in nauty()
500 retval = firstpathnode(lab,ptn,1,numcells); in nauty()
608 if (numcells != n) in firstpathnode0()
931 else if (numcells == n) in processnode()
1111 int numorbits, int numcells) in writemarker() argument
1121 if (numcells != numorbits) in writemarker()
1123 PUTINT(numcells); in writemarker()
[all …]
H A Ddreadnaut.c1294 if (numcells > 1) pvalid = TRUE; in main()
1304 if (numcells > 1) pvalid = TRUE; in main()
1353 savednc = numcells; in main()
1375 numcells = savednc; in main()
1447 savednc = numcells; in main()
1880 ++numcells; in main()
1968 numcells = 0; in main()
1983 ++numcells; in main()
2017 numcells = 0; in main()
2024 ++numcells; in main()
[all …]
H A Dnaugraph.c178 refine(graph *g, int *lab, int *ptn, int level, int *numcells, in refine() argument
183 refine1(g,lab,ptn,level,numcells,count,active,code,m,n); in refine()
202 longcode = *numcells;
237 ++*numcells;
309 ++*numcells;
326 longcode = MASH(longcode,*numcells);
341 refine1(graph *g, int *lab, int *ptn, int level, int *numcells, in refine1() argument
357 longcode = *numcells; in refine1()
393 ++*numcells; in refine1()
459 ++*numcells; in refine1()
[all …]
/dports/devel/ChipmunkPhysics/Chipmunk-7.0.1/src/
H A DcpSpaceHash.c31 int numcells; member
127 for(int i=0; i<hash->numcells; i++) clearTableCell(hash, i); in clearTable()
163 cpSpaceHashAllocTable(cpSpaceHash *hash, int numcells) in cpSpaceHashAllocTable() argument
167 hash->numcells = numcells; in cpSpaceHashAllocTable()
178 cpSpaceHashAllocTable(hash, next_prime(numcells)); in cpSpaceHashInit()
251 int n = hash->numcells; in hashHandle()
386 int n = hash->numcells; in cpSpaceHashQuery()
415 int n = hash->numcells; in queryRehash_helper()
524 int n = hash->numcells; in cpSpaceHashSegmentQuery()
558 cpSpaceHashAllocTable(hash, next_prime(numcells)); in cpSpaceHashResize()
[all …]
/dports/math/vtk8/VTK-8.2.0/Filters/Geometry/Testing/Python/
H A DstructuredGridBlanking.py39 numcells = sg.GetNumberOfCells() variable
40 if 11 < numcells:
42 if 64 < numcells:
44 if 164 < numcells:
/dports/math/vtk9/VTK-9.1.0/Filters/Geometry/Testing/Python/
H A DstructuredGridBlanking.py39 numcells = sg.GetNumberOfCells() variable
40 if 11 < numcells:
42 if 64 < numcells:
44 if 164 < numcells:
/dports/math/vtk6/VTK-6.2.0/Filters/Geometry/Testing/Python/
H A DstructuredGridBlanking.py40 numcells = sg.GetNumberOfCells() variable
41 if 11 < numcells:
43 if 64 < numcells:
45 if 164 < numcells:
/dports/graphics/processing/processing-1.5.1/modes/android/examples/Topics/Cellular Automata/Spore1/
H A DSpore1.pde13 int numcells = 0;
41 cells[numcells] = new Cell(cX, cY);
42 numcells++;
51 int selected = min((int)random(numcells), numcells - 1);
130 numcells = 0;
/dports/graphics/processing/processing-1.5.1/modes/java/examples/Topics/Cellular Automata/Spore1/
H A DSpore1.pde13 int numcells = 0;
41 cells[numcells] = new Cell(cX, cY);
42 numcells++;
51 int selected = min((int)random(numcells), numcells - 1);
130 numcells = 0;
/dports/cad/magic/magic-8.3.245/database/
H A DDBcellname.c718 int found, numcells; local
751 numcells = dbCellDefTable.ht_nEntries;
752 if (numcells == 0) numcells = 1;
754 numcells = 0;
766 celllist[numcells++] = celldef->cd_name;
773 while (--numcells >= 0)
793 numcells = dbCellDefTable.ht_nEntries;
794 if (numcells == 0) numcells = 1;
796 numcells = 0;
829 while (--numcells >= 0)
[all …]
/dports/math/vtk8/VTK-8.2.0/Filters/General/Testing/Cxx/
H A DBoxClipTriangulate.cxx175 vtkIdType numcells, in BuildInput() argument
213 for (i = 0; i < numcells; i++) in BuildInput()
230 static void Check2DPrimitive(int type, vtkIdType numcells, in Check2DPrimitive() argument
234 = BuildInput(type, numcells, cells); in Check2DPrimitive()
274 static void Check3DPrimitive(int type, vtkIdType numcells, in Check3DPrimitive() argument
278 = BuildInput(type, numcells, cells); in Check3DPrimitive()

12345678