Home
last modified time | relevance | path

Searched refs:edgeset (Results 1 – 25 of 94) sorted by relevance

1234

/dports/devel/libfirm/libfirm-1.21.0/ir/ir/
H A Diredgeset.h51 void ir_edgeset_init(ir_edgeset_t *edgeset);
59 void ir_edgeset_destroy(ir_edgeset_t *edgeset);
67 ir_edge_t *ir_edgeset_insert(ir_edgeset_t *edgeset, ir_edge_t *edge);
77 void ir_edgeset_remove(ir_edgeset_t *edgeset, const ir_edge_t *edge);
86 int ir_edgeset_contains(const ir_edgeset_t *edgeset, const ir_edge_t *edge);
96 const ir_edgeset_t *edgeset);
115 void ir_edgeset_remove_iterator(ir_edgeset_t *edgeset,
118 #define foreach_ir_edgeset(edgeset, edge, iter) \ argument
119 for(ir_edgeset_iterator_init(&iter, edgeset), \
/dports/databases/grass7/grass-7.8.6/lib/vector/neta/
H A Dcomponents.c92 dglInt32_t *node, *edgeset, *edge; in NetA_weakly_connected_components() local
96 edgeset = dglNodeGet_OutEdgeset(graph, node); in NetA_weakly_connected_components()
97 dglEdgeset_T_Initialize(&et, graph, edgeset); in NetA_weakly_connected_components()
116 edgeset = dglNodeGet_InEdgeset(graph, node); in NetA_weakly_connected_components()
117 dglEdgeset_T_Initialize(&et, graph, edgeset); in NetA_weakly_connected_components()
199 dglInt32_t *node, *edgeset, *edge; in NetA_strongly_connected_components() local
211 edgeset = dglNodeGet_OutEdgeset(graph, node); in NetA_strongly_connected_components()
212 dglEdgeset_T_Initialize(&et, graph, edgeset); in NetA_strongly_connected_components()
250 dglInt32_t *node, *edgeset, *edge; in NetA_strongly_connected_components() local
255 edgeset = dglNodeGet_InEdgeset(graph, node); in NetA_strongly_connected_components()
[all …]
H A Dflow.c229 dglInt32_t *node, *edgeset, *edge; in NetA_min_cut() local
232 edgeset = dglNodeGet_OutEdgeset(graph, node); in NetA_min_cut()
233 dglEdgeset_T_Initialize(&et, graph, edgeset); in NetA_min_cut()
/dports/biology/py-goatools/goatools-1.1.6/goatools/
H A Dobo_parser.py528 edgeset = set()
532 edgeset.update(rec.get_all_parent_edges())
534 edgeset.update(rec.get_all_child_edges())
536 rec_id_set = set([rec_id for endpts in edgeset for rec_id in endpts])
553 for src, target in edgeset:
584 edgeset = set()
587 edgeset.update(rec.get_all_parent_edges())
589 edgeset.update(rec.get_all_child_edges())
591 edgeset = [(self.label_wrap(a), self.label_wrap(b)) for (a, b) in edgeset]
599 for src, target in edgeset:
/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dtreesort.c211 ONEEDGE *edgeset, /* in: intermediate tree topology */
233 &ct_nextleaf, edgeset[edgeofleaf[0]].downleft->numedge,
234 edgeset, edgeofleaf, numleaves, trueID);
238 &ct_nextleaf, edgeset[edgeofleaf[0]].downright->numedge,
239 edgeset, edgeofleaf, numleaves, trueID);
289 ONEEDGE *edgeset, /* in: intermediate tree topology */ in copytree() argument
311 &ct_nextleaf, edgeset[edgeofleaf[rootleaf]].downleft->numedge, in copytree()
312 edgeset, edgeofleaf, numleaves); in copytree()
316 &ct_nextleaf, edgeset[edgeofleaf[rootleaf]].downright->numedge, in copytree()
317 edgeset, edgeofleaf, numleaves); in copytree()
H A Dtreesort.h112 ONEEDGE *edgeset, /* in: intermediate tree topology */
132 ONEEDGE *edgeset, /* in: intermediate tree topology */
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/
H A Dcloth.c484 if (cloth->edgeset) { in cloth_free_modifier()
485 BLI_edgeset_free(cloth->edgeset); in cloth_free_modifier()
566 if (cloth->edgeset) { in cloth_free_modifier_extern()
742 clmd->clothObject->edgeset = NULL; in cloth_from_object()
932 if (cloth->edgeset) { in cloth_free_errorsprings()
933 BLI_edgeset_free(cloth->edgeset); in cloth_free_errorsprings()
934 cloth->edgeset = NULL; in cloth_free_errorsprings()
1476 EdgeSet *edgeset = NULL; in cloth_build_springs() local
1488 BLI_assert(cloth->edgeset == NULL); in cloth_build_springs()
1491 cloth->edgeset = NULL; in cloth_build_springs()
[all …]
/dports/math/concorde/concorde/CUT/
H A Dgomoryhu.c75 typedef struct edgeset { struct
78 } edgeset; argument
81 edgeset adj;
141 delfromedgeset (edgeset *s, edge *e, CCptrworld *edgeptr_world),
144 unshrink (graph *G, node *pseudo, edgeset *esave, int num),
157 shrinkdown (graph *G, nodeset *a, node *pseudo, edgeset *esave, int num),
328 static void delfromedgeset (edgeset *s, edge *e, CCptrworld *edgeptr_world) in delfromedgeset()
417 edgeset esave; in gh_work()
679 static int shrinkdown (graph *G, nodeset *a, node *pseudo, edgeset *esave, in shrinkdown()
682 edgeset enew; in shrinkdown()
[all …]
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/tests/
H A DBLI_edgehash_test.cc361 TEST(edgeset, AddNonExistingIncreasesLength) in TEST() argument
376 TEST(edgeset, AddExistingDoesNotIncreaseLength) in TEST() argument
391 TEST(edgeset, HasKeyNonExisting) in TEST() argument
400 TEST(edgeset, HasKeyExisting) in TEST() argument
/dports/databases/grass7/grass-7.8.6/vector/v.generalize/
H A Dnetwork.c103 dglInt32_t *node, *edgeset, *edge; in graph_generalization() local
107 edgeset = dglNodeGet_OutEdgeset(gr, node); in graph_generalization()
108 dglEdgeset_T_Initialize(&et, gr, edgeset); in graph_generalization()
/dports/graphics/blender/blender-2.91.0/release/scripts/addons/mesh_tools/
H A Dmesh_filletplus.py386 edgeset = set([])
389 edgeset.add(e)
390 if len(edgeset) == 2:
391 is_finished = do_filletplus(self, edgeset)
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BASE/
H A DUndiGraphTestSuite.h260 gum::EdgeSet edgeset = graph.edges(); in testGetEdges() local
261 TS_ASSERT_EQUALS(edgeset.size(), graph.sizeEdges()) in testGetEdges()
264 for (const auto& edge: edgeset) in testGetEdges()
269 TS_ASSERT_EQUALS(edgeCount, edgeset.size()) in testGetEdges()
H A DMixedGraphTestSuite.h354 gum::EdgeSet edgeset = graph.edges(); in testGetEdges() local
355 TS_ASSERT_EQUALS(edgeset.size(), graph.sizeEdges()) in testGetEdges()
358 for (const auto& edge: edgeset) in testGetEdges()
363 TS_ASSERT_EQUALS(edgeCount, edgeset.size()) in testGetEdges()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/extensions/
H A Dhelpers.h267 PyObject* PySetFromEdgeSet(const gum::EdgeSet& edgeset) { in PySetFromEdgeSet() argument
269 for (const auto& edg: edgeset) { in PySetFromEdgeSet()
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/
H A DBKE_cloth.h93 struct EdgeSet *edgeset; /* used for selfcollisions */ member
/dports/games/redeclipse16/base-1.6.0/src/engine/
H A Docta.cpp138 edgeset(cubeedge(c, i, v[R[i]], v[C[i]]), v[D[i]], p[i]); in setcubevector()
150 edgeset(cubeedge(c, 0, (i>>R[0])&1, (i>>C[0])&1), (i>>D[0])&1, p.x); in setcubevector()
151 edgeset(cubeedge(c, 1, (i>>R[1])&1, (i>>C[1])&1), (i>>D[1])&1, p.y); in setcubevector()
152 edgeset(cubeedge(c, 2, (i>>R[2])&1, (i>>C[2])&1), (i>>D[2])&1, p.z); in setcubevector()
426 edgeset(cubeedge(ch[i], d, 0, 0), z, clamp(e[rd][cd] - dd*8, 0, 8)); in subdividecube()
427 edgeset(cubeedge(ch[i], d, 1, 0), z, clamp(e[1+rd][cd] - dd*8, 0, 8)); in subdividecube()
428 edgeset(cubeedge(ch[i], d, 0, 1), z, clamp(e[rd][1+cd] - dd*8, 0, 8)); in subdividecube()
429 edgeset(cubeedge(ch[i], d, 1, 1), z, clamp(e[1+rd][1+cd] - dd*8, 0, 8)); in subdividecube()
644 edgeset(cubeedge(c, 0, y, z), x, int(v.x+0.49f)); in edgespan2vectorcube()
645 edgeset(cubeedge(c, 1, z, x), y, int(v.y+0.49f)); in edgespan2vectorcube()
[all …]
/dports/games/sauerbraten/sauerbraten/src/engine/
H A Docta.cpp138 edgeset(cubeedge(c, i, v[R[i]], v[C[i]]), v[D[i]], p[i]); in setcubevector()
150 edgeset(cubeedge(c, 0, (i>>R[0])&1, (i>>C[0])&1), (i>>D[0])&1, p.x); in setcubevector()
151 edgeset(cubeedge(c, 1, (i>>R[1])&1, (i>>C[1])&1), (i>>D[1])&1, p.y); in setcubevector()
152 edgeset(cubeedge(c, 2, (i>>R[2])&1, (i>>C[2])&1), (i>>D[2])&1, p.z); in setcubevector()
424 edgeset(cubeedge(ch[i], d, 0, 0), z, clamp(e[rd][cd] - dd*8, 0, 8)); in subdividecube()
425 edgeset(cubeedge(ch[i], d, 1, 0), z, clamp(e[1+rd][cd] - dd*8, 0, 8)); in subdividecube()
426 edgeset(cubeedge(ch[i], d, 0, 1), z, clamp(e[rd][1+cd] - dd*8, 0, 8)); in subdividecube()
427 edgeset(cubeedge(ch[i], d, 1, 1), z, clamp(e[1+rd][1+cd] - dd*8, 0, 8)); in subdividecube()
643 edgeset(cubeedge(c, 0, y, z), x, int(v.x+0.49f)); in edgespan2vectorcube()
644 edgeset(cubeedge(c, 1, z, x), y, int(v.y+0.49f)); in edgespan2vectorcube()
[all …]
/dports/games/tesseract-data/tesseract/src/engine/
H A Docta.cpp152 edgeset(cubeedge(c, i, v[R[i]], v[C[i]]), v[D[i]], p[i]); in setcubevector()
164 edgeset(cubeedge(c, 0, (i>>R[0])&1, (i>>C[0])&1), (i>>D[0])&1, p.x); in setcubevector()
165 edgeset(cubeedge(c, 1, (i>>R[1])&1, (i>>C[1])&1), (i>>D[1])&1, p.y); in setcubevector()
166 edgeset(cubeedge(c, 2, (i>>R[2])&1, (i>>C[2])&1), (i>>D[2])&1, p.z); in setcubevector()
440 edgeset(cubeedge(ch[i], d, 0, 0), z, clamp(e[rd][cd] - dd*8, 0, 8)); in subdividecube()
441 edgeset(cubeedge(ch[i], d, 1, 0), z, clamp(e[1+rd][cd] - dd*8, 0, 8)); in subdividecube()
442 edgeset(cubeedge(ch[i], d, 0, 1), z, clamp(e[rd][1+cd] - dd*8, 0, 8)); in subdividecube()
443 edgeset(cubeedge(ch[i], d, 1, 1), z, clamp(e[1+rd][1+cd] - dd*8, 0, 8)); in subdividecube()
/dports/games/tesseract/tesseract/src/engine/
H A Docta.cpp152 edgeset(cubeedge(c, i, v[R[i]], v[C[i]]), v[D[i]], p[i]); in setcubevector()
164 edgeset(cubeedge(c, 0, (i>>R[0])&1, (i>>C[0])&1), (i>>D[0])&1, p.x); in setcubevector()
165 edgeset(cubeedge(c, 1, (i>>R[1])&1, (i>>C[1])&1), (i>>D[1])&1, p.y); in setcubevector()
166 edgeset(cubeedge(c, 2, (i>>R[2])&1, (i>>C[2])&1), (i>>D[2])&1, p.z); in setcubevector()
440 edgeset(cubeedge(ch[i], d, 0, 0), z, clamp(e[rd][cd] - dd*8, 0, 8)); in subdividecube()
441 edgeset(cubeedge(ch[i], d, 1, 0), z, clamp(e[1+rd][cd] - dd*8, 0, 8)); in subdividecube()
442 edgeset(cubeedge(ch[i], d, 0, 1), z, clamp(e[rd][1+cd] - dd*8, 0, 8)); in subdividecube()
443 edgeset(cubeedge(ch[i], d, 1, 1), z, clamp(e[1+rd][1+cd] - dd*8, 0, 8)); in subdividecube()
/dports/games/bloodfrontier/bloodfrontier/src/engine/
H A Docta.h253 #define edgeset(edge, coord, val) ((edge) = ((coord) ? ((edge)&0xF)|((val)<<4) : ((edge)&0xF0)|(val… macro
/dports/databases/grass7/grass-7.8.6/lib/vector/dglib/
H A Ddglib.dox208 #define DGL_IN_TAIL_OFFSET_v1 2// this gives where edgeset pointer is in pnode
243 …e.c ->This contains operations like getting, setting a node, finding in and out edgeset from node.
251 … misc-template.c -> operations like flattening or unflattening of graph, edgeset transversing, no…
/dports/games/redeclipse/base-2.0.0/src/engine/
H A Docta.cpp152 edgeset(cubeedge(c, i, v[R[i]], v[C[i]]), v[D[i]], p[i]); in setcubevector()
164 edgeset(cubeedge(c, 0, (i>>R[0])&1, (i>>C[0])&1), (i>>D[0])&1, p.x); in setcubevector()
165 edgeset(cubeedge(c, 1, (i>>R[1])&1, (i>>C[1])&1), (i>>D[1])&1, p.y); in setcubevector()
166 edgeset(cubeedge(c, 2, (i>>R[2])&1, (i>>C[2])&1), (i>>D[2])&1, p.z); in setcubevector()
439 edgeset(cubeedge(ch[i], d, 0, 0), z, clamp(e[rd][cd] - dd*8, 0, 8)); in subdividecube()
440 edgeset(cubeedge(ch[i], d, 1, 0), z, clamp(e[1+rd][cd] - dd*8, 0, 8)); in subdividecube()
441 edgeset(cubeedge(ch[i], d, 0, 1), z, clamp(e[rd][1+cd] - dd*8, 0, 8)); in subdividecube()
442 edgeset(cubeedge(ch[i], d, 1, 1), z, clamp(e[1+rd][1+cd] - dd*8, 0, 8)); in subdividecube()
/dports/math/vtk9/VTK-9.1.0/ThirdParty/ioss/vtkioss/
H A DIoss_Region.C1368 bool Region::add(EdgeSet *edgeset) in add() argument
1370 check_for_duplicate_names(this, edgeset); in add()
1371 update_database(this, edgeset); in add()
1376 add_alias__(edgeset); in add()
1377 edgeSets.push_back(edgeset); in add()
H A DIoss_Region.h153 bool add(EdgeSet *edgeset);
/dports/math/gap/gap-4.11.0/pkg/gbnp/lib/
H A Dgraphs.gi79 ### IncidenceMatrix to the edgeset where M(i,j) denotes number of
491 # Initialize edgeset and vertexset and lengthset;
502 # Start computing edgeset, lengthset and vertexset

1234