Home
last modified time | relevance | path

Searched refs:vertice (Results 1 – 25 of 204) sorted by relevance

123456789

/dports/net/norm/norm-1.5r6/protolib/src/common/
H A DprotoGraph.cpp30 vertice.Reference(queueState); in Associate()
38 vertice.Dereference(queueState); in Disassociate()
127 if (NULL != vertice) in Cleanup()
187 Associate(vertice, *item); in Prepend()
200 Associate(vertice, *item); in Append()
212 Disassociate(vertice, *item); in Remove()
226 ASSERT(NULL != vertice); in RemoveHead()
233 return vertice; in RemoveHead()
356 Associate(vertice, *item); in Insert()
369 Associate(vertice, *item); in Append()
[all …]
/dports/games/xray_re-tools/xray_re-tools-52721d2/perl_scripts/stkutils/
H A Dogf.pm542 my $vertice = {};
551 my $vertice = {};
561 my $vertice = {};
573 my $vertice = {};
574 ($vertice->{matrix0}, $vertice->{matrix1}) = $packet->unpack('vv');
586 my $vertice = {};
587 ($vertice->{matrix0}, $vertice->{matrix1}, $vertice->{matrix2}) = $packet->unpack('vvv');
592 ($vertice->{w0}, $vertice->{w1}) = $packet->unpack('ff');
599 my $vertice = {};
600 …($vertice->{matrix0}, $vertice->{matrix1}, $vertice->{matrix2}, $vertice->{matrix3}) = $packet->un…
[all …]
/dports/net/norm/norm-1.5r6/protolib/include/
H A DprotoGraph.h39 bool InsertVertice(Vertice& vertice);
46 bool IsInGraph(const Vertice& vertice) const in IsInGraph() argument
47 {return (vertice.IsInQueue(vertice_list));} in IsInGraph()
71 AdjacencyIterator(Vertice& vertice);
121 bool Contains(const Vertice& vertice) in Contains() argument
147 {return vertice;} in GetVertice()
161 vertice = &theVertice; in Associate()
166 vertice = NULL; in Disassociate()
201 Vertice* vertice;
239 ASSERT(NULL != vertice); in TransferQueueState()
[all …]
/dports/games/lugaru/lugaru-c7b99378439735c60f84869b05c6ebde53083667/Source/Animation/
H A DMuscle.cpp57 int numvertices, vertice, parentID; in load() local
64 funpackf(tfile, "Bi", &vertice); in load()
65 if (vertice < vertexNum) { in load()
66 vertices.push_back(vertice); in load()
79 int numvertices, vertice; in loadVerticesLow() local
86 funpackf(tfile, "Bi", &vertice); in loadVerticesLow()
87 if (vertice < vertexNum) { in loadVerticesLow()
88 verticeslow.push_back(vertice); in loadVerticesLow()
95 int numvertices, vertice; in loadVerticesClothes() local
102 funpackf(tfile, "Bi", &vertice); in loadVerticesClothes()
[all …]
/dports/graphics/blender/blender-2.91.0/release/scripts/addons/mesh_tools/
H A Drandom_vertices.py44 for vertice in odata.verts[:]:
45 if vertice.select:
46 listver.append(vertice.index)
62 for vertice in listver:
64 if odata.verts[vertice].select:
66 has_group = getattr(objact.data.vertices[vertice], "groups", None)
75 odata.verts[vertice].co = (
77 odata.verts[vertice].co[0],
79 odata.verts[vertice].co[1],
81 odata.verts[vertice].co[2]
/dports/devel/pylint/pylint-2.12.1/pylint/
H A Dgraph.py184 for vertice in vertices:
185 _get_cycles(graph_dict, [], set(), result, vertice)
189 def _get_cycles(graph_dict, path, visited, result, vertice): argument
191 if vertice in path:
192 cycle = [vertice]
194 if node == vertice:
205 path.append(vertice)
207 for node in graph_dict[vertice]:
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/logilab/logilab/common/
H A Dgraph.py234 for vertice in vertices:
235 _get_cycles(graph_dict, [], set(), result, vertice)
238 def _get_cycles(graph_dict, path, visited, result, vertice): argument
240 if vertice in path:
241 cycle = [vertice]
243 if node == vertice:
254 path.append(vertice)
256 for node in graph_dict[vertice]:
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bgrl/
H A Dbgrl_graph.cxx26 for (const auto & vertice : graph.vertices_) in bgrl_graph() local
28 bgrl_vertex_sptr vertex_copy(vertice->clone()); in bgrl_graph()
29 old_to_new[vertice] = vertex_copy; in bgrl_graph()
34 for (const auto & vertice : vertices_) in bgrl_graph() local
36 for ( auto e_itr = vertice->out_edges_.begin(); in bgrl_graph()
37 e_itr != vertice->out_edges_.end(); ++e_itr ) in bgrl_graph()
/dports/cad/opencascade/opencascade-7.6.0/tests/vselect/bugs/
H A Dbug2614724 puts "ERROR: Wrong number of entities in vertice-edge selection without overlap allowed!"
31 puts "ERROR: Wrong number of entities in vertice-edge selection with overlap allowed!"
43 …puts "ERROR: Wrong number of entities in vertice-edge-face shift selection without overlap allowed…
53 puts "ERROR: Wrong number of entities in vertice-edge-face shift selection with overlap allowed!"
/dports/devel/py-logilab-common/logilab-common-1.8.2/logilab/common/
H A Dgraph.py283 for vertice in vertices:
284 _get_cycles(graph_dict, [], set(), result, vertice)
290 graph_dict: _Graph, path: List, visited: Set, result: List[List], vertice: V
293 if vertice in path:
294 cycle = [vertice]
297 if node == vertice:
315 path.append(vertice)
318 for node in graph_dict[vertice]:
/dports/science/py-pycsw/pycsw-2.6.1/pycsw/ogc/gml/
H A Dgml3.py226 for vertice in list(geom.coords):
228 vertice[0], vertice[1])
236 for vertice in list(geom.exterior.coords):
238 vertice[0], vertice[1])
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/tst/standard/
H A Disomorph.tst192 Error, the 2nd argument <partition> does not define a colouring of the vertice\
199 Error, the 2nd argument <partition> does not define a colouring of the vertice\
213 Error, the 2nd argument <partition> does not define a colouring of the vertice\
301 Error, the 2nd argument <partition> does not define a colouring of the vertice\
308 Error, the 2nd argument <partition> does not define a colouring of the vertice\
405 Error, the 2nd argument <partition> does not define a colouring of the vertice\
409 Error, the 2nd argument <partition> does not define a colouring of the vertice\
413 Error, the 2nd argument <partition> does not define a colouring of the vertice\
420 Error, the 2nd argument <partition> does not define a colouring of the vertice\
456 Error, the 2nd argument <partition> does not define a colouring of the vertice\
[all …]
/dports/x11-toolkits/ctk/CTK-2018-10-29/Libs/Core/
H A DctkDependencyGraph.cpp67 void setEdge(int vertice, int degree, int value);
68 int edge(int vertice, int degree)const;
272 void ctkDependencyGraphPrivate::setEdge(int vertice, int degree, int value) in setEdge() argument
274 assert(vertice <= this->NVertices); in setEdge()
276 (*this->Edges[vertice])[degree] = value; in setEdge()
280 int ctkDependencyGraphPrivate::edge(int vertice, int degree)const in edge() argument
282 assert(vertice <= this->NVertices); in edge()
284 return (*this->Edges[vertice])[degree]; in edge()
/dports/games/widelands/widelands-build21/src/graphic/gl/
H A Ddraw_line_program.cc60 for (auto& vertice : current_args.vertices) { in draw() local
61 vertice.gl_z = current_args.z_value; in draw()
/dports/astro/stellarium/stellarium-0.21.3/src/core/
H A DStelSphericalIndex.hpp161 static const Vec3d vertice[6] = in split() local
175 …node.triangle = SphericalConvexPolygon(vertice[verticeIndice[i][0]], vertice[verticeIndice[i][1]],… in split()
/dports/misc/vxl/vxl-3.3.2/contrib/gel/vtol/
H A Dvtol_topology_cache.cxx87 for (auto & vertice : *vertices_){ in vertices()
88 verts.push_back(vertice); in vertices()
/dports/multimedia/assimp/assimp-5.1.3/test/unit/
H A DutObjImportExport.cpp345 const aiVector3D vertice = mesh->mVertices[0]; in TEST_F() local
346 EXPECT_EQ(vertice.x, -1.0f); in TEST_F()
347 EXPECT_EQ(vertice.y, 0.0f); in TEST_F()
348 EXPECT_EQ(vertice.z, 0.8f); in TEST_F()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bmsh3d/
H A Dbmsh3d_face.cxx295 for (auto vertice : vertices) in all_Vs_incident() local
296 VSet.insert (vertice); in all_Vs_incident()
339 for (auto vertice : vertices_) in _get_ordered_Vs_IFS() local
340 vertices.push_back (vertice); in _get_ordered_Vs_IFS()
370 for (auto vertice : vertices_) in _get_ordered_V_ids_IFS() local
371 vids.push_back (vertice->id()); in _get_ordered_V_ids_IFS()
1170 for (auto vertice : vertices) { in compute_cen() local
1171 x += vertice->pt().x(); in compute_cen()
1172 y += vertice->pt().y(); in compute_cen()
1173 z += vertice->pt().z(); in compute_cen()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bpro/core/vpgl_pro/processes/
H A Dbpgl_transform_perspective_cameras_process.cxx337 for (auto & vertice : vertices) { in vpgl_transform_box_process() local
339 pt[0][0] = vertice.x(); pt[1][0] = vertice.y(); pt[2][0] = vertice.z(); pt[3][0] = 1.0; in vpgl_transform_box_process()
/dports/math/freefem++/FreeFem-sources-4.6/src/femlib/
H A DGenericMesh.hpp1242 bmin.x = vertice[0].x; in SameVertex()
1243 bmin.y = vertice[0].y; in SameVertex()
1244 bmin.z = vertice[0].z; in SameVertex()
1252 bmin.x = min(bmin.x, vertice[i].x); in SameVertex()
1253 bmin.y = min(bmin.y, vertice[i].y); in SameVertex()
1254 bmin.z = min(bmin.z, vertice[i].z); in SameVertex()
1256 bmax.x = max(bmax.x, vertice[i].x); in SameVertex()
1257 bmax.y = max(bmax.y, vertice[i].y); in SameVertex()
1258 bmax.z = max(bmax.z, vertice[i].z); in SameVertex()
1288 longedge = Rd(vertice[i1],vertice[i2]).norme(); in SameVertex()
[all …]
/dports/games/warzone2100/warzone2100/tools/blender/2.9x/pie_addon/
H A Dpie_export.py132 for vertice in bm.verts:
135 for num in vertice.co:
338 for vertice in shadowBm.verts:
341 for num in vertice.co:
/dports/graphics/qgis/qgis-3.22.3/src/3d/
H A Dqgs3dexportobject.cpp89 for ( const unsigned int vertice : mIndexes ) in objectBounds() local
91 const int heightIndex = ( vertice - 1 ) * 3 + 1; in objectBounds()
/dports/graphics/qgis-ltr/qgis-3.16.16/src/3d/
H A Dqgs3dexportobject.cpp90 for ( unsigned int vertice : mIndexes ) in objectBounds() local
92 int heightIndex = ( vertice - 1 ) * 3 + 1; in objectBounds()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/apps/modeler/src/
H A Dcloud_mesh.cpp120 for (index_t& vertice : polygon.vertices) in save()
121 vertice += delta; in save()
/dports/math/freefem++/FreeFem-sources-4.6/examples/3dSurf/
H A DoperatorsOnMeshS.edp8 // read the imput mesh, vertice/tetra/triangle/edge

123456789