Home
last modified time | relevance | path

Searched refs:vcount (Results 76 – 100 of 1085) sorted by relevance

12345678910>>...44

/dports/math/igraph/igraph-0.9.5/src/community/
H A Dlouvain.c340 long int vcount = igraph_vcount(graph); in igraph_i_community_multilevel_step() local
379 communities.vertices_no = vcount; in igraph_i_community_multilevel_step()
380 communities.communities_no = vcount; in igraph_i_community_multilevel_step()
391 for (i = 0; i < vcount; i++) { in igraph_i_community_multilevel_step()
424 for (i = 0; i < vcount; i++) { in igraph_i_community_multilevel_step()
617 long int vcount = igraph_vcount(graph); in igraph_community_multilevel() local
631 IGRAPH_VECTOR_INIT_FINALLY(&m, vcount); in igraph_community_multilevel()
636 for (i = 0; i < vcount; i++) { in igraph_community_multilevel()
662 for (i = 0; i < vcount; i++) { in igraph_community_multilevel()
694 for (i = 0; i < vcount; i++) { in igraph_community_multilevel()
[all …]
/dports/emulators/mgba/mgba-0.9.2/src/gba/
H A Dvideo.c69 video->vcount = 0; in GBAVideoReset()
72 video->vcount = 0x7E; in GBAVideoReset()
75 video->p->memory.io[REG_VCOUNT >> 1] = video->vcount; in GBAVideoReset()
155 ++video->vcount; in _startHdraw()
156 if (video->vcount == VIDEO_VERTICAL_TOTAL_PIXELS) { in _startHdraw()
157 video->vcount = 0; in _startHdraw()
161 if (video->vcount < GBA_VIDEO_VERTICAL_PIXELS) { in _startHdraw()
177 switch (video->vcount) { in _startHdraw()
217 if (video->vcount < GBA_VIDEO_VERTICAL_PIXELS) { in _startHblank()
220 if (video->vcount >= 2 && video->vcount < GBA_VIDEO_VERTICAL_PIXELS + 2) { in _startHblank()
[all …]
/dports/java/java3d/java3d-1.5.2/j3d-core/src/native/d3d/
H A DD3dDisplayList.cpp96 vcounts = (*q)->vcount; in optimize()
115 ((*p)->totalVertexCount == (*p)->vcount)) { in optimize()
157 DWORD vcount, in createMergedVB() argument
172 vb->vcount = vb->totalVertexCount = vcount; in createMergedVB()
177 hr = device->CreateVertexBuffer(vb->stride*vcount, in createMergedVB()
184 hr = device->CreateVertexBuffer(vb->stride*vcount, in createMergedVB()
252 vb->numVertices[0] = vcount; in createMergedVB()
288 len = (*r)->vcount*(*r)->stride; in createMergedVB()
315 offset += (*r)->vcount; in createMergedVB()
334 createQuadIndices(d3dCtx, vcount); in createMergedVB()
[all …]
H A DGeometryArrayRetained.cpp1103 if ((vb != NULL) && (vb->vcount < vcount)) { in allocateVB()
1122 vb->vcount = vcount; in allocateVB()
1475 vc = (vcount >= max ? max : vcount); in splitVertexToMultipleVB()
2085 vb->vcount = (vcount >= maxVertexLimit ? maxVertexLimit : vcount); in renderGeometry()
2217 if (vcount <= vb->vcount) { in renderGeometry()
2572 if (vcount <= vb->vcount) { in renderGeometry()
2731 vb->vcount = (vcount >= maxVertexLimit ? maxVertexLimit : vcount); in renderIndexGeometry()
2903 (vcount <= vb->vcount)) { in renderIndexGeometry()
3136 if (vcount <= vb->vcount) { in renderIndexGeometry()
4434 vcount, in Java_javax_media_j3d_NativePipeline_executeIndexedGeometry()
[all …]
/dports/math/R-cran-igraph/igraph/R/
H A Dcommunity.R798 mode(vcount) <- "numeric"
957 res$vcount <- vcount(graph)
1087 res$vcount <- vcount(graph)
1204 res$vcount <- vcount(graph)
1315 res$vcount <- vcount(graph)
1389 res$vcount <- vcount(graph)
1523 res$vcount <- vcount(graph)
1606 res$vcount <- vcount(graph)
1686 res$vcount <- vcount(graph)
1773 res$vcount <- vcount(graph)
[all …]
/dports/graphics/freetype-gl/freetype-gl-647b062/
H A Dvertex-buffer.c425 size_t count = item->vcount; in vertex_buffer_render_item()
435 size_t vcount = self->vertices->size; in vertex_buffer_render() local
445 glDrawArrays( mode, 0, vcount ); in vertex_buffer_render()
470 const size_t vcount ) in vertex_buffer_push_back_vertices() argument
475 vector_push_back_data( self->vertices, vertices, vcount ); in vertex_buffer_push_back_vertices()
502 const size_t vcount ) in vertex_buffer_insert_vertices() argument
593 vertex_buffer_push_back_vertices( self, vertices, vcount ); in vertex_buffer_insert()
607 item.y = vcount; in vertex_buffer_insert()
623 size_t vcount, istart, icount, i; in vertex_buffer_erase() local
630 vcount = item->vcount; in vertex_buffer_erase()
[all …]
/dports/graphics/freetype-gl/freetype-gl-647b062/harfbuzz/
H A Dvertex-buffer.c425 size_t count = item->vcount; in vertex_buffer_render_item()
435 size_t vcount = self->vertices->size; in vertex_buffer_render() local
445 glDrawArrays( mode, 0, vcount ); in vertex_buffer_render()
470 const size_t vcount ) in vertex_buffer_push_back_vertices() argument
475 vector_push_back_data( self->vertices, vertices, vcount ); in vertex_buffer_push_back_vertices()
502 const size_t vcount ) in vertex_buffer_insert_vertices() argument
593 vertex_buffer_push_back_vertices( self, vertices, vcount ); in vertex_buffer_insert()
607 item.y = vcount; in vertex_buffer_insert()
623 size_t vcount, istart, icount, i; in vertex_buffer_erase() local
630 vcount = item->vcount; in vertex_buffer_erase()
[all …]
/dports/net/mpich/mpich-3.4.3/test/mpi/rma/
H A Dselfrma.c23 int *sbuf, scount, vcount; in main() local
47 vcount = count / 4; in main()
48 MPI_Type_vector(vcount, 1, 2, MPI_INT, &vectype); in main()
62 for (i = 0; i < vcount; i++) { in main()
76 for (i = 0; i < vcount; i++) { in main()
91 for (i = 0; i < vcount; i++) { in main()
/dports/net/mpich2/mpich2-1.5/test/mpi/rma/
H A Dselfrma.c24 int *sbuf, scount, vcount; in main() local
48 vcount = count / 4; in main()
49 MPI_Type_vector( vcount, 1, 2, MPI_INT, &vectype ); in main()
64 for (i=0; i<vcount; i++) { in main()
79 for (i=0; i<vcount; i++) { in main()
95 for (i=0; i<vcount; i++) { in main()
/dports/devel/love08/love-0.8.0/src/modules/physics/box2d/
H A DPhysics.cpp99 int vcount = argc / 2; in newPolygonShape() local
100 if (vcount < 3) in newPolygonShape()
102 else if (vcount > b2_maxPolygonVertices) in newPolygonShape()
111 for (int i = 0; i < vcount; i++) in newPolygonShape()
125 else if (i == vcount - 1) in newPolygonShape()
153 s->Set(vecs, vcount); in newPolygonShape()
163 int vcount = (int)argc/2; in newChainShape() local
169 b2Vec2 * vecs = new b2Vec2[vcount]; in newChainShape()
171 for (int i = 0;i<vcount;i++) in newChainShape()
181 s->CreateLoop(vecs, vcount); in newChainShape()
[all …]
/dports/math/R-cran-igraph/igraph/tests/testthat/
H A Dtest_get.adjlist.R12 expect_true(graph.isomorphic.vf2(g, g2, vertex.color1=1:vcount(g),
13 vertex.color2=1:vcount(g2))$iso)
18 for (i in 1:vcount(g)) {
27 for (i in 1:vcount(g)) {
32 for (i in 1:vcount(g)) {
H A Dtest_graph.density.R10 gd2 <- ecount(g) / vcount(g) / (vcount(g)-1) * 2
17 gd2 <- ecount(g) / vcount(g) / (vcount(g)-1)
H A Dtest_adjacency.spectral.embedding.R57 expect_that(as_sa$D, equals(ss$values[vcount(g)-1:no+1]))
58 expect_that(au_sa$D, equals(ss$values[vcount(g)-1:no+1]))
59 expect_that(std(as_sa$X), equals(std(U[,vcount(g)-1:no+1])))
60 expect_that(std(au_sa$X), equals(X[,vcount(g)-1:no+1]))
103 expect_that(std(au_sa$X), equals(X[,vcount(g)-1:no+1]))
150 expect_that(as_sa$D, equals(ss$d[vcount(g)-1:no+1]))
151 expect_that(au_sa$D, equals(ss$d[vcount(g)-1:no+1]))
154 expect_that(std(au_sa$X), equals(X[,vcount(g)-1:no+1]))
155 expect_that(std(au_sa$Y), equals(Y[,vcount(g)-1:no+1]))
201 expect_that(std(au_sa$X), equals(X[,vcount(g)-1:no+1]))
[all …]
H A Dtest_bipartite.random.game.R11 expect_that(vcount(g1), equals(15))
17 expect_that(vcount(g2), equals(15))
27 expect_that(vcount(g4), equals(15))
33 expect_that(vcount(g5), equals(15))
40 expect_that(vcount(g6), equals(15))
/dports/graphics/glx-utils/demos-5435fc7fbd332e171da9a71e33a9b190e9462cf0/src/egl/opengles1/
H A Dtorus.c79 int vcount; in draw_torus() local
99 vcount = 0; /* glBegin(GL_QUAD_STRIP); */ in draw_torus()
115 Normal(narray[vcount], cosTheta1 * cosPhi, -sinTheta1 * cosPhi, sinPhi); in draw_torus()
116 Texcoord(tarray[vcount], s1, t); in draw_torus()
118 vcount++; in draw_torus()
120 Normal(narray[vcount], cosTheta * cosPhi, -sinTheta * cosPhi, sinPhi); in draw_torus()
121 Texcoord(tarray[vcount], s0, t); in draw_torus()
122 Vertex(varray[vcount], cosTheta * dist, -sinTheta * dist, r * sinPhi); in draw_torus()
123 vcount++; in draw_torus()
127 assert(vcount <= 100); in draw_torus()
[all …]
/dports/graphics/mesa-demos/mesa-demos-8.4.0/src/egl/opengles1/
H A Dtorus.c79 int vcount; in draw_torus() local
99 vcount = 0; /* glBegin(GL_QUAD_STRIP); */ in draw_torus()
115 Normal(narray[vcount], cosTheta1 * cosPhi, -sinTheta1 * cosPhi, sinPhi); in draw_torus()
116 Texcoord(tarray[vcount], s1, t); in draw_torus()
118 vcount++; in draw_torus()
120 Normal(narray[vcount], cosTheta * cosPhi, -sinTheta * cosPhi, sinPhi); in draw_torus()
121 Texcoord(tarray[vcount], s0, t); in draw_torus()
122 Vertex(varray[vcount], cosTheta * dist, -sinTheta * dist, r * sinPhi); in draw_torus()
123 vcount++; in draw_torus()
127 assert(vcount <= 100); in draw_torus()
[all …]
/dports/cad/libredwg/libredwg-0.12.4/src/
H A Dout_json.c601 for (vcount = 0; vcount < (BITCODE_BL)size; vcount++) \
614 for (vcount = 0; vcount < (BITCODE_BL)size; vcount++) \
630 for (vcount = 0; vcount < _size; vcount++) \
637 for (vcount = 0; vcount < _size; vcount++) \
652 for (vcount = 0; vcount < (BITCODE_BL)_obj->o.size; vcount++) \
695 for (vcount = 0; vcount < (BITCODE_BL)_obj->size; vcount++) \
707 for (vcount = 0; vcount < (BITCODE_BL)_obj->size; vcount++) \
719 for (vcount = 0; vcount < (BITCODE_BL)_obj->size; vcount++) \
731 for (vcount = 0; vcount < (BITCODE_BL)size; vcount++) \
746 for (vcount = 0; vcount < (BITCODE_BL)_obj->o.size; vcount++) \
[all …]
/dports/devel/love/love-11.3/src/modules/physics/box2d/
H A DPhysics.cpp106 int vcount = argc / 2; in newPolygonShape() local
107 if (vcount < 3) in newPolygonShape()
116 for (int i = 0; i < vcount; i++) in newPolygonShape()
128 for (int i = 0; i < vcount; i++) in newPolygonShape()
140 s->Set(vecs, vcount); in newPolygonShape()
166 int vcount = argc/2; in newChainShape() local
168 b2Vec2 *vecs = new b2Vec2[vcount]; in newChainShape()
172 for (int i = 0; i < vcount; i++) in newChainShape()
184 for (int i = 0; i < vcount; i++) in newChainShape()
197 s->CreateLoop(vecs, vcount); in newChainShape()
[all …]
/dports/devel/love10/love-0.10.2/src/modules/physics/box2d/
H A DPhysics.cpp106 int vcount = argc / 2; in newPolygonShape() local
107 if (vcount < 3) in newPolygonShape()
116 for (int i = 0; i < vcount; i++) in newPolygonShape()
128 for (int i = 0; i < vcount; i++) in newPolygonShape()
140 s->Set(vecs, vcount); in newPolygonShape()
166 int vcount = argc/2; in newChainShape() local
168 b2Vec2 *vecs = new b2Vec2[vcount]; in newChainShape()
172 for (int i = 0; i < vcount; i++) in newChainShape()
184 for (int i = 0; i < vcount; i++) in newChainShape()
197 s->CreateLoop(vecs, vcount); in newChainShape()
[all …]
/dports/science/chrono/chrono-7.0.1/src/chrono_thirdparty/HACDv2/
H A DConvexHull.cpp47 hacd::HaU32 vcount = desc.mVcount; in CreateConvexHull() local
48 if ( vcount < 8 ) vcount = 8; in CreateConvexHull()
50 hacd::HaF32 *vsource = (hacd::HaF32 *) HACD_ALLOC( sizeof(hacd::HaF32)*vcount*3 ); in CreateConvexHull()
142 hacd::HaU32 &vcount, // output number of vertices in NormalizeAndCleanupVertices() argument
158 quantizedVertices = wq->wuQuantize3D(svcount,svertices,false,maxVertices,vcount); in NormalizeAndCleanupVertices()
162 quantizedVertices = wq->kmeansQuantize3D(svcount,svertices,false,maxVertices,vcount); in NormalizeAndCleanupVertices()
166 memcpy(vertices,quantizedVertices,sizeof(HaF32)*3*vcount); in NormalizeAndCleanupVertices()
184 hacd::HaU32 *used = (hacd::HaU32 *)HACD_ALLOC(sizeof(hacd::HaU32)*vcount); in BringOutYourDead()
185 memset(used,0,sizeof(hacd::HaU32)*vcount); in BringOutYourDead()
193 HACD_ASSERT( v < vcount ); in BringOutYourDead()
[all …]
/dports/net/mpich2/mpich2-1.5/test/mpi/perf/
H A Dnestvec2.c32 int vcount, vstride; in main() local
50 vcount = 128000; in main()
52 MPI_Type_vector( vcount, 1, vstride, MPI_DOUBLE, &vtype ); in main()
54 vsource = (double *)malloc( (vcount + 1) * (vstride + 1) * sizeof(double) ); in main()
59 for (i=0; i<vcount*vstride; i++) { in main()
140 j = vcount; in main()
152 position += (1 + vcount); in main()
/dports/net/mpich/mpich-3.4.3/test/mpi/perf/
H A Dnestvec2.c34 int vcount, vstride; in main() local
52 vcount = 128000; in main()
54 MPI_Type_vector(vcount, 1, vstride, MPI_DOUBLE, &vtype); in main()
56 vsource = (double *) malloc((vcount + 1) * (vstride + 1) * sizeof(double)); in main()
61 for (i = 0; i < vcount * vstride; i++) { in main()
141 j = vcount; in main()
153 position += (1 + vcount); in main()
/dports/audio/festalon/festalon/src/nes/ext/
H A Dvrc6.c23 int32 vcount[3]; member
84 VRC6Sound->vcount[x]--; in DoSQVHQ()
85 if(VRC6Sound->vcount[x]<=0) /* Should only be <0 in a few circumstances. */ in DoSQVHQ()
87 VRC6Sound->vcount[x]=(VRC6Sound->VPSG[(x<<2)|0x1]|((VRC6Sound->VPSG[(x<<2)|0x2]&15)<<8))+1; in DoSQVHQ()
118 VRC6Sound->vcount[2]--; in DoSawVHQ()
119 if(VRC6Sound->vcount[2]<=0) in DoSawVHQ()
121 VRC6Sound->vcount[2]=(VRC6Sound->VPSG2[1]+((VRC6Sound->VPSG2[2]&15)<<8)+1)<<1; in DoSawVHQ()
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Digraph_simple_interconnected_islands_game.out3 vcount: 0
8 vcount: 4
13 vcount: 4
24 vcount: 8
H A Digraph_cited_type_game.out3 vcount: 0
8 vcount: 3
13 vcount: 5
26 vcount: 7

12345678910>>...44