Home
last modified time | relevance | path

Searched refs:VECTOR (Results 1 – 25 of 4582) sorted by relevance

12345678910>>...184

/dports/japanese/groff/groff-1.18.1.1/doc/
H A Dgrnexmpl.g93 VECTOR
145 VECTOR
188 VECTOR
238 VECTOR
246 VECTOR
252 VECTOR
258 VECTOR
264 VECTOR
272 VECTOR
278 VECTOR
[all …]
/dports/textproc/groff/groff-1.22.4/doc/
H A Dgrnexmpl.g93 VECTOR
145 VECTOR
188 VECTOR
238 VECTOR
246 VECTOR
252 VECTOR
258 VECTOR
264 VECTOR
272 VECTOR
278 VECTOR
[all …]
/dports/graphics/megapov/megapov-1.2.1/libraries/tiff/contrib/vms/libtiff/
H A Dtiffvec.mar8 .MACRO VECTOR,NAME
20 VECTOR TIFFCheckTile
21 VECTOR TIFFClose
28 VECTOR TIFFError
29 VECTOR TIFFFdOpen
30 VECTOR TIFFFileName
31 VECTOR TIFFFileno
32 VECTOR TIFFFlush
44 VECTOR TIFFGetMode
52 VECTOR TIFFOpen
[all …]
/dports/graphics/povray36/povray-3.6.1/libraries/tiff/contrib/vms/libtiff/
H A Dtiffvec.mar8 .MACRO VECTOR,NAME
20 VECTOR TIFFCheckTile
21 VECTOR TIFFClose
28 VECTOR TIFFError
29 VECTOR TIFFFdOpen
30 VECTOR TIFFFileName
31 VECTOR TIFFFileno
32 VECTOR TIFFFlush
44 VECTOR TIFFGetMode
52 VECTOR TIFFOpen
[all …]
/dports/math/igraph/igraph-0.9.5/src/properties/
H A Dconstraint.c113 VECTOR(degree)[(long int) from] += VECTOR(*weights)[a]; in igraph_constraint()
114 VECTOR(degree)[(long int) to ] += VECTOR(*weights)[a]; in igraph_constraint()
161 VECTOR(contrib)[j] += 1.0 / VECTOR(degree)[i]; in igraph_constraint()
175 VECTOR(contrib)[j] += 1.0 / VECTOR(degree)[i]; in igraph_constraint()
202 VECTOR(degree)[i] / VECTOR(degree)[j]; in igraph_constraint()
204 VECTOR(contrib)[q] += 1 / VECTOR(degree)[i] / VECTOR(degree)[j]; in igraph_constraint()
220 VECTOR(contrib)[q] += 1 / VECTOR(degree)[i] / VECTOR(degree)[j]; in igraph_constraint()
249 VECTOR(contrib)[q] += 1 / VECTOR(degree)[i] / VECTOR(degree)[j]; in igraph_constraint()
264 VECTOR(contrib)[q] += 1 / VECTOR(degree)[i] / VECTOR(degree)[j]; in igraph_constraint()
279 VECTOR(*res)[a] += VECTOR(contrib)[j] * VECTOR(contrib)[j]; in igraph_constraint()
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/labs/lab3_advanced_molecules/exercises_ref/ex3_multi-slater-jastrow/cisd/convert/
H A Dh2o.cisd.out1270 CASE VECTOR = 1
1275 CASE VECTOR = 2
1280 CASE VECTOR = 3
1285 CASE VECTOR = 4
1290 CASE VECTOR = 5
1296 CASE VECTOR = 6
1301 CASE VECTOR = 7
1311 CASE VECTOR = 8
1317 CASE VECTOR = 9
1323 CASE VECTOR = 10
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/labs/lab3_advanced_molecules/exercises_ref/ex3_multi-slater-jastrow/cisd/gms/
H A Dh2o.cisd.out1270 CASE VECTOR = 1
1275 CASE VECTOR = 2
1280 CASE VECTOR = 3
1285 CASE VECTOR = 4
1290 CASE VECTOR = 5
1296 CASE VECTOR = 6
1301 CASE VECTOR = 7
1311 CASE VECTOR = 8
1317 CASE VECTOR = 9
1323 CASE VECTOR = 10
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/labs/lab3_advanced_molecules/exercises_ref/ex3_multi-slater-jastrow/cisd/thres0.0075/
H A Dh2o.cisd.out1270 CASE VECTOR = 1
1275 CASE VECTOR = 2
1280 CASE VECTOR = 3
1285 CASE VECTOR = 4
1290 CASE VECTOR = 5
1296 CASE VECTOR = 6
1301 CASE VECTOR = 7
1311 CASE VECTOR = 8
1317 CASE VECTOR = 9
1323 CASE VECTOR = 10
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/labs/lab3_advanced_molecules/GAMESS/CI/CISD/
H A DH2O.CISD.out1267 CASE VECTOR = 1
1272 CASE VECTOR = 2
1277 CASE VECTOR = 3
1282 CASE VECTOR = 4
1287 CASE VECTOR = 5
1293 CASE VECTOR = 6
1298 CASE VECTOR = 7
1308 CASE VECTOR = 8
1314 CASE VECTOR = 9
1320 CASE VECTOR = 10
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/labs/lab3_advanced_molecules/exercises/ex3_multi-slater-jastrow/cisd/convert/
H A Dh2o.cisd.out1270 CASE VECTOR = 1
1275 CASE VECTOR = 2
1280 CASE VECTOR = 3
1285 CASE VECTOR = 4
1290 CASE VECTOR = 5
1296 CASE VECTOR = 6
1301 CASE VECTOR = 7
1311 CASE VECTOR = 8
1317 CASE VECTOR = 9
1323 CASE VECTOR = 10
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/labs/lab3_advanced_molecules/exercises/ex3_multi-slater-jastrow/cisd/gms/
H A Dh2o.cisd.out1270 CASE VECTOR = 1
1275 CASE VECTOR = 2
1280 CASE VECTOR = 3
1285 CASE VECTOR = 4
1290 CASE VECTOR = 5
1296 CASE VECTOR = 6
1301 CASE VECTOR = 7
1311 CASE VECTOR = 8
1317 CASE VECTOR = 9
1323 CASE VECTOR = 10
[all …]
/dports/science/qmcpack/qmcpack-3.11.0/labs/lab3_advanced_molecules/REFERENCE/GAMESS/CI/CISD/
H A DH2O.CISD.out1267 CASE VECTOR = 1
1272 CASE VECTOR = 2
1277 CASE VECTOR = 3
1282 CASE VECTOR = 4
1287 CASE VECTOR = 5
1293 CASE VECTOR = 6
1298 CASE VECTOR = 7
1308 CASE VECTOR = 8
1314 CASE VECTOR = 9
1320 CASE VECTOR = 10
[all …]
/dports/graphics/povray37/povray-3.7.0.10/source/backend/shape/
H A Dbezier.h72 VECTOR Vertices[4];
88 VECTOR Control_Points[4][4];
90 VECTOR Bounding_Sphere_Center;
115 static void bezier_value(const VECTOR(*Control_Points)[4][4], DBL u0, DBL v0, VECTOR P, VECTOR N);
116 …bool intersect_subpatch(const Ray&, const VECTOR [3], const DBL [3], const DBL [3], DBL *, VECTOR,…
117 static void find_average(int, const VECTOR *, VECTOR, DBL *);
120 static DBL point_plane_distance(const VECTOR, const VECTOR, DBL);
123 static void bezier_bounding_sphere(const VECTOR(*)[4][4], VECTOR, DBL *);
125 static void bezier_split_left_right(const VECTOR(*)[4][4], VECTOR(*)[4][4], VECTOR(*)[4][4]);
126 static void bezier_split_up_down(const VECTOR(*)[4][4], VECTOR(*)[4][4], VECTOR(*)[4][4]);
[all …]
/dports/math/igraph/igraph-0.9.5/src/operators/
H A Dintersection.c145 VECTOR(no_edges)[i] = igraph_ecount(VECTOR(*graphs)[i]); in igraph_intersection_many()
152 if (!VECTOR(*edgemaps)[i]) { in igraph_intersection_many()
171 if (! VECTOR(edge_vects)[i] || ! VECTOR(order_vects)[i]) { in igraph_intersection_many()
182 long int k, j, n = VECTOR(no_edges)[i]; in igraph_intersection_many()
188 if (VECTOR(*edges)[j] > VECTOR(*edges)[j + 1]) { in igraph_intersection_many()
190 VECTOR(*edges)[j] = VECTOR(*edges)[j + 1]; in igraph_intersection_many()
191 VECTOR(*edges)[j + 1] = tmp; in igraph_intersection_many()
196 VECTOR(*order)[k] = k; in igraph_intersection_many()
198 igraph_qsort_r(VECTOR(*order), n, sizeof(VECTOR(*order)[0]), edges, in igraph_intersection_many()
228 from = VECTOR(*ev)[2 * edge]; in igraph_intersection_many()
[all …]
H A Dunion.c145 VECTOR(no_edges)[i] = igraph_ecount(VECTOR(*graphs)[i]); in igraph_union_many()
151 if (!VECTOR(*edgemaps)[i]) { in igraph_union_many()
169 if (! VECTOR(edge_vects)[i] || ! VECTOR(order_vects)[i]) { in igraph_union_many()
180 long int k, j, n = VECTOR(no_edges)[i]; in igraph_union_many()
186 if (VECTOR(*edges)[j] > VECTOR(*edges)[j + 1]) { in igraph_union_many()
187 long int tmp = VECTOR(*edges)[j]; in igraph_union_many()
188 VECTOR(*edges)[j] = VECTOR(*edges)[j + 1]; in igraph_union_many()
189 VECTOR(*edges)[j + 1] = tmp; in igraph_union_many()
194 VECTOR(*order)[k] = k; in igraph_union_many()
196 igraph_qsort_r(VECTOR(*order), n, sizeof(VECTOR(*order)[0]), edges, in igraph_union_many()
[all …]
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dleiden.c94 VECTOR(cluster_weights)[c] += VECTOR(*node_weights)[i]; in igraph_i_community_leiden_fastmovenodes()
125 VECTOR(cluster_weights)[current_cluster] -= VECTOR(*node_weights)[v]; in igraph_i_community_leiden_fastmovenodes()
149 VECTOR(edge_weights_per_cluster)[c] += VECTOR(*edge_weights)[e]; in igraph_i_community_leiden_fastmovenodes()
158 …diff = VECTOR(edge_weights_per_cluster)[c] - VECTOR(*node_weights)[v] * VECTOR(cluster_weights)[c]… in igraph_i_community_leiden_fastmovenodes()
168 VECTOR(cluster_weights)[best_cluster] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_fastmovenodes()
250 VECTOR(*refined_membership)[v] = VECTOR(new_cluster)[c] - 1; in igraph_i_community_leiden_clean_refined_membership()
327 VECTOR(cluster_weights)[i] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_mergenodes()
440 VECTOR(cluster_weights)[chosen_cluster] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_mergenodes()
596 VECTOR(*aggregated_node_weights)[c] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_aggregate()
614 VECTOR(*aggregated_membership)[c] = VECTOR(*membership)[v]; in igraph_i_community_leiden_aggregate()
[all …]
/dports/math/R-cran-igraph/igraph/src/
H A Dcommunity_leiden.c91 VECTOR(cluster_weights)[c] += VECTOR(*node_weights)[i]; in igraph_i_community_leiden_fastmovenodes()
122 VECTOR(cluster_weights)[current_cluster] -= VECTOR(*node_weights)[v]; in igraph_i_community_leiden_fastmovenodes()
146 VECTOR(edge_weights_per_cluster)[c] += VECTOR(*edge_weights)[e]; in igraph_i_community_leiden_fastmovenodes()
155 …diff = VECTOR(edge_weights_per_cluster)[c] - VECTOR(*node_weights)[v] * VECTOR(cluster_weights)[c]… in igraph_i_community_leiden_fastmovenodes()
165 VECTOR(cluster_weights)[best_cluster] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_fastmovenodes()
247 VECTOR(*refined_membership)[v] = VECTOR(new_cluster)[c] - 1; in igraph_i_community_leiden_clean_refined_membership()
324 VECTOR(cluster_weights)[i] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_mergenodes()
437 VECTOR(cluster_weights)[chosen_cluster] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_mergenodes()
593 VECTOR(*aggregated_node_weights)[c] += VECTOR(*node_weights)[v]; in igraph_i_community_leiden_aggregate()
611 VECTOR(*aggregated_membership)[c] = VECTOR(*membership)[v]; in igraph_i_community_leiden_aggregate()
[all …]
H A Dmatching.c131 if (VECTOR(*types)[i] == VECTOR(*types)[j]) { in igraph_is_matching()
192 if (VECTOR(*matching)[(long int)VECTOR(neis)[j]] == -1) { in igraph_is_maximal_matching()
194 VECTOR(*types)[i] != VECTOR(*types)[(long int)VECTOR(neis)[j]]) { in igraph_is_maximal_matching()
373 if (VECTOR(*types)[k] == VECTOR(*types)[i]) { in igraph_i_maximum_bipartite_matching_unweighted()
419 if (VECTOR(labels)[(long int)VECTOR(neis)[i]] < label_u) { in igraph_i_maximum_bipartite_matching_unweighted()
440 VECTOR(match)[u] = v; VECTOR(match)[v] = u; /* Line 11 */ in igraph_i_maximum_bipartite_matching_unweighted()
504 VECTOR(*labels)[w] = VECTOR(*labels)[v] + 1; in igraph_i_maximum_bipartite_matching_unweighted_relabel()
508 VECTOR(*labels)[matched_to] = VECTOR(*labels)[w] + 1; in igraph_i_maximum_bipartite_matching_unweighted_relabel()
630 if (VECTOR(*types)[u] == VECTOR(*types)[i]) { in igraph_i_maximum_bipartite_matching_weighted()
648 VECTOR(slack)[i] = VECTOR(labels)[u] + VECTOR(labels)[v] - VECTOR(*weights)[i]; in igraph_i_maximum_bipartite_matching_weighted()
[all …]
H A Dspmatrix.c160 if (VECTOR(m->ridx)[start] != row && VECTOR(m->ridx)[end] == row) { in igraph_spmatrix_e()
411 VECTOR(m->ridx)[j] = VECTOR(m->ridx)[ei]; in igraph_spmatrix_resize()
412 VECTOR(m->data)[j] = VECTOR(m->data)[ei]; in igraph_spmatrix_resize()
425 VECTOR(m->cidx)[i] = VECTOR(m->cidx)[m->ncol]; in igraph_spmatrix_resize()
677 n = (long)VECTOR(m->cidx)[col + 1] - (long)VECTOR(m->cidx)[col]; in igraph_spmatrix_clear_col()
722 VECTOR(*res)[c] += VECTOR(m->data)[i]; in igraph_spmatrix_colsums()
746 VECTOR(*res)[(long int)VECTOR(m->ridx)[i]] += VECTOR(m->data)[i]; in igraph_spmatrix_rowsums()
790 while (VECTOR(m->cidx)[i + 1] == VECTOR(m->cidx)[i]) { in igraph_spmatrix_max_nonzero()
842 if (VECTOR(m->cidx)[i + 1] - VECTOR(m->cidx)[i] < m->nrow) { in igraph_spmatrix_max()
867 n = (long int) (VECTOR(m->cidx)[col + 1] - VECTOR(m->cidx)[col]); in igraph_i_spmatrix_get_col_nonzero_indices()
[all …]
H A Doperators.c275 if (VECTOR(edges1)[j] > VECTOR(edges1)[j + 1]) { in igraph_i_merge()
277 VECTOR(edges1)[j] = VECTOR(edges1)[j + 1]; in igraph_i_merge()
282 if (VECTOR(edges2)[j] > VECTOR(edges2)[j + 1]) { in igraph_i_merge()
284 VECTOR(edges2)[j] = VECTOR(edges2)[j + 1]; in igraph_i_merge()
539 VECTOR(no_edges)[i] = igraph_ecount(VECTOR(*graphs)[i]); in igraph_intersection_many()
565 if (! VECTOR(edge_vects)[i] || ! VECTOR(order_vects)[i]) { in igraph_intersection_many()
582 if (VECTOR(*edges)[j] > VECTOR(*edges)[j + 1]) { in igraph_intersection_many()
584 VECTOR(*edges)[j] = VECTOR(*edges)[j + 1]; in igraph_intersection_many()
802 VECTOR(no_edges)[i] = igraph_ecount(VECTOR(*graphs)[i]); in igraph_union_many()
843 if (VECTOR(*edges)[j] > VECTOR(*edges)[j + 1]) { in igraph_union_many()
[all …]
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dmatching.c132 if (VECTOR(*types)[i] == VECTOR(*types)[j]) { in igraph_is_matching()
193 if (VECTOR(*matching)[(long int)VECTOR(neis)[j]] == -1) { in igraph_is_maximal_matching()
195 VECTOR(*types)[i] != VECTOR(*types)[(long int)VECTOR(neis)[j]]) { in igraph_is_maximal_matching()
374 if (VECTOR(*types)[k] == VECTOR(*types)[i]) { in igraph_i_maximum_bipartite_matching_unweighted()
420 if (VECTOR(labels)[(long int)VECTOR(neis)[i]] < label_u) { in igraph_i_maximum_bipartite_matching_unweighted()
441 VECTOR(match)[u] = v; VECTOR(match)[v] = u; /* Line 11 */ in igraph_i_maximum_bipartite_matching_unweighted()
505 VECTOR(*labels)[w] = VECTOR(*labels)[v] + 1; in igraph_i_maximum_bipartite_matching_unweighted_relabel()
509 VECTOR(*labels)[matched_to] = VECTOR(*labels)[w] + 1; in igraph_i_maximum_bipartite_matching_unweighted_relabel()
632 if (VECTOR(*types)[u] == VECTOR(*types)[i]) { in igraph_i_maximum_bipartite_matching_weighted()
650 VECTOR(slack)[i] = VECTOR(labels)[u] + VECTOR(labels)[v] - VECTOR(*weights)[i]; in igraph_i_maximum_bipartite_matching_weighted()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/gfx/skia/skia/src/sksl/
H A DSkSLByteCode.h42 VECTOR(kAddI), enumerator
72 VECTOR(kCos), enumerator
74 VECTOR(kDivideS), enumerator
75 VECTOR(kDivideU), enumerator
83 VECTOR(kLoad), enumerator
103 VECTOR(kNegateI), enumerator
129 VECTOR(kSin), enumerator
130 VECTOR(kSqrt), enumerator
132 VECTOR(kStore), enumerator
152 VECTOR(kTan), enumerator
[all …]
/dports/www/firefox/firefox-99.0/gfx/skia/skia/src/sksl/
H A DSkSLByteCode.h42 VECTOR(kAddI), enumerator
72 VECTOR(kCos), enumerator
74 VECTOR(kDivideS), enumerator
75 VECTOR(kDivideU), enumerator
83 VECTOR(kLoad), enumerator
103 VECTOR(kNegateI), enumerator
129 VECTOR(kSin), enumerator
130 VECTOR(kSqrt), enumerator
132 VECTOR(kStore), enumerator
152 VECTOR(kTan), enumerator
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/skia/skia/src/sksl/
H A DSkSLByteCode.h42 VECTOR(kAddI), enumerator
72 VECTOR(kCos), enumerator
74 VECTOR(kDivideS), enumerator
75 VECTOR(kDivideU), enumerator
83 VECTOR(kLoad), enumerator
103 VECTOR(kNegateI), enumerator
129 VECTOR(kSin), enumerator
130 VECTOR(kSqrt), enumerator
132 VECTOR(kStore), enumerator
152 VECTOR(kTan), enumerator
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/skia/skia/src/sksl/
H A DSkSLByteCode.h42 VECTOR(kAddI), enumerator
72 VECTOR(kCos), enumerator
74 VECTOR(kDivideS), enumerator
75 VECTOR(kDivideU), enumerator
83 VECTOR(kLoad), enumerator
103 VECTOR(kNegateI), enumerator
129 VECTOR(kSin), enumerator
130 VECTOR(kSqrt), enumerator
132 VECTOR(kStore), enumerator
152 VECTOR(kTan), enumerator
[all …]

12345678910>>...184