Home
last modified time | relevance | path

Searched refs:n_arcs (Results 1 – 25 of 53) sorted by relevance

123

/dports/misc/vxl/vxl-3.3.2/contrib/mul/mmn/tests/
H A Dtest_graph_rep1.cxx25 TEST("N.arcs",graph.n_arcs(),n); in test_graph_rep1_a()
28 TEST("No arcs left",graph.n_arcs(),0); in test_graph_rep1_a()
37 TEST("No arcs left",graph.n_arcs(),0); in test_graph_rep1_a()
48 TEST("No arcs left",graph.n_arcs(),0); in test_graph_rep1_a()
70 TEST("N.arcs",graph.n_arcs(),n); in test_graph_rep1_b()
81 TEST("No arcs left",graph.n_arcs(),0); in test_graph_rep1_b()
95 TEST("No arcs left",graph.n_arcs(),0); in test_graph_rep1_b()
/dports/misc/rump/buildrump.sh-b914579/src/usr.bin/tsort/
H A Dtsort.c87 NODE **n_arcs; /* array of arcs to other nodes */ member
224 if (n1->n_arcs[i] == n2) in add_arc()
232 bsize = n1->n_arcsize * sizeof(*n1->n_arcs) * 2; in add_arc()
233 n1->n_arcs = grow_buf(n1->n_arcs, bsize); in add_arc()
234 n1->n_arcsize = bsize / sizeof(*n1->n_arcs); in add_arc()
236 n1->n_arcs[n1->n_narcs++] = n2; in add_arc()
270 n->n_arcs = NULL; in get_node()
373 for (np = n->n_arcs, i = n->n_narcs; --i >= 0; np++) in remove_node()
397 for (np = from->n_arcs, i = from->n_narcs; --i >= 0; np++) { in find_cycle()
/dports/lang/snobol4/snobol4-2.2.2/
H A Dbsdtsort.c97 NODE **n_arcs; /* array of arcs to other nodes */ member
254 if (n1->n_arcs[i] == n2) in add_arc()
262 bsize = n1->n_arcsize * sizeof(*n1->n_arcs) * 2; in add_arc()
263 n1->n_arcs = grow_buf(n1->n_arcs, bsize); in add_arc()
264 n1->n_arcsize = bsize / sizeof(*n1->n_arcs); in add_arc()
266 n1->n_arcs[n1->n_narcs++] = n2; in add_arc()
293 n->n_arcs = NULL; in get_node()
396 for (np = n->n_arcs, i = n->n_narcs; --i >= 0; np++) in remove_node()
419 for (np = from->n_arcs, i = from->n_narcs; --i >= 0; np++) { in find_cycle()
/dports/x11/libX11/libX11-1.7.2/src/
H A DFillArcs.c40 int n_arcs) in XFillArcs() argument
48 while (n_arcs) { in XFillArcs()
52 n = n_arcs; in XFillArcs()
61 n_arcs -= n; in XFillArcs()
H A DDrArcs.c40 int n_arcs) in XDrawArcs() argument
50 len = ((long)n_arcs) * arc_scale; in XDrawArcs()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/extensions/
H A DBNGenerator.h31 gum::BayesNet<double> generate(gum::Size n_nodes=10,gum::Size n_arcs=15,gum::Size n_modmax=4) {
32 if (n_arcs>n_nodes*(n_nodes+1)/2) GUM_ERROR(gum::OperationNotAllowed,"Too many arcs for a BN")
36 gum::MCBayesNetGenerator<double> gen( n_nodes,n_arcs,n_modmax);
/dports/graphics/gmt/gmt-6.3.0/src/
H A Dsphtriangulate.c158 n_arcs = 3 * D->n; in sphtriangulate_delaunay_output()
165 for (kk = 0; kk < n_arcs; ++kk) in sphtriangulate_delaunay_output()
171 for (i = 1, j = 0; i < n_arcs; i++) { in sphtriangulate_delaunay_output()
175 n_arcs = j + 1; in sphtriangulate_delaunay_output()
186 for (i = 0; i < n_arcs; i++) { in sphtriangulate_delaunay_output()
273 arc[n_arcs].begin = vertex_last; arc[n_arcs].end = vertex_new; in sphtriangulate_voronoi_output()
274 n_arcs++; in sphtriangulate_voronoi_output()
275 if (n_arcs == n_alloc) { in sphtriangulate_voronoi_output()
334 for (k = 0; k < n_arcs; ++k) in sphtriangulate_voronoi_output()
344 n_arcs = j + 1; in sphtriangulate_voronoi_output()
[all …]
/dports/math/py-pynndescent/pynndescent-0.5.4/pynndescent/
H A Doptimal_transport.py533 k = graph.n_arcs - arc - 1
563 n_arcs = graph.n_arcs
655 n_arcs = n * m
659 max_arc_num = n_arcs + 2 * n_nodes
692 if i >= n_arcs:
715 n_arcs,
732 n_arcs = graph.n_arcs
765 for i in range(n_arcs):
788 e = n_arcs
854 search_arc_num = graph.n_arcs
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Curved_kernel_via_analysis_2/
H A DNon_x_monotone_arc_2.h274 int n_arcs = arc.number_of_x_monotone_arcs();
278 if(n_arcs > 1)
286 if(n_arcs > 1) {
293 xarc = &arc.x_monotone_arc(n_arcs-1);
/dports/math/cgal/CGAL-5.3/include/CGAL/Algebraic_kernel_d/
H A DStatus_line_CA_1.h92 const Curve_analysis_2& ca, size_type n_arcs) : in Status_line_CA_1_rep() argument
95 _m_total_arcs(n_arcs), _m_vertical_line(false), _m_event(false), in Status_line_CA_1_rep()
97 _m_xy_coords(n_arcs) { in Status_line_CA_1_rep()
262 size_type n_arcs) : in Status_line_CA_1() argument
263 Base(Rep(x, i, ca, n_arcs)) { in Status_line_CA_1()
265 CGAL_precondition(n_arcs >= 0); in Status_line_CA_1()
/dports/databases/py-sqlite3/Python-3.8.12/Parser/pgen/
H A Dgrammar.py125 n_arcs=narcs, dfa_index=dfaindex, state_index=stateindex
135 dfa_index=dfaindex, state_index=stateindex, n_arcs=narcs
/dports/databases/py-gdbm/Python-3.8.12/Parser/pgen/
H A Dgrammar.py125 n_arcs=narcs, dfa_index=dfaindex, state_index=stateindex
135 dfa_index=dfaindex, state_index=stateindex, n_arcs=narcs
/dports/lang/python-tools/Python-3.8.12/Parser/pgen/
H A Dgrammar.py125 n_arcs=narcs, dfa_index=dfaindex, state_index=stateindex
135 dfa_index=dfaindex, state_index=stateindex, n_arcs=narcs
/dports/lang/python38/Python-3.8.12/Parser/pgen/
H A Dgrammar.py125 n_arcs=narcs, dfa_index=dfaindex, state_index=stateindex
135 dfa_index=dfaindex, state_index=stateindex, n_arcs=narcs
/dports/lang/python39/Python-3.9.9/Parser/pgen/
H A Dgrammar.py128 n_arcs=narcs, dfa_index=dfaindex, state_index=stateindex
138 dfa_index=dfaindex, state_index=stateindex, n_arcs=narcs
/dports/x11-toolkits/py-tkinter/Python-3.8.12/Parser/pgen/
H A Dgrammar.py125 n_arcs=narcs, dfa_index=dfaindex, state_index=stateindex
135 dfa_index=dfaindex, state_index=stateindex, n_arcs=narcs
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/
H A Dgcov-dump.c312 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
314 printf (" %u arcs", n_arcs); in tag_arcs()
320 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/
H A Dgcov-dump.c313 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
315 printf (" %u arcs", n_arcs); in tag_arcs()
321 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/
H A Dgcov-dump.c312 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
314 printf (" %u arcs", n_arcs); in tag_arcs()
320 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dgcov-dump.c340 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
342 printf (" %u arcs", n_arcs); in tag_arcs()
348 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dgcov-dump.c340 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
342 printf (" %u arcs", n_arcs); in tag_arcs()
348 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dgcov-dump.c340 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
342 printf (" %u arcs", n_arcs); in tag_arcs()
348 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dgcov-dump.c340 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
342 printf (" %u arcs", n_arcs); in tag_arcs()
348 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dgcov-dump.c340 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
342 printf (" %u arcs", n_arcs); in tag_arcs()
348 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dgcov-dump.c340 unsigned n_arcs = GCOV_TAG_ARCS_NUM (length); in tag_arcs() local
342 printf (" %u arcs", n_arcs); in tag_arcs()
348 for (ix = 0; ix != n_arcs; ix++) in tag_arcs()

123