/dports/math/igraph/igraph-0.9.5/src/centrality/prpack/ |
H A D | prpack_base_graph.cpp | 21 num_vs = num_es = 0; in prpack_base_graph() 26 num_vs = g->num_vs; in prpack_base_graph() 32 tails = new int[num_vs]; in prpack_base_graph() 68 num_vs = (int)g->num_vs; in prpack_base_graph() 74 tails = new int[num_vs]; in prpack_base_graph() 114 num_vs = g->num_vs; in prpack_base_graph() 120 tails = new int[num_vs]; in prpack_base_graph() 181 tails = new int[num_vs]; in read_smat() 230 num_vs = al.size(); in read_edges() 232 tails = new int[num_vs]; in read_edges() [all …]
|
H A D | prpack_preprocessed_ge_graph.cpp | 13 fill(d, d + num_vs, 1); in initialize_weighted() 15 for (int i = 0, inum_vs = 0; i < num_vs; ++i, inum_vs += num_vs) { in initialize_weighted() 17 const int end_j = (i + 1 != num_vs) ? bg->tails[i + 1] : bg->num_es; in initialize_weighted() 27 for (int i = 0, inum_vs = 0; i < num_vs; ++i, inum_vs += num_vs) { in initialize_unweighted() 34 for (int j = 0; j < num_vs; ++j) { in initialize_unweighted() 36 for (int inum_vs = 0; inum_vs < num_vs*num_vs; inum_vs += num_vs) in initialize_unweighted() 41 for (int inum_vs = 0; inum_vs < num_vs*num_vs; inum_vs += num_vs) in initialize_unweighted() 51 num_vs = bg->num_vs; in prpack_preprocessed_ge_graph() 53 matrix = new double[num_vs*num_vs]; in prpack_preprocessed_ge_graph() 54 d = new double[num_vs]; in prpack_preprocessed_ge_graph() [all …]
|
H A D | prpack_solver.cpp | 61 return bg->num_vs; in get_num_vs() 245 ret->num_vs = bg->num_vs; in solve() 264 double* A = new double[num_vs*num_vs]; in solve_via_ge() 265 for (int i = 0; i < num_vs*num_vs; ++i) in solve_via_ge() 267 for (int i = 0; i < num_vs*num_vs; i += num_vs + 1) in solve_via_ge() 300 double* A = new double[num_vs*num_vs]; in solve_via_ge_uv() 301 for (int i = 0; i < num_vs*num_vs; ++i) in solve_via_ge_uv() 303 for (int i = 0, inum_vs = 0; i < num_vs; ++i, inum_vs += num_vs) in solve_via_ge_uv() 306 for (int i = 0; i < num_vs*num_vs; i += num_vs + 1) in solve_via_ge_uv() 544 for (int i = num_vs - num_no_out_vs; i < num_vs; ++i) { in solve_via_schur_gs() [all …]
|
H A D | prpack_preprocessed_schur_graph.cpp | 21 d = new double[num_vs]; in initialize_weighted() 22 for (int i = 0; i < num_vs; ++i) in initialize_weighted() 46 num_outlinks = new double[num_vs]; in initialize_unweighted() 47 for (int i = 0; i < num_vs; ++i) in initialize_unweighted() 70 num_vs = bg->num_vs; in prpack_preprocessed_schur_graph() 72 tails = new int[num_vs]; in prpack_preprocessed_schur_graph() 76 vals = new double[num_vs]; in prpack_preprocessed_schur_graph() 77 d = new double[num_vs]; in prpack_preprocessed_schur_graph() 78 fill(d, d + num_vs, 1); in prpack_preprocessed_schur_graph() 88 encoding = new int[num_vs]; in prpack_preprocessed_schur_graph() [all …]
|
H A D | prpack_preprocessed_scc_graph.cpp | 26 d = new double[num_vs]; in initialize_weighted() 27 fill(d, d + num_vs, 1); in initialize_weighted() 60 num_outlinks = new double[num_vs]; in initialize_unweighted() 86 for (int i = 0; i < num_vs; ++i) { in initialize_unweighted() 96 num_vs = bg->num_vs; in prpack_preprocessed_scc_graph() 103 decoding = new int[num_vs]; in prpack_preprocessed_scc_graph() 108 memset(num, -1, num_vs*sizeof(num[0])); in prpack_preprocessed_scc_graph() 109 memset(scc, -1, num_vs*sizeof(scc[0])); in prpack_preprocessed_scc_graph() 163 divisions[i] = cs1[num_vs - 1 - i]; in prpack_preprocessed_scc_graph() 165 for (int i = 0; i < num_vs; ++i) in prpack_preprocessed_scc_graph() [all …]
|
H A D | prpack_preprocessed_gs_graph.cpp | 17 d = new double[num_vs]; in initialize_weighted() 18 fill(d, d + num_vs, 1); in initialize_weighted() 19 for (int tails_i = 0, heads_i = 0; tails_i < num_vs; ++tails_i) { in initialize_weighted() 23 const int end_j = (tails_i + 1 != num_vs) ? bg->tails[tails_i + 1]: bg->num_es; in initialize_weighted() 38 num_outlinks = new double[num_vs]; in initialize_unweighted() 39 fill(num_outlinks, num_outlinks + num_vs, 0); in initialize_unweighted() 40 for (int tails_i = 0, heads_i = 0; tails_i < num_vs; ++tails_i) { in initialize_unweighted() 53 for (int i = 0; i < num_vs; ++i) { in initialize_unweighted() 62 num_vs = bg->num_vs; in prpack_preprocessed_gs_graph() 65 tails = new int[num_vs]; in prpack_preprocessed_gs_graph() [all …]
|
H A D | prpack_solver.h | 34 const int num_vs, 40 const int num_vs, 48 const int num_vs, 61 const int num_vs, 72 const int num_vs, 89 const int num_vs, 106 const int num_vs, 127 const int num_vs, 148 const int num_vs,
|
H A D | prpack_igraph_graph.cpp | 24 num_vs = igraph_vcount(g); in prpack_igraph_graph() 33 tails = new int[num_vs]; in prpack_igraph_graph() 34 memset(tails, 0, num_vs * sizeof(tails[0])); in prpack_igraph_graph() 80 for (i = 0; i < num_vs; i++) { in prpack_igraph_graph() 114 for (i = 0, sum = 0; i < num_vs; ++i) { in prpack_igraph_graph()
|
H A D | prpack_csc.h | 15 int num_vs; 23 int64_t num_vs;
|
H A D | prpack_preprocessed_graph.h | 10 int num_vs;
|
/dports/math/R-cran-igraph/igraph/src/prpack/ |
H A D | prpack_base_graph.cpp | 20 num_vs = num_es = 0; in prpack_base_graph() 25 num_vs = g->num_vs; in prpack_base_graph() 31 tails = new int[num_vs]; in prpack_base_graph() 67 num_vs = (int)g->num_vs; in prpack_base_graph() 73 tails = new int[num_vs]; in prpack_base_graph() 113 num_vs = g->num_vs; in prpack_base_graph() 119 tails = new int[num_vs]; in prpack_base_graph() 177 tails = new int[num_vs]; in read_smat() 224 num_vs = al.size(); in read_edges() 226 tails = new int[num_vs]; in read_edges() [all …]
|
H A D | prpack_preprocessed_ge_graph.cpp | 13 fill(d, d + num_vs, 1); in initialize_weighted() 15 for (int i = 0, inum_vs = 0; i < num_vs; ++i, inum_vs += num_vs) { in initialize_weighted() 17 const int end_j = (i + 1 != num_vs) ? bg->tails[i + 1] : bg->num_es; in initialize_weighted() 25 for (int i = 0, inum_vs = 0; i < num_vs; ++i, inum_vs += num_vs) { in initialize_unweighted() 32 for (int j = 0; j < num_vs; ++j) { in initialize_unweighted() 34 for (int inum_vs = 0; inum_vs < num_vs*num_vs; inum_vs += num_vs) in initialize_unweighted() 39 for (int inum_vs = 0; inum_vs < num_vs*num_vs; inum_vs += num_vs) in initialize_unweighted() 49 num_vs = bg->num_vs; in prpack_preprocessed_ge_graph() 51 matrix = new double[num_vs*num_vs]; in prpack_preprocessed_ge_graph() 52 d = new double[num_vs]; in prpack_preprocessed_ge_graph() [all …]
|
H A D | prpack_solver.cpp | 60 return bg->num_vs; in get_num_vs() 244 ret->num_vs = bg->num_vs; in solve() 263 double* A = new double[num_vs*num_vs]; in solve_via_ge() 264 for (int i = 0; i < num_vs*num_vs; ++i) in solve_via_ge() 266 for (int i = 0; i < num_vs*num_vs; i += num_vs + 1) in solve_via_ge() 299 double* A = new double[num_vs*num_vs]; in solve_via_ge_uv() 300 for (int i = 0; i < num_vs*num_vs; ++i) in solve_via_ge_uv() 302 for (int i = 0, inum_vs = 0; i < num_vs; ++i, inum_vs += num_vs) in solve_via_ge_uv() 305 for (int i = 0; i < num_vs*num_vs; i += num_vs + 1) in solve_via_ge_uv() 539 for (int i = num_vs - num_no_out_vs; i < num_vs; ++i) { in solve_via_schur_gs() [all …]
|
H A D | prpack_preprocessed_schur_graph.cpp | 21 d = new double[num_vs]; in initialize_weighted() 22 for (int i = 0; i < num_vs; ++i) in initialize_weighted() 46 num_outlinks = new double[num_vs]; in initialize_unweighted() 47 for (int i = 0; i < num_vs; ++i) in initialize_unweighted() 70 num_vs = bg->num_vs; in prpack_preprocessed_schur_graph() 72 tails = new int[num_vs]; in prpack_preprocessed_schur_graph() 76 vals = new double[num_vs]; in prpack_preprocessed_schur_graph() 77 d = new double[num_vs]; in prpack_preprocessed_schur_graph() 78 fill(d, d + num_vs, 1); in prpack_preprocessed_schur_graph() 88 encoding = new int[num_vs]; in prpack_preprocessed_schur_graph() [all …]
|
H A D | prpack_preprocessed_scc_graph.cpp | 26 d = new double[num_vs]; in initialize_weighted() 27 fill(d, d + num_vs, 1); in initialize_weighted() 60 num_outlinks = new double[num_vs]; in initialize_unweighted() 86 for (int i = 0; i < num_vs; ++i) { in initialize_unweighted() 96 num_vs = bg->num_vs; in prpack_preprocessed_scc_graph() 103 decoding = new int[num_vs]; in prpack_preprocessed_scc_graph() 108 memset(num, -1, num_vs*sizeof(num[0])); in prpack_preprocessed_scc_graph() 109 memset(scc, -1, num_vs*sizeof(scc[0])); in prpack_preprocessed_scc_graph() 163 divisions[i] = cs1[num_vs - 1 - i]; in prpack_preprocessed_scc_graph() 165 for (int i = 0; i < num_vs; ++i) in prpack_preprocessed_scc_graph() [all …]
|
H A D | prpack_preprocessed_gs_graph.cpp | 17 d = new double[num_vs]; in initialize_weighted() 18 fill(d, d + num_vs, 1); in initialize_weighted() 19 for (int tails_i = 0, heads_i = 0; tails_i < num_vs; ++tails_i) { in initialize_weighted() 23 const int end_j = (tails_i + 1 != num_vs) ? bg->tails[tails_i + 1]: bg->num_es; in initialize_weighted() 38 num_outlinks = new double[num_vs]; in initialize_unweighted() 39 fill(num_outlinks, num_outlinks + num_vs, 0); in initialize_unweighted() 40 for (int tails_i = 0, heads_i = 0; tails_i < num_vs; ++tails_i) { in initialize_unweighted() 53 for (int i = 0; i < num_vs; ++i) { in initialize_unweighted() 62 num_vs = bg->num_vs; in prpack_preprocessed_gs_graph() 65 tails = new int[num_vs]; in prpack_preprocessed_gs_graph() [all …]
|
H A D | prpack_solver.h | 34 const int num_vs, 40 const int num_vs, 48 const int num_vs, 61 const int num_vs, 72 const int num_vs, 89 const int num_vs, 106 const int num_vs, 127 const int num_vs, 148 const int num_vs,
|
H A D | prpack_igraph_graph.cpp | 22 num_vs = igraph_vcount(g); in prpack_igraph_graph() 31 tails = new int[num_vs]; in prpack_igraph_graph() 32 memset(tails, 0, num_vs * sizeof(tails[0])); in prpack_igraph_graph() 78 for (i = 0; i < num_vs; i++) { in prpack_igraph_graph() 112 for (i = 0, sum = 0; i < num_vs; ++i) { in prpack_igraph_graph()
|
H A D | prpack_csc.h | 15 int num_vs; 23 int64_t num_vs;
|
/dports/graphics/tgif/tgif-QPL-4.2.5/ |
H A D | arc.c | 806 num_vs++; 808 num_vs += 2; 810 num_vs += 3; 812 num_vs += 4; 814 num_vs += 5; 816 num_vs += 6; 820 num_vs += 6; 838 num_vs++; 966 pv[num_vs].x = cx; 967 pv[num_vs].y = cy; [all …]
|
H A D | spline.c | 178 num_vs++; 181 num_vs++; 191 num_vs++; 194 num_vs++; 322 *pn_N = num_vs; 344 num_vs++; 348 num_vs++; 352 num_vs++; 355 num_vs++; 408 *pn_N = num_vs; [all …]
|
/dports/net/spread4/spread-src-4.2.0/examples/ |
H A D | fl_user.c | 306 int32 *num_vs; in Read_message() local 356 num_vs = (int32 *)&mess[num_bytes]; in Read_message() 377 printf("VS set has %d members:\n", *num_vs ); in Read_message() 378 for( i=0; i < *num_vs; i++, vs_members+= MAX_GROUP_NAME ) in Read_message()
|
/dports/net/spread-j/spread-src-3.17.3/ |
H A D | user.c | 384 int32 *num_vs; in Read_message() local 436 num_vs = (int32 *)&mess[num_bytes]; in Read_message() 454 printf("VS set has %d members:\n", *num_vs ); in Read_message() 455 for( i=0; i < *num_vs; i++, vs_members+= MAX_GROUP_NAME ) in Read_message()
|
/dports/net/spread/spread-src-3.17.4/ |
H A D | user.c | 384 int32 *num_vs; in Read_message() local 436 num_vs = (int32 *)&mess[num_bytes]; in Read_message() 454 printf("VS set has %d members:\n", *num_vs ); in Read_message() 455 for( i=0; i < *num_vs; i++, vs_members+= MAX_GROUP_NAME ) in Read_message()
|
/dports/sysutils/libcpuid/libcpuid-0.5.1/cpuid_tool/ |
H A D | cpuid_tool.c | 208 int i, j, recog, num_vs; in parse_cmdline() local 295 num_vs = 1; in parse_cmdline() 296 while (arg[num_vs] == 'v') in parse_cmdline() 297 num_vs++; in parse_cmdline() 298 if (arg[num_vs] == '\0') { in parse_cmdline() 299 verbose_level += num_vs-1; in parse_cmdline()
|