/dports/devel/bmake/bmake/ |
H A D | targ.c | 371 PrintNodeNames(GNodeList *gnodes) in PrintNodeNames() argument 375 for (ln = gnodes->first; ln != NULL; ln = ln->next) { in PrintNodeNames() 382 PrintNodeNamesLine(const char *label, GNodeList *gnodes) in PrintNodeNamesLine() argument 384 if (Lst_IsEmpty(gnodes)) in PrintNodeNamesLine() 387 PrintNodeNames(gnodes); in PrintNodeNamesLine() 536 Targ_PrintNodes(GNodeList *gnodes, int pass) in Targ_PrintNodes() argument 540 for (ln = gnodes->first; ln != NULL; ln = ln->next) in Targ_PrintNodes()
|
H A D | compat.c | 476 MakeNodes(GNodeList *gnodes, GNode *pgn) in MakeNodes() argument 480 for (ln = gnodes->first; ln != NULL; ln = ln->next) { in MakeNodes()
|
H A D | make.c | 1163 MakePrintStatusList(GNodeList *gnodes, int *errors) in MakePrintStatusList() argument 1167 for (ln = gnodes->first; ln != NULL; ln = ln->next) in MakePrintStatusList()
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/geometry/ |
H A D | Geometry.cpp | 1494 q=*gnodes[0]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1496 q=*gnodes[1]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1498 q=*gnodes[5]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1508 q=*gnodes[0]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1510 q=*gnodes[1]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1512 q=*gnodes[5]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1534 q=*gnodes[0]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1536 q=*gnodes[1]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1546 q=*gnodes[0]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() 1548 q=*gnodes[1]-0.5*(*gnodes[0]+*gnodes[2]); in isInside() [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/ |
H A D | matching.py | 325 gnodes = list(G) 326 if not gnodes: 367 inblossom = dict(zip(gnodes, gnodes)) 372 blossomparent = dict(zip(gnodes, repeat(None))) 376 blossombase = dict(zip(gnodes, gnodes)) 392 dualvar = dict(zip(gnodes, repeat(maxweight))) 778 for v in gnodes: 812 for v in gnodes: 954 for v in gnodes:
|
H A D | cycles.py | 65 gnodes = set(G.nodes()) 67 while gnodes: # loop over connected components 69 root = gnodes.pop() 93 gnodes -= set(pred)
|
/dports/science/PETSc/petsc-3.14.1/src/ksp/pc/impls/gamg/ |
H A D | geo.c | 584 GAMGNode *gnodes; in PCGAMGCoarsen_GEO() local 597 ierr = PetscMalloc1(nloc, &gnodes);CHKERRQ(ierr); in PCGAMGCoarsen_GEO() 604 gnodes[lid].lid = lid; in PCGAMGCoarsen_GEO() 605 gnodes[lid].degree = ncols; in PCGAMGCoarsen_GEO() 621 GAMGNode iTemp = gnodes[iSwapIndex]; in PCGAMGCoarsen_GEO() 622 gnodes[iSwapIndex] = gnodes[Ii]; in PCGAMGCoarsen_GEO() 623 gnodes[Ii] = iTemp; in PCGAMGCoarsen_GEO() 632 qsort(gnodes, nloc, sizeof(GAMGNode), petsc_geo_mg_compare); in PCGAMGCoarsen_GEO() 634 for (kk=0; kk<nloc; kk++) permute[kk] = gnodes[kk].lid; /* locals only */ in PCGAMGCoarsen_GEO() 635 ierr = PetscFree(gnodes);CHKERRQ(ierr); in PCGAMGCoarsen_GEO()
|
/dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/graphs/ |
H A D | relativeNeighborhoodGraph.m | 28 function [gnodes, gedges] = relativeNeighborhoodGraph(points) 99 gnodes = points; variable 101 gnodes = gedges; variable
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/DrawGraph/ |
H A D | vrp_dg_network.c | 230 dg_node *nod, *gnod, *nodes, *gnodes = g->nodes; in copy_network_into_graph() local 241 gnod = gnodes + i; in copy_network_into_graph() 250 FREE(gnodes); in copy_network_into_graph()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/DrawGraph/ |
H A D | cnrp_dg_network.c | 229 dg_node *nod, *gnod, *nodes, *gnodes = g->nodes; in copy_network_into_graph() local 240 gnod = gnodes + i; in copy_network_into_graph() 249 FREE(gnodes); in copy_network_into_graph()
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/operators/ |
H A D | binary.py | 270 gnodes = set(G) # set of nodes in G 272 nodes = gnodes.symmetric_difference(hnodes)
|
/dports/lang/gambit-c/gambit-4.9.3/gsc/ |
H A D | _utils.scm | 360 (define (gnodes-remove graph gnodes) 364 (if (memq node gnodes) 365 (gnodes-remove (cdr graph) gnodes) 366 (cons node (gnodes-remove (cdr graph) gnodes)))))) 1092 (define (gnodes-remove graph gnodes) 1096 (if (memq node gnodes) 1097 (gnodes-remove (cdr graph) gnodes) 1098 (cons node (gnodes-remove (cdr graph) gnodes))))))
|
/dports/cad/py-lcapy/lcapy-23c940f/lcapy/ |
H A D | schemgraph.py | 174 gnodes = self.values() 178 for gnode in gnodes:
|
/dports/sysutils/automounter/automounter-1.5.1/src/ |
H A D | automounter | 1728 local gnodes image encrypted 1751 gnodes=$(/bin/cat $geli_nodes 2>&3) 1784 label=$(echo $gnodes | /usr/bin/grep "^$image;")
|
/dports/cad/pcb/pcb-4.2.0/gts/ |
H A D | graph.c | 1099 GtsGNode * gts_graph_farthest (GtsGraph * g, GSList * gnodes) in gts_graph_farthest() argument 1109 i = gnodes; in gts_graph_farthest() 1119 i = gnodes; in gts_graph_farthest() 1134 i = gnodes; in gts_graph_farthest()
|
H A D | gts.h | 2384 GSList * gnodes);
|
/dports/science/afni/afni-AFNI_21.3.16/src/SUMA/gts/src/ |
H A D | graph.c | 1099 GtsGNode * gts_graph_farthest (GtsGraph * g, GSList * gnodes) in gts_graph_farthest() argument 1109 i = gnodes; in gts_graph_farthest() 1119 i = gnodes; in gts_graph_farthest() 1134 i = gnodes; in gts_graph_farthest()
|
H A D | gts.h | 2251 GSList * gnodes);
|
/dports/graphics/gts/gts-0.7.6/src/ |
H A D | graph.c | 1099 GtsGNode * gts_graph_farthest (GtsGraph * g, GSList * gnodes) in gts_graph_farthest() argument 1109 i = gnodes; in gts_graph_farthest() 1119 i = gnodes; in gts_graph_farthest() 1134 i = gnodes; in gts_graph_farthest()
|
H A D | gts.h | 2368 GSList * gnodes);
|
/dports/biology/paml/paml4.9j/src/ |
H A D | mcmctree.c | 119 } *nodes, **gnodes, nodes_t[2 * NS - 1]; variable 342 gnodes[locus][j].conP = conP; in GetMem() 407 free(gnodes[locus]); in FreeMem() 408 free(gnodes); in FreeMem() 457 nodes = gnodes[locus]; in UseLocus() 459 memcpy(conPt, gnodes[locus][com.ns].conP, sG*s1*(com.ns - 1) * sizeof(double)); in UseLocus() 515 memcpy(conP, gnodes[locus][ns].conP, sG*s1*(ns - 1) * sizeof(double)); in AcceptRejectLocus() 517 gnodes[locus][i].conP = conP + (i - ns)*s1; in AcceptRejectLocus() 539 gnodes[locus][i].conP = conP; in switchconPin()
|
H A D | treesub.c | 8787 if ((gnodes = (struct TREEN**)malloc(sizeof(struct TREEN*)*data.ngene)) == NULL) in ReadTreeSeqs() 8903 gnodes[locus] = (struct TREEN*)malloc((ns * 2 - 1) * sizeof(struct TREEN)); in GenerateGtree() 8904 if (gnodes[locus] == NULL) error2("oom gtree"); in GenerateGtree() 8905 memcpy(gnodes[locus], nodes, (ns * 2 - 1) * sizeof(struct TREEN)); in GenerateGtree() 9082 nodes = gnodes[locus]; in UseLocus() 9174 gnodes[locus][j].conP = com.conP + (j - data.ns[locus])*snode; in GetMemBC() 9217 free(gnodes[locus]); in FreeMemBC() 9218 free(gnodes); in FreeMemBC() 9896 gnodes[locus][i].label = 0; in DatingHeteroData()
|
/dports/devel/glib20/glib-2.70.4/ |
H A D | NEWS.pre-1-3 | 32 * Allocate smaller pools of memory for glists, gslists, gnodes
|
/dports/devel/radare2/radare2-5.1.1/libr/core/ |
H A D | cmd_debug.c | 663 Sdb *gnodes = data->graphnodes; in dot_trace_discover_child() local 669 RGraphNode *gn = get_graphtrace_node (g, gnodes, tn); in dot_trace_discover_child() 670 RGraphNode *gn_parent = get_graphtrace_node (g, gnodes, tn_parent); in dot_trace_discover_child()
|
H A D | agraph.c | 3267 RList *gnodes = in? an->gnode->in_nodes: an->gnode->out_nodes; in agraph_follow_innodes() local 3269 r_list_foreach (gnodes, iter, gn) { in agraph_follow_innodes()
|