Home
last modified time | relevance | path

Searched refs:numNodes (Results 1 – 25 of 1555) sorted by relevance

12345678910>>...63

/dports/java/jgraph/jgraph-java-5.13.0.4/examples/com/jgraph/example/
H A DJGraphGraphFactory.java180 Object[] cells2 = new Object[numNodes + numNodes - 1]; in insertTreeSampleData()
181 System.arraycopy(cells, numNodes, cells2, 0, numNodes - 1); in insertTreeSampleData()
182 System.arraycopy(cells, 0, cells2, numNodes - 1, numNodes); in insertTreeSampleData()
235 Object[] cells2 = new Object[numNodes + numNodes - 1]; in insertTreeSampleData()
236 System.arraycopy(cells, numNodes, cells2, 0, numNodes - 1); in insertTreeSampleData()
237 System.arraycopy(cells, 0, cells2, numNodes - 1, numNodes); in insertTreeSampleData()
418 int numEdges = ((numNodes - 1) * (numNodes)) / 2; in insertFullyConnectedGraphSampleData()
680 return numNodes; in getNumNodes()
688 if (numNodes < 1) { in setNumNodes()
689 numNodes = 1; in setNumNodes()
[all …]
/dports/graphics/openvkl/openvkl-1.1.0/utility/vdb/include/openvkl/utility/vdb/
H A DVdbVolumeBuffers.h56 size_t numNodes() const;
68 void reserve(size_t numNodes);
246 level.reserve(numNodes); in reserve()
247 origin.reserve(numNodes); in reserve()
248 format.reserve(numNodes); in reserve()
253 data.reserve(numNodes); in reserve()
270 const size_t index = numNodes(); in addTile()
350 const size_t index = numNodes(); in addConstant()
497 numNodes, in createVolume()
509 numNodes, in createVolume()
[all …]
/dports/math/vtk6/VTK-6.2.0/Common/ExecutionModel/
H A DvtkExtentRCBPartitioner.cxx193 int numNodes = 0; in SplitExtent() local
287 int numNodes = 0; in GetNumberOfNodes() local
302 numNodes = ilength*jlength; in GetNumberOfNodes()
307 numNodes = jlength*klength; in GetNumberOfNodes()
312 numNodes = ilength*klength; in GetNumberOfNodes()
324 return( numNodes ); in GetNumberOfNodes()
330 int numNodes = 0; in GetNumberOfCells() local
345 numNodes = ilength*jlength; in GetNumberOfCells()
350 numNodes = jlength*klength; in GetNumberOfCells()
355 numNodes = ilength*klength; in GetNumberOfCells()
[all …]
/dports/math/vtk8/VTK-8.2.0/Common/ExecutionModel/
H A DvtkExtentRCBPartitioner.cxx193 int numNodes = 0; in SplitExtent() local
287 int numNodes = 0; in GetNumberOfNodes() local
302 numNodes = ilength*jlength; in GetNumberOfNodes()
307 numNodes = jlength*klength; in GetNumberOfNodes()
312 numNodes = ilength*klength; in GetNumberOfNodes()
324 return( numNodes ); in GetNumberOfNodes()
330 int numNodes = 0; in GetNumberOfCells() local
345 numNodes = ilength*jlength; in GetNumberOfCells()
350 numNodes = jlength*klength; in GetNumberOfCells()
355 numNodes = ilength*klength; in GetNumberOfCells()
[all …]
/dports/math/vtk9/VTK-9.1.0/Common/ExecutionModel/
H A DvtkExtentRCBPartitioner.cxx187 int numNodes = 0; in SplitExtent() local
279 int numNodes = 0; in GetNumberOfNodes() local
294 numNodes = ilength * jlength; in GetNumberOfNodes()
299 numNodes = jlength * klength; in GetNumberOfNodes()
304 numNodes = ilength * klength; in GetNumberOfNodes()
315 return (numNodes); in GetNumberOfNodes()
321 int numNodes = 0; in GetNumberOfCells() local
336 numNodes = ilength * jlength; in GetNumberOfCells()
341 numNodes = jlength * klength; in GetNumberOfCells()
346 numNodes = ilength * klength; in GetNumberOfCells()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/Plugin/
H A DIntegrate.cpp81 int numNodes = data1->getNumNodes(step, ent, ele); in execute() local
85 for(int nod = 0; nod < numNodes; nod++) { in execute()
91 if(numNodes == 1) { in execute()
141 data2->incrementList(numComp, type, numNodes); in execute()
142 std::vector<double> x(numNodes), y(numNodes), z(numNodes); in execute()
143 for(int nod = 0; nod < numNodes; nod++) in execute()
153 for(int nod = 0; nod < numNodes; nod++) { in execute()
159 std::vector<double> timeIntegral(numNodes, 0.); in execute()
162 for(int nod = 0; nod < numNodes; nod++) { in execute()
164 (val[step * numNodes + nod] + val[(step + 1) * numNodes + nod]) * dt; in execute()
[all …]
H A DExtractElements.cpp78 int numNodes = data1->getNumNodes(step, ent, ele); in execute() local
81 for(int nod = 0; nod < numNodes; nod++) { in execute()
86 d /= (double)numNodes; in execute()
94 std::vector<double> *out = data2->incrementList(numComp, type, numNodes); in execute()
95 std::vector<double> x(numNodes), y(numNodes), z(numNodes); in execute()
96 std::vector<double> v(numNodes * numComp); in execute()
97 for(int nod = 0; nod < numNodes; nod++) in execute()
99 for(int nod = 0; nod < numNodes; nod++) out->push_back(x[nod]); in execute()
100 for(int nod = 0; nod < numNodes; nod++) out->push_back(y[nod]); in execute()
101 for(int nod = 0; nod < numNodes; nod++) out->push_back(z[nod]); in execute()
[all …]
H A DHarmonicToTime.cpp86 int numNodes = data1->getNumNodes(0, ent, ele); in execute() local
89 std::vector<double> *out = data2->incrementList(numComp, type, numNodes); in execute()
90 std::vector<double> x(numNodes), y(numNodes), z(numNodes); in execute()
91 std::vector<double> vr(numNodes * numComp), vi(numNodes * numComp); in execute()
92 for(int nod = 0; nod < numNodes; nod++) { in execute()
101 for(int nod = 0; nod < numNodes; nod++) out->push_back(x[nod]); in execute()
102 for(int nod = 0; nod < numNodes; nod++) out->push_back(y[nod]); in execute()
103 for(int nod = 0; nod < numNodes; nod++) out->push_back(z[nod]); in execute()
107 for(int nod = 0; nod < numNodes; nod++) { in execute()
H A DCurl.cpp58 int numNodes = data1->getNumNodes(firstNonEmptyStep, ent, ele); in execute() local
59 std::vector<double> *out = data2->incrementList(3, type, numNodes); in execute()
62 for(int nod = 0; nod < numNodes; nod++) in execute()
67 element *element = factory.create(numNodes, dim, x, y, z); in execute()
69 for(int nod = 0; nod < numNodes; nod++) out->push_back(x[nod]); in execute()
70 for(int nod = 0; nod < numNodes; nod++) out->push_back(y[nod]); in execute()
71 for(int nod = 0; nod < numNodes; nod++) out->push_back(z[nod]); in execute()
74 for(int nod = 0; nod < numNodes; nod++) in execute()
78 for(int nod = 0; nod < numNodes; nod++) { in execute()
H A DDivergence.cpp62 int numNodes = data1->getNumNodes(firstNonEmptyStep, ent, ele); in execute() local
63 std::vector<double> *out = data2->incrementList(1, type, numNodes); in execute()
66 for(int nod = 0; nod < numNodes; nod++) in execute()
71 element *element = factory.create(numNodes, dim, x, y, z); in execute()
73 for(int nod = 0; nod < numNodes; nod++) out->push_back(x[nod]); in execute()
74 for(int nod = 0; nod < numNodes; nod++) out->push_back(y[nod]); in execute()
75 for(int nod = 0; nod < numNodes; nod++) out->push_back(z[nod]); in execute()
78 for(int nod = 0; nod < numNodes; nod++) in execute()
82 for(int nod = 0; nod < numNodes; nod++) { in execute()
H A DGradient.cpp58 int numNodes = data1->getNumNodes(firstNonEmptyStep, ent, ele); in execute() local
60 data2->incrementList((numComp == 1) ? 3 : 9, type, numNodes); in execute()
63 for(int nod = 0; nod < numNodes; nod++) in execute()
68 element *element = factory.create(numNodes, dim, x, y, z); in execute()
70 for(int nod = 0; nod < numNodes; nod++) out->push_back(x[nod]); in execute()
71 for(int nod = 0; nod < numNodes; nod++) out->push_back(y[nod]); in execute()
72 for(int nod = 0; nod < numNodes; nod++) out->push_back(z[nod]); in execute()
75 for(int nod = 0; nod < numNodes; nod++) in execute()
79 for(int nod = 0; nod < numNodes; nod++) { in execute()
H A DSummation.cpp120 int numNodes = pviewsdata[iref]->getNumNodes(stepref, ent, ele); in execute() local
124 std::vector<double> *out = data2->incrementList(numComp2, type, numNodes); in execute()
126 std::vector<double> x(numNodes), y(numNodes), z(numNodes); in execute()
127 for(int nod = 0; nod < numNodes; nod++) in execute()
130 for(int nod = 0; nod < numNodes; nod++) out->push_back(x[nod]); in execute()
131 for(int nod = 0; nod < numNodes; nod++) out->push_back(y[nod]); in execute()
132 for(int nod = 0; nod < numNodes; nod++) out->push_back(z[nod]); in execute()
134 for(int nod = 0; nod < numNodes; nod++) { in execute()
/dports/math/dune-spgrid/dune-spgrid-3977013bee93d1b113b155cc5b881d28d3ee37f5/dune/grid/spgrid/
H A Dtopology.hh55 unsigned int numNodes () const { return data_[ 0 ]; } in numNodes() function in Dune::SPTopology
111 const unsigned int numNodes = 1; in SPTopology() local
112 data_ = new unsigned int[ 2 + numFaces*numNodes ]; in SPTopology()
113 data_[ 0 ] = numNodes; in SPTopology()
156 return (neighbor( node, face ) < numNodes()); in hasNeighbor()
163 assert( node < numNodes() ); in neighbor()
172 assert( numNodes() == 1 ); in periodic()
192 assert( node < numNodes() ); in nb()
209 const unsigned int numNodes = topology().numNodes(); in operator <<() local
210 out << numNodes; in operator <<()
[all …]
/dports/science/axom/axom-0.6.1/src/axom/mint/tests/
H A Dmint_mesh_coordinates.cpp140 EXPECT_EQ(0, coords.numNodes()); in check_constructor()
158 IndexType numNodes, in check_constructor() argument
177 EXPECT_EQ(numNodes, coords->numNodes()); in check_constructor()
180 if(numNodes == ZERO_NUM_NODES) in check_constructor()
230 IndexType n_nodes = mesh_coords->numNodes(); in check_append()
623 const int nnodes = mc->numNodes(); in check_set_and_get()
770 const int n_nodes = mesh_coords->numNodes(); in deleteAndDuplicateExternal()
970 IndexType numNodes1 = mc1.numNodes(); in TEST()
974 EXPECT_EQ(mc1.numNodes(), numNodes1); in TEST()
985 IndexType numNodes2 = mc2.numNodes(); in TEST()
[all …]
/dports/games/qudos/QuDos-0.40.1-src/src/mods/zaero/
H A Dz_list.c18 list->numNodes = 0; in initializeList()
39 return list->numNodes; in listLength()
52 list->numNodes++; in addHead()
54 if (list->numNodes == 1) in addHead()
74 list->numNodes++; in addTail()
76 if (list->numNodes == 1) in addTail()
98 diffT = list->numNodes - num - 1; in getItem()
110 indexNum = list->numNodes - 1; in getItem()
167 list->numNodes--; in removeItem()
181 for (i = 0; i < src->numNodes; i++) in copyList()
[all …]
/dports/www/proxygen/proxygen-2021.12.27.00/proxygen/lib/utils/test/
H A DRendezvousHashTest.cpp41 int numNodes = 10; in TEST() local
43 for (int i = 0; i < numNodes; ++i) { in TEST()
64 int numNodes = 10; in TEST() local
66 for (int i = 0; i < numNodes; ++i) { in TEST()
79 for (int i = 0; i < numNodes; ++i) { in TEST()
92 int numNodes = 10; in TEST() local
94 for (int i = 0; i < numNodes; ++i) { in TEST()
110 for (int i = 1; i < numNodes; ++i) { in TEST()
123 int numNodes = 18; in TEST() local
157 int numNodes = 10; in TEST() local
[all …]
/dports/math/gismo/gismo-21.12.0/src/gsAssembler/
H A DgsQuadrature.h51 const gsVector<index_t> nnodes = numNodes(basis,quA,quB,fixDir);
73 return gsGaussRule<T>::make(numNodes(basis,quA,quB,fixDir));
75 return gsLobattoRule<T>::make(numNodes(basis,quA,quB,fixDir));
89 const gsVector<index_t> nnodesI = numNodes(basis,quA,quB,fixDir);
90 const gsVector<index_t> nnodesB = numNodes(basis,quAb,quBb,fixDir);
123 return gsGaussRule<T>(numNodes, digits);
125 return gsLobattoRule<T>(numNodes, digits);
133 static inline gsQuadRule<T> getUnivariate(index_t qu, index_t numNodes, unsigned digits = 0)
138 return gsGaussRule<T>(numNodes, digits);
140 return gsLobattoRule<T>(numNodes, digits);
[all …]
H A DgsLobattoRule.h36 gsLobattoRule(gsVector<index_t> const & numNodes,
39 gsLobattoRule::setNodes(numNodes, digits);
43 static uPtr make(gsVector<index_t> const & numNodes,
45 { return uPtr( new gsLobattoRule(numNodes,digits) ); }
48 gsLobattoRule(index_t numNodes, const unsigned digits = 0 )
50 this->setNodes(numNodes, digits);
57 void setNodes( gsVector<index_t> const & numNodes,
H A DgsGaussRule.h37 gsGaussRule(gsVector<index_t> const & numNodes,
40 gsGaussRule::setNodes(numNodes, digits);
44 static uPtr make(gsVector<index_t> const & numNodes,
46 { return uPtr( new gsGaussRule(numNodes,digits) ); }
49 gsGaussRule(index_t numNodes, const unsigned digits = 0 )
51 this->setNodes(numNodes, digits);
69 void setNodes( gsVector<index_t> const & numNodes,
/dports/science/axom/axom-0.6.1/src/axom/mint/mesh/
H A DMeshCoordinates.hpp167 MeshCoordinates(IndexType numNodes,
173 MeshCoordinates(IndexType numNodes,
229 IndexType numNodes = 0,
644 IndexType idx = numNodes(); in append()
647 SLIC_ASSERT(idx == numNodes() - 1); in append()
661 IndexType idx = numNodes(); in append()
665 SLIC_ASSERT(idx == numNodes() - 1); in append()
680 IndexType idx = numNodes(); in append()
685 SLIC_ASSERT(idx == numNodes() - 1); in append()
705 IndexType original_size = numNodes(); in append()
[all …]
H A DMeshCoordinates.cpp27 IndexType numNodes, in MeshCoordinates() argument
43 static_cast<IndexType>(numNodes * ratio + 0.5)); in MeshCoordinates()
50 SLIC_ERROR_IF(numNodes > max_capacity, "numNodes > capacity!"); in MeshCoordinates()
51 this->initialize(numNodes, max_capacity); in MeshCoordinates()
55 MeshCoordinates::MeshCoordinates(IndexType numNodes, in MeshCoordinates() argument
82 new axom::deprecated::MCArray<double>(ptrs[i], numNodes, 1, capacity); in MeshCoordinates()
89 MeshCoordinates::MeshCoordinates(IndexType numNodes, double* x, double* y, double* z) in MeshCoordinates() argument
90 : MeshCoordinates(numNodes, numNodes, x, y, z) in MeshCoordinates()
147 IndexType numNodes, in MeshCoordinates() argument
153 SLIC_ERROR_IF((capacity != USE_DEFAULT) && (numNodes > capacity), in MeshCoordinates()
[all …]
/dports/graphics/dilay/dilay-1.9.0/test/src/
H A Dtest-tree.cpp32 assert (tree.root ().numNodes () == 3); in test1()
36 assert (tree.root ().numNodes () == 1); in test1()
41 assert (tree.root ().numNodes () == 4); in test1()
45 assert (tree.root ().numNodes () == 2); in test1()
52 assert (copy.root ().numNodes () == 2); in test1()
65 assert (t.root ().numNodes () == 4); in test2()
73 assert (t.root ().numNodes () == 4); in test2()
89 assert (t1.root ().numNodes () == 2); in test3()
93 assert (t2.root ().numNodes () == 2); in test3()
101 assert (t3.root ().numNodes () == 2); in test3()
/dports/cad/gmsh/gmsh-4.9.2-source/Post/
H A DPViewVertexArrays.cpp141 for(int i = 0; i < numNodes; i++) in getExternalValues()
156 for(int i = 0; i < numNodes; i++) in getExternalValues()
661 verts.reserve(numNodes); in addScalarPolygon()
884 verts.reserve(numNodes); in addOutlinePolyhedron()
1072 pc /= (double)numNodes; in addVectorElement()
1073 v2 /= (double)numNodes; in addVectorElement()
1244 double **vval[3] = {new double *[numNodes], new double *[numNodes], in addTensorElement()
1309 if(numNodes > PVIEW_NMAX) { in addElementsInArrays()
1311 if(numNodes > NMAX) { in addElementsInArrays()
1318 NMAX = numNodes; in addElementsInArrays()
[all …]
/dports/security/liboqs/liboqs-0.7.0/src/sig/picnic/external/
H A Dpicnic3_tree.c38 if (i >= tree->numNodes) {
51 tree->numNodes =
58 uint8_t* slab = calloc(tree->numNodes, dataSize);
60 for (size_t i = 0; i < tree->numNodes; i++) {
65 tree->haveNode = calloc(tree->numNodes, 1);
68 tree->exists = calloc(tree->numNodes, 1);
244 return (2 * node + 1 >= tree->numNodes);
260 assert(node < tree->numNodes);
265 if (node + 1 < tree->numNodes) {
457 for (int i = (int)tree->numNodes; i > 0; i--) {
[all …]
/dports/math/dune-polygongrid/dune-polygongrid-f76933aa51aa3ae3e58a5705f9f7ce7d1f6c012c/dune/polygongrid/
H A Dgridfactory.hh46 const std::size_t numNodes = nodes.size(); in insertElement() local
48 std::vector< std::size_t > polygon( numNodes ); in insertElement()
49 for( std::size_t i = 0; i < numNodes; ++i ) in insertElement()
56 if( type.isSimplex() && (numNodes != 3u) ) in insertElement()
57 DUNE_THROW( GridError, "Wrong number of triangle vertices: " << numNodes << "." ); in insertElement()
60 if( numNodes != 4u ) in insertElement()
61 DUNE_THROW( GridError, "Wrong number of quadrilateral vertices: " << numNodes << "." ); in insertElement()

12345678910>>...63