/dports/math/R-cran-igraph/igraph/src/ |
H A D | sbm.c | 134 while (last < maxedges) { in igraph_sbm_game() 144 while (last < maxedges) { in igraph_sbm_game() 154 while (last < maxedges) { in igraph_sbm_game() 167 while (last < maxedges) { in igraph_sbm_game() 177 while (last < maxedges) { in igraph_sbm_game() 187 while (last < maxedges) { in igraph_sbm_game() 197 while (last < maxedges) { in igraph_sbm_game() 315 igraph_real_t maxedges; in igraph_hsbm_game() local 371 while (last < maxedges) { in igraph_hsbm_game() 524 igraph_real_t maxedges; in igraph_hsbm_list_game() local [all …]
|
/dports/math/igraph/igraph-0.9.5/src/games/ |
H A D | sbm.c | 148 while (last < maxedges) { in igraph_sbm_game() 158 while (last < maxedges) { in igraph_sbm_game() 168 while (last < maxedges) { in igraph_sbm_game() 181 while (last < maxedges) { in igraph_sbm_game() 191 while (last < maxedges) { in igraph_sbm_game() 201 while (last < maxedges) { in igraph_sbm_game() 211 while (last < maxedges) { in igraph_sbm_game() 329 igraph_real_t maxedges; in igraph_hsbm_game() local 385 while (last < maxedges) { in igraph_hsbm_game() 538 igraph_real_t maxedges; in igraph_hsbm_list_game() local [all …]
|
H A D | erdos_renyi.c | 63 double maxedges = n, last; in igraph_erdos_renyi_game_gnp() local 65 maxedges *= n; in igraph_erdos_renyi_game_gnp() 67 maxedges *= (n - 1); in igraph_erdos_renyi_game_gnp() 69 maxedges *= (n + 1) / 2.0; in igraph_erdos_renyi_game_gnp() 71 maxedges *= (n - 1) / 2.0; in igraph_erdos_renyi_game_gnp() 80 while (last < maxedges) { in igraph_erdos_renyi_game_gnp() 158 double maxedges = n; in igraph_erdos_renyi_game_gnm() local 160 maxedges *= n; in igraph_erdos_renyi_game_gnm() 162 maxedges *= (n - 1); in igraph_erdos_renyi_game_gnm() 164 maxedges *= (n + 1) / 2.0; in igraph_erdos_renyi_game_gnm() [all …]
|
H A D | preference.c | 108 igraph_real_t maxcum, maxedges; in igraph_preference_game() local 266 maxedges = v1_size * v2_size; in igraph_preference_game() 269 maxedges = v1_size * v1_size; in igraph_preference_game() 271 maxedges = v1_size * (v1_size - 1); in igraph_preference_game() 273 maxedges = v1_size * (v1_size + 1) / 2; in igraph_preference_game() 275 maxedges = v1_size * (v1_size - 1) / 2; in igraph_preference_game() 282 while (last < maxedges) { in igraph_preference_game() 408 igraph_real_t maxcum, maxedges; in igraph_asymmetric_preference_game() local 552 maxedges = v1_size * v2_size; in igraph_asymmetric_preference_game() 556 maxedges -= c; in igraph_asymmetric_preference_game() [all …]
|
H A D | islands.c | 63 double maxedges; in igraph_simple_interconnected_islands_game() local 88 maxedges = maxedgesPerIsland * islands_n + nbEdgesInterIslands; in igraph_simple_interconnected_islands_game() 92 IGRAPH_CHECK(igraph_vector_reserve(&edges, (long int) maxedges)); in igraph_simple_interconnected_islands_game()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mpi/fortran/mpif-h/ |
H A D | graph_get_f.c | 41 …(MPI_Fint *comm, MPI_Fint *maxindex, MPI_Fint *maxedges, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint… 42 (comm, maxindex, maxedges, indx, edges, ierr) ) 61 …(MPI_Fint *comm, MPI_Fint *maxindex, MPI_Fint *maxedges, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint… 62 (comm, maxindex, maxedges, indx, edges, ierr) ) 70 MPI_Fint *maxedges, MPI_Fint *indx, in ompi_graph_get_f() argument 80 OMPI_ARRAY_FINT_2_INT_ALLOC(edges, *maxedges); in ompi_graph_get_f() 84 OMPI_FINT_2_INT(*maxedges), in ompi_graph_get_f() 91 OMPI_ARRAY_INT_2_FINT(edges, *maxedges); in ompi_graph_get_f()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mpi/fortran/mpif-h/ |
H A D | graph_get_f.c | 41 …(MPI_Fint *comm, MPI_Fint *maxindex, MPI_Fint *maxedges, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint… 42 (comm, maxindex, maxedges, indx, edges, ierr) ) 61 …(MPI_Fint *comm, MPI_Fint *maxindex, MPI_Fint *maxedges, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint… 62 (comm, maxindex, maxedges, indx, edges, ierr) ) 70 MPI_Fint *maxedges, MPI_Fint *indx, in ompi_graph_get_f() argument 80 OMPI_ARRAY_FINT_2_INT_ALLOC(edges, *maxedges); in ompi_graph_get_f() 84 OMPI_FINT_2_INT(*maxedges), in ompi_graph_get_f() 91 OMPI_ARRAY_INT_2_FINT(edges, *maxedges); in ompi_graph_get_f()
|
/dports/math/vtk8/VTK-8.2.0/Filters/Extraction/ |
H A D | vtkFrustumSelector.cxx | 197 int maxedges = 16; in ABoxFrustumIsect() local 199 vertbuffer.resize(3*maxedges*3); in ABoxFrustumIsect() 227 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 229 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() 245 if (nedges+4 > maxedges) in ABoxFrustumIsect() 247 maxedges=(nedges+4)*2; in ABoxFrustumIsect() 248 vertbuffer.resize(3*maxedges*3); in ABoxFrustumIsect() 249 vlist = &vertbuffer[0*maxedges*3]; in ABoxFrustumIsect() 324 if (nedges+4 > maxedges) in ABoxFrustumIsect() 326 maxedges=(nedges+4)*2; in ABoxFrustumIsect() [all …]
|
/dports/math/nauty/nauty27r3/ |
H A D | multig.c | 295 max = maxedges - sofar - left; in scan() 329 max = maxedges - sofar - left; in scan_md() 369 max = maxedges - sofar - left; in scan_lp() 422 max = maxedges - sofar - left; in scan_reg() 555 if (maxedges == NOLIMIT) in multi() 557 if (maxmult == NOLIMIT) maxedges = maxdeg*n/2; in multi() 558 else maxedges = ne*maxmult; in multi() 630 long minedges,maxedges,maxmult; in main() local 706 maxedges = NOLIMIT; in main() 715 if (maxedges >= NOLIMIT && maxmult >= NOLIMIT in main() [all …]
|
H A D | vcolg.c | 221 max = maxedges - sofar; in scan() 239 colourgraph(graph *g, int nfixed, long minedges, long maxedges, in colourgraph() argument 320 if (maxedges == NOLIMIT || maxedges > n*numcols) maxedges = n*numcols; in colourgraph() 357 scan(0,g,FALSE,prev,minedges,maxedges,0,numcols,group,m,n); in colourgraph() 363 colourdigraph(graph *g, int nfixed, long minedges, long maxedges, in colourdigraph() argument 453 if (maxedges == NOLIMIT || maxedges > n*numcols) maxedges = n*numcols; in colourdigraph() 498 scan(0,g,TRUE,prev,minedges,maxedges,0,numcols,group,m,n); in colourdigraph() 512 long minedges,maxedges,numcols; in main() local 575 maxedges = NOLIMIT; in main() 590 if (eswitch) CATMSG2("e%ld:%ld",minedges,maxedges); in main() [all …]
|
/dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/ |
H A D | multig.c | 295 max = maxedges - sofar - left; in scan() 329 max = maxedges - sofar - left; in scan_md() 369 max = maxedges - sofar - left; in scan_lp() 422 max = maxedges - sofar - left; in scan_reg() 555 if (maxedges == NOLIMIT) in multi() 557 if (maxmult == NOLIMIT) maxedges = maxdeg*n/2; in multi() 558 else maxedges = ne*maxmult; in multi() 630 long minedges,maxedges,maxmult; in main() local 706 maxedges = NOLIMIT; in main() 715 if (maxedges >= NOLIMIT && maxmult >= NOLIMIT in main() [all …]
|
H A D | vcolg.c | 221 max = maxedges - sofar; in scan() 239 colourgraph(graph *g, int nfixed, long minedges, long maxedges, in colourgraph() argument 320 if (maxedges == NOLIMIT || maxedges > n*numcols) maxedges = n*numcols; in colourgraph() 357 scan(0,g,FALSE,prev,minedges,maxedges,0,numcols,group,m,n); in colourgraph() 363 colourdigraph(graph *g, int nfixed, long minedges, long maxedges, in colourdigraph() argument 453 if (maxedges == NOLIMIT || maxedges > n*numcols) maxedges = n*numcols; in colourdigraph() 498 scan(0,g,TRUE,prev,minedges,maxedges,0,numcols,group,m,n); in colourdigraph() 512 long minedges,maxedges,numcols; in main() local 575 maxedges = NOLIMIT; in main() 590 if (eswitch) CATMSG2("e%ld:%ld",minedges,maxedges); in main() [all …]
|
/dports/math/vtk9/VTK-9.1.0/Filters/Extraction/ |
H A D | vtkFrustumSelector.cxx | 197 int maxedges = 16; in ABoxFrustumIsect() local 199 vertbuffer.resize(3 * maxedges * 3); in ABoxFrustumIsect() 227 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 229 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() 245 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 247 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() 248 vertbuffer.resize(3 * maxedges * 3); in ABoxFrustumIsect() 249 vlist = &vertbuffer[0 * maxedges * 3]; in ABoxFrustumIsect() 324 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 326 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/binding/fortran/use_mpi_f08/wrappers_f/profiling/ |
H A D | pgraph_get_f08ts.f90 | 16 integer, intent(in) :: maxedges local 18 integer, intent(out) :: edges(maxedges) 25 integer(c_int) :: edges_c(maxedges) 29 ierror_c = MPIR_Graph_get_c(comm%MPI_VAL, maxindex, maxedges, index, edges) 33 maxedges_c = maxedges
|
/dports/net/mpich/mpich-3.4.3/src/binding/fortran/use_mpi_f08/wrappers_f/ |
H A D | graph_get_f08ts.f90 | 16 integer, intent(in) :: maxedges local 18 integer, intent(out) :: edges(maxedges) 25 integer(c_int) :: edges_c(maxedges) 29 ierror_c = MPIR_Graph_get_c(comm%MPI_VAL, maxindex, maxedges, index, edges) 33 maxedges_c = maxedges
|
/dports/math/gap/gap-4.11.0/pkg/grape-4.8.3/nauty22/ |
H A D | multig.c | 239 max = maxedges - sofar - left; in scan() 245 scan(level+1,ne,minedges,maxedges,sofar+k,maxmult,group,n); in scan() 289 if (maxedges == NOLIMIT) maxedges = ne*maxmult; in multi() 290 if (maxmult == NOLIMIT) maxmult = maxedges - ne + 1; in multi() 291 if (maxedges < ne || ne*maxmult < minedges) return; in multi() 348 scan(0,ne,minedges,maxedges,0,maxmult,group,n); in multi() 361 long minedges,maxedges,maxmult; in main() local 429 maxedges = NOLIMIT; in main() 438 if (maxedges >= NOLIMIT && maxmult >= NOLIMIT) in main() 455 fprintf(stderr,"e%d:%d",minedges,maxedges); in main() [all …]
|
/dports/math/vtk9/VTK-9.1.0/Filters/General/ |
H A D | vtkExtractSelectedFrustum.cxx | 827 int maxedges = 16; in ABoxFrustumIsect() local 829 vertbuffer = new double[3 * maxedges * 3]; in ABoxFrustumIsect() 857 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 860 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() 877 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 880 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() 882 vlist = &vertbuffer[0 * maxedges * 3]; in ABoxFrustumIsect() 883 wvlist = &vertbuffer[1 * maxedges * 3]; in ABoxFrustumIsect() 884 ovlist = &vertbuffer[2 * maxedges * 3]; in ABoxFrustumIsect() 959 if (nedges + 4 > maxedges) in ABoxFrustumIsect() [all …]
|
/dports/math/vtk8/VTK-8.2.0/Filters/General/ |
H A D | vtkExtractSelectedFrustum.cxx | 871 int maxedges = 16; in ABoxFrustumIsect() local 873 vertbuffer = new double[3*maxedges*3]; in ABoxFrustumIsect() 901 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 904 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() 921 if (nedges+4 > maxedges) in ABoxFrustumIsect() 924 maxedges=(nedges+4)*2; in ABoxFrustumIsect() 926 vlist = &vertbuffer[0*maxedges*3]; in ABoxFrustumIsect() 927 wvlist = &vertbuffer[1*maxedges*3]; in ABoxFrustumIsect() 928 ovlist = &vertbuffer[2*maxedges*3]; in ABoxFrustumIsect() 1003 if (nedges+4 > maxedges) in ABoxFrustumIsect() [all …]
|
/dports/math/vtk6/VTK-6.2.0/Filters/Extraction/ |
H A D | vtkExtractSelectedFrustum.cxx | 871 int maxedges = 16; in ABoxFrustumIsect() local 873 vertbuffer = new double[3*maxedges*3]; in ABoxFrustumIsect() 901 if (nedges + 4 > maxedges) in ABoxFrustumIsect() 904 maxedges = (nedges + 4) * 2; in ABoxFrustumIsect() 921 if (nedges+4 > maxedges) in ABoxFrustumIsect() 924 maxedges=(nedges+4)*2; in ABoxFrustumIsect() 926 vlist = &vertbuffer[0*maxedges*3]; in ABoxFrustumIsect() 927 wvlist = &vertbuffer[1*maxedges*3]; in ABoxFrustumIsect() 928 ovlist = &vertbuffer[2*maxedges*3]; in ABoxFrustumIsect() 1003 if (nedges+4 > maxedges) in ABoxFrustumIsect() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/mpi/topo/ |
H A D | graph_get.c | 16 int MPI_Graph_get(MPI_Comm comm, int maxindex, int maxedges, int indx[], int edges[]) 53 int MPI_Graph_get(MPI_Comm comm, int maxindex, int maxedges, int indx[], int edges[]) in MPI_Graph_get() argument 107 MPIR_ERR_CHKANDJUMP3((topo_ptr->topo.graph.nedges > maxedges), mpi_errno, MPI_ERR_ARG, in MPI_Graph_get() 108 "**argtoosmall", "**argtoosmall %s %d %d", "maxedges", maxedges, in MPI_Graph_get() 136 maxindex, maxedges, indx, edges); in MPI_Graph_get()
|
/dports/net/mpich2/mpich2-1.5/src/mpi/topo/ |
H A D | graph_get.c | 56 int MPI_Graph_get(MPI_Comm comm, int maxindex, int maxedges, in MPI_Graph_get() argument 108 …MPIU_ERR_CHKANDJUMP3((topo_ptr->topo.graph.nedges > maxedges), mpi_errno, MPI_ERR_ARG, "**argrange… in MPI_Graph_get() 109 "**argrange %s %d %d", "maxedges", maxedges, topo_ptr->topo.graph.nedges); in MPI_Graph_get() 135 "**mpi_graph_get %C %d %d %p %p", comm, maxindex, maxedges, indx, edges); in MPI_Graph_get()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mpi/c/ |
H A D | graph_get.c | 43 int MPI_Graph_get(MPI_Comm comm, int maxindx, int maxedges, in MPI_Graph_get() argument 62 if (0 > maxindx || 0 > maxedges || NULL == indx || NULL == edges) { in MPI_Graph_get() 75 err = comm->c_topo->topo.graph.graph_get(comm, maxindx, maxedges, indx, edges); in MPI_Graph_get()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mpi/c/ |
H A D | graph_get.c | 43 int MPI_Graph_get(MPI_Comm comm, int maxindx, int maxedges, in MPI_Graph_get() argument 62 if (0 > maxindx || 0 > maxedges || NULL == indx || NULL == edges) { in MPI_Graph_get() 75 err = comm->c_topo->topo.graph.graph_get(comm, maxindx, maxedges, indx, edges); in MPI_Graph_get()
|
/dports/science/silo/silo-4.10.2-bsd/tests/ |
H A D | efcentering.c | 58 add_edge(int nid1, int nid2, int *nedges, int *maxedges, int **edges) in add_edge() argument 60 if (*nedges == *maxedges) in add_edge() 62 *maxedges = (*maxedges) * 2 + 1; in add_edge() 63 *edges = (int *) realloc(*edges, *maxedges * 2 * sizeof(int)); in add_edge() 87 add_edge(nodelist[nlidx+A],nodelist[nlidx+B],nedges,&maxedges,edges) 96 int maxedges = 0; in build_edgelist() local
|
/dports/databases/postgis30/postgis-3.0.4/topology/sql/query/ |
H A D | GetRingEdges.sql.in | 38 -- GetRingEdges(atopology, anedge, [maxedges]) 40 CREATE OR REPLACE FUNCTION topology.GetRingEdges(atopology varchar, anedge int, maxedges int DEFAUL… 72 IF n > maxedges THEN 73 RAISE EXCEPTION 'Max traversing limit hit: %', maxedges;
|