| /dports/math/igraph/igraph-0.9.5/src/layout/ |
| H A D | reingold_tilford.c | 679 igraph_vector_t newedges; in igraph_layout_reingold_tilford() local
754 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
755 VECTOR(newedges)[edgeptr++] = rn; in igraph_layout_reingold_tilford() local
757 VECTOR(newedges)[edgeptr++] = no_of_nodes + 1; in igraph_layout_reingold_tilford() local
758 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
762 VECTOR(newedges)[edgeptr++] = rn; in igraph_layout_reingold_tilford() local
763 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
765 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
766 VECTOR(newedges)[edgeptr++] = no_of_nodes + 1; in igraph_layout_reingold_tilford() local
832 VECTOR(newedges)[2 * i] = no_of_nodes - 1; in igraph_layout_reingold_tilford() local
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/games/ |
| H A D | correlated.c | 66 igraph_vector_t add, delete, edges, newedges; in igraph_correlated_game() local
229 VECTOR(newedges)[i] = VECTOR(*permutation)[tmp]; in igraph_correlated_game() local
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | layout.c | 1170 igraph_vector_t newedges; in igraph_layout_reingold_tilford() local
1290 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
1291 VECTOR(newedges)[edgeptr++] = rn; in igraph_layout_reingold_tilford() local
1293 VECTOR(newedges)[edgeptr++] = no_of_nodes + 1; in igraph_layout_reingold_tilford() local
1294 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
1298 VECTOR(newedges)[edgeptr++] = rn; in igraph_layout_reingold_tilford() local
1299 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
1301 VECTOR(newedges)[edgeptr++] = no_of_nodes; in igraph_layout_reingold_tilford() local
1302 VECTOR(newedges)[edgeptr++] = no_of_nodes + 1; in igraph_layout_reingold_tilford() local
1368 VECTOR(newedges)[2 * i] = no_of_nodes - 1; in igraph_layout_reingold_tilford() local
[all …]
|
| /dports/science/yoda/YODA-1.9.1/include/YODA/ |
| H A D | Profile1D.h | 189 void rebinTo(const std::vector<double>& newedges) { in rebinTo()
193 void rebin(const std::vector<double>& newedges) { in rebin()
|
| H A D | Histo1D.h | 185 void rebinTo(const std::vector<double>& newedges) { in rebinTo()
189 void rebin(const std::vector<double>& newedges) { in rebin()
|
| /dports/math/R-cran-lava/lava/R/ |
| H A D | finalize.R | 105 newedges <- c() vector
|
| /dports/games/quakeforge/quakeforge-0.7.2/libs/video/renderer/sw/ |
| H A D | sw_redge.c | 59 edge_t *newedges[MAXHEIGHT]; variable
|
| /dports/games/libretro-tyrquake/tyrquake-e76477d/common/ |
| H A D | r_edge.c | 48 edge_t *newedges[MAXHEIGHT]; variable
|
| /dports/misc/vxl/vxl-3.3.2/contrib/gel/vtol/ |
| H A D | vtol_face_2d.cxx | 26 topology_list newedges(edgs.size()); in vtol_face_2d() local
|
| H A D | vtol_block.cxx | 73 topology_list newedges(edgs.size()); in vtol_block() local
|
| H A D | vtol_two_chain.cxx | 107 topology_list newedges(elen); in vtol_two_chain() local
|
| /dports/games/tenebrae/tenebrae_0/ |
| H A D | r_edge.c | 46 edge_t *newedges[MAXHEIGHT]; variable
|
| /dports/science/mpqc/mpqc-2.3.1/src/lib/util/render/ |
| H A D | polysphere.cc | 120 edge* newedges = new edge[ne2]; in subdivide() local
|
| /dports/math/SCIP/scip-7.0.3/applications/STP/src/ |
| H A D | heur_ascendprune.c | 306 int* const newedges = edgearrint; in SCIPStpHeurAscendPruneRun() local
|
| /dports/games/uhexen2/hexen2source-1.5.9/engine/h2shared/ |
| H A D | r_edge.c | 49 edge_t *newedges[MAXHEIGHT]; variable
|
| /dports/games/quake2-source/quake2-r0.16.2/src/ref_soft/ |
| H A D | r_edge.c | 57 edge_t *newedges[MAXHEIGHT]; variable
|
| /dports/games/quake2lnx/quake2-r0.16.2/src/ref_soft/ |
| H A D | r_edge.c | 57 edge_t *newedges[MAXHEIGHT]; variable
|
| /dports/games/q2pro/q2pro/ref_soft/ |
| H A D | sw_edge.c | 57 edge_t *newedges[MAXHEIGHT]; variable
|
| /dports/graphics/opendx/dx-4.4.4/src/exec/dxmods/ |
| H A D | pie.c | 114 Group edges=NULL, newedges; in m_Pie() local
360 Object member, newpie, newedges; in MakePie() local
|
| /dports/archivers/bicom/bicom-1.01/bialib/ |
| H A D | sufftree.cpp | 468 LNode *newedges[MAXEXCLS]; in Walk() local
|
| /dports/graphics/blender/blender-2.91.0/source/blender/freestyle/intern/view_map/ |
| H A D | ViewEdgeXBuilder.cpp | 124 vector<FEdge *> &newedges = _pCurrentSShape->getEdgeList(); in BuildViewEdges() local
|
| /dports/math/freefem++/FreeFem-sources-4.6/src/bamglib/ |
| H A D | MeshQuad.cpp | 405 Edge *newedges = new Edge[newnbe]; in SplitElement() local
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/bamg/bamglib/ |
| H A D | MeshQuad.cpp | 422 Edge *newedges = new Edge [newnbe]; in SplitElement() local
|
| /dports/science/teem/teem-1.11.0-src/src/limn/ |
| H A D | polyshapes.c | 1158 unsigned int *newedges, *newfaces; in limnPolyDataIcoSphere() local
|
| /dports/games/quakeforge/quakeforge-0.7.2/libs/video/renderer/sw32/ |
| H A D | namehack.h | 160 #define newedges sw32_newedges macro
|