| /dports/science/PETSc/petsc-3.14.1/src/dm/impls/stag/ |
| H A D | stag3d.c | 861 PetscInt nNeighbors[27][3]; in DMStagSetUpBuildScatter_3d() local
1606 eplNeighbor[0] = eprNeighbor[0] * nNeighbors[0][1]; in DMStagSetUpBuildL2G_3d()
1610 eplNeighbor[1] = eprNeighbor[1] * nNeighbors[1][1]; in DMStagSetUpBuildL2G_3d()
1614 eplNeighbor[2] = eprNeighbor[2] * nNeighbors[2][1]; in DMStagSetUpBuildL2G_3d()
1618 …eplNeighbor[3] = eprNeighbor[3] * nNeighbors[3][1] + (dummyEnd[1] ? nNeighbors[3][0] * entriesPerF… in DMStagSetUpBuildL2G_3d()
1642 eplNeighbor[9] = eprNeighbor[9] * nNeighbors[9][1]; in DMStagSetUpBuildL2G_3d()
1646 eplNeighbor[10] = eprNeighbor[10] * nNeighbors[10][1]; in DMStagSetUpBuildL2G_3d()
1650 eplNeighbor[11] = eprNeighbor[11] * nNeighbors[11][1]; in DMStagSetUpBuildL2G_3d()
1678 eplNeighbor[18] = eprNeighbor[18] * nNeighbors[18][1]; in DMStagSetUpBuildL2G_3d()
1682 eplNeighbor[19] = eprNeighbor[19] * nNeighbors[19][1]; in DMStagSetUpBuildL2G_3d()
[all …]
|
| H A D | stag2d.c | 339 PetscInt nNeighbors[9][2]; in DMSetUp_Stag_2d() local
671 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
692 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
706 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
718 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
767 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
799 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
810 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
843 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
926 const PetscInt * const nNeighbor = nNeighbors[neighbor]; in DMSetUp_Stag_2d()
[all …]
|
| H A D | stag.c | 74 PetscInt entries,width,nNeighbors,dim,dof[DMSTAG_MAX_STRATA],stencilWidth; in DMCreateMatrix_Stag() local
93 nNeighbors = 1; in DMCreateMatrix_Stag()
98 nNeighbors = 2*stencilWidth + 1; in DMCreateMatrix_Stag()
101 nNeighbors = 4*stencilWidth + 3; in DMCreateMatrix_Stag()
104 nNeighbors = 6*stencilWidth + 5; in DMCreateMatrix_Stag()
112 nNeighbors = (2*stencilWidth + 1); in DMCreateMatrix_Stag()
115 nNeighbors = (2*stencilWidth + 1) * (2*stencilWidth + 1); in DMCreateMatrix_Stag()
118 nNeighbors = (2*stencilWidth + 1) * (2*stencilWidth + 1) * (2*stencilWidth + 1); in DMCreateMatrix_Stag()
125 width = (dof[0] + dof[1] + dof[2] + dof[3]) * nNeighbors; in DMCreateMatrix_Stag()
|
| /dports/math/saga/saga-8.1.3/saga-gis/src/tools/simulation/sim_cellular_automata/ |
| H A D | Wator.cpp | 296 i = iNeighbor[(int)((double)rand() * nNeighbors / (double)RAND_MAX)];\
307 iNeighbor[8], nNeighbors, in Next_Cycle() local
337 for(i=0, nNeighbors=0; i<8; i++) in Next_Cycle()
343 iNeighbor[nNeighbors++] = i; in Next_Cycle()
347 if( nNeighbors > 0 ) in Next_Cycle()
389 for(i=0, nNeighbors=0; i<8; i++) in Next_Cycle()
395 iNeighbor[nNeighbors++] = i; in Next_Cycle()
399 if( nNeighbors > 0 ) in Next_Cycle()
422 for(i=0, nNeighbors=0; i<8; i++) in Next_Cycle()
428 iNeighbor[nNeighbors++] = i; in Next_Cycle()
[all …]
|
| /dports/graphics/instant-meshes/instant-meshes-0.0-42-g4a083f4/src/ |
| H A D | adjacency.cpp | 41 uint32_t nNeighbors = 0; in generate_adjacency_matrix_uniform() local
45 nNeighbors += 2; in generate_adjacency_matrix_uniform()
49 nNeighbors++; in generate_adjacency_matrix_uniform()
51 neighborhoodSize[i+1] = nNeighbors; in generate_adjacency_matrix_uniform()
119 uint32_t nNeighbors = 0; in generate_adjacency_matrix_cotan() local
123 nNeighbors += 2; in generate_adjacency_matrix_cotan()
127 nNeighbors++; in generate_adjacency_matrix_cotan()
129 neighborhoodSize[i+1] = nNeighbors; in generate_adjacency_matrix_cotan()
|
| H A D | hierarchy.cpp | 46 uint32_t nNeighbors = adj[i + 1] - adj[i]; in downsample_graph() local
48 for (uint32_t j = 0; j < nNeighbors; ++j) { in downsample_graph()
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/fgt/filter_scan_merging/ |
| H A D | filter_scan_merging.cpp | 79 int nNeighbors = par.getInt("numOfNeighbors"); in applyFilter() local
104 toLowFreq(vertices, nIterations, nNeighbors); in applyFilter()
127 toLowFreq(vertices, nIterations, nNeighbors); in applyFilter()
|
| /dports/science/openkim-models/openkim-models-2021-01-28/model-drivers/EMT_Asap__MD_128315414717_004/ |
| H A D | NeighborCellLocator.cpp | 613 int nNeighbors = 0; in CommonGetNeighbors() local
634 diffs[nNeighbors] = positions[*a2] - pos1; in CommonGetNeighbors()
635 diffs2[nNeighbors] = Length2(diffs[nNeighbors]); in CommonGetNeighbors()
636 neighbors[nNeighbors] = *a2; in CommonGetNeighbors()
637 nNeighbors++; in CommonGetNeighbors()
643 for (int i = 0; i < nNeighbors; i++) in CommonGetNeighbors()
655 nNeighbors = j; in CommonGetNeighbors()
656 size -= nNeighbors; in CommonGetNeighbors()
658 return nNeighbors; in CommonGetNeighbors()
|
| /dports/science/rdkit/rdkit-Release_2021_03_5/Code/Catalogs/ |
| H A D | Catalog.h | 275 unsigned int nNeighbors; in initFromStream() local
276 RDKit::streamRead(ss, nNeighbors); in initFromStream()
277 for (unsigned int j = 0; j < nNeighbors; j++) { in initFromStream()
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/mean_shift/ |
| H A D | mean_shift_impl.hpp | 62 const size_t nNeighbors = size_t(data.n_cols * ratio); in EstimateRadius() local
65 neighborSearch.Search(nNeighbors, neighbors, distances); in EstimateRadius()
|
| /dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-outlier/src/main/java/de/lmu/ifi/dbs/elki/algorithm/outlier/ |
| H A D | DWOF.java | 260 DoubleDBIDList nNeighbors = rnnQuery.getRangeForDBID(toGetNeighbors, range); in clusterData() local
261 for(DoubleDBIDListIter iter2 = nNeighbors.iter(); iter2.valid(); iter2.advance()) { in clusterData()
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/features/include/pcl/features/impl/ |
| H A D | shot.hpp | 633 const auto nNeighbors = indices.size (); in computePointSHOT() local
635 if (nNeighbors < 5) in computePointSHOT()
656 binDistanceColor.reserve (nNeighbors); in computePointSHOT()
|
| /dports/science/PETSc/petsc-3.14.1/src/dm/impls/plex/ |
| H A D | plexpartition.c | 1279 PetscInt n, numRemote, p, numPoints, pStart, pEnd, idx = 0, nNeighbors; in DMPlexPartitionLabelCreateSF() local
1299 ierr = ISGetLocalSize(neighborsIS, &nNeighbors);CHKERRQ(ierr); in DMPlexPartitionLabelCreateSF()
1301 for (numRemote = 0, n = 0; n < nNeighbors; ++n) { in DMPlexPartitionLabelCreateSF()
1320 for (n = 0; n < nNeighbors; ++n) { in DMPlexPartitionLabelCreateSF()
|
| /dports/science/py-cirq-aqt/Cirq-0.12.0/docs/tutorials/educators/ |
| H A D | neutral_atom.ipynb | 204 "print(f\"\\nNeighbors of qubit {qubit}:\")\n",
|
| /dports/science/py-cirq-ionq/Cirq-0.13.1/docs/tutorials/educators/ |
| H A D | neutral_atom.ipynb | 204 "print(f\"\\nNeighbors of qubit {qubit}:\")\n",
|
| /dports/science/py-cirq-pasqal/Cirq-0.13.1/docs/tutorials/educators/ |
| H A D | neutral_atom.ipynb | 204 "print(f\"\\nNeighbors of qubit {qubit}:\")\n",
|
| /dports/science/py-cirq-core/Cirq-0.13.1/docs/tutorials/educators/ |
| H A D | neutral_atom.ipynb | 204 "print(f\"\\nNeighbors of qubit {qubit}:\")\n",
|
| /dports/science/py-cirq-google/Cirq-0.13.0/docs/tutorials/educators/ |
| H A D | neutral_atom.ipynb | 204 "print(f\"\\nNeighbors of qubit {qubit}:\")\n",
|
| /dports/audio/faust/faust-2.37.3/architecture/webaudio/ |
| H A D | libfaust-wasm.data | 24494 nNeighbors = 2*R+1;
24495 nCoeffs = nNeighbors*(T+1);
24496 nInputs = nNeighbors+1+nCoeffs;
24534 nNeighbors = nNeighborsXY^2;
24535 nCoeffs = nNeighbors*(T+1);
24536 nInputs = nNeighbors+1+nCoeffs;
24569 nNeighbors = (2*R+1)^D;
24571 route(nNeighbors*(T+1)+nNeighbors+1,2*nNeighbors*(T+1)+1,
24574 par(i,nNeighbors,i+t*nNeighbors+2,2*(i+t*nNeighbors)+3,
24575 i+nNeighbors*(T+1)+2,2*(i+t*nNeighbors)+2)));
[all …]
|