Home
last modified time | relevance | path

Searched refs:ncurves (Results 1 – 25 of 124) sorted by relevance

12345

/dports/math/eclib/eclib-20210318/tests/
H A Dallisog.cc60 long ncurves = curves.size(); in main() local
63 cout << "\t"; for(j=0; j<ncurves; j++) cout<<(j+1)<<"\t"; cout<<"\n"; in main()
64 for(i=0; i<ncurves; i++) in main()
67 for(j=0; j<ncurves; j++) in main()
68 cout<<m[i*ncurves+j]<<"\t"; in main()
72 cout << "\t"; for(j=0; j<ncurves; j++) cout<<(j+1)<<"\t"; cout<<"\n"; in main()
73 for(i=0; i<ncurves; i++) in main()
76 for(j=0; j<ncurves; j++) in main()
/dports/audio/din/din-52/src/
H A Dcurve_library.cc28 int ncurves; inf >> ignore >> ncurves; in load() local
29 curves.resize (ncurves); in load()
30 for (int i = 0; i < ncurves; ++i) { in load()
80 int ncurves = curves.size (); in prev() local
81 if (--cur < 0) cur = ncurves - 1; in prev()
83 cons << "loaded " << curves[cur].name << " [" << cur + 1 << '/' << ncurves << "]" << eol; in prev()
88 int ncurves = curves.size (); in next() local
89 if (++cur >= ncurves) cur = 0; in next()
91 cons << "loaded " << curves[cur].name << " [" << cur + 1 << '/' << ncurves << "]" << eol; in next()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/ecm/
H A Dfacul.sage108 ncurves=0
111 if "ncurves" in kwargs:
112 ncurves=kwargs["ncurves"]
120 ncurves = ncurves - 1
122 ncurves = ncurves + 1
123 p=proba_cofactor(lpb, ncurves, ntries)
124 # print("\t\t/* %d,%d:%f */" % (lpb, ncurves, p))
125 printed.append("%d:%f" % (ncurves, p))
126 results.append((ncurves, p))
129 print("/* lpb=%d */ %d, /* %s */" % (lpb, ncurves, ", ".join(printed)))
H A Dfinishbatch.cpp58 int ncurves = 50; in main() local
139 param_list_parse_int(pl, "ncurves", &ncurves); in main()
196 …std::list<relation> smooth = factor(List, cpoly, batchlpb, lpb, ncurves, stdout, nb_threads, extra… in main()
H A Dfacul.cpp845 int ncurves[2]; in facul_make_strategies() local
846 ncurves[0] = (n0 > -1) ? n0 : nb_curves_with_fbb (rfbb, rlpb, rmfb); in facul_make_strategies()
847 ncurves[1] = (n1 > -1) ? n1 : nb_curves_with_fbb (afbb, alpb, amfb); in facul_make_strategies()
848 int max_ncurves = ncurves[0] > ncurves[1]? ncurves[0]: ncurves[1]; in facul_make_strategies()
856 …sing default strategy for the cofactorization: ncurves0=%d ncurves1=%d\n", ncurves[0], ncurves[1]); in facul_make_strategies()
865 for (int i = 0; i < ncurves[side] + 3; i++) { in facul_make_strategies()
/dports/math/eclib/eclib-20210318/libsrc/
H A Disogs.cc326 ncurves++; in process()
353 for (ndone=0, ncurves=1; ndone<ncurves; ndone++) in grow()
364 if(ncurves==0) return; in displaycurves()
366 for (i=0; i<ncurves; i++) in displaycurves()
377 if(ncurves==0) return; in displaymat()
381 for(i=0; i<ncurves; i++) in displaymat()
391 os << ncurves << "\n"; in dumpdata()
433 vector<long> ans(ncurves*ncurves); in getmat()
435 for(i=0; i<ncurves; i++) in getmat()
443 mat_i ans(ncurves,ncurves); in getmatrix()
[all …]
/dports/graphics/cairo/cairo-1.17.4/perf/micro/
H A Dmosaic.c36 unsigned ncurves; /* number of boundary curves. */ member
61 unsigned ncurves = iter->region->ncurves; in mosaic_next_path() local
62 if (0 == ncurves) { in mosaic_next_path()
69 for (i=0; i < ncurves; i++, points += 6) { in mosaic_next_path()
90 iter->points = iter->points + 2*(1 + 3*iter->region->ncurves); in mosaic_next_path()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/
H A Dlas-siever-config.hpp81 int ncurves; /* number of cofactorization curves */ member
163 ok = ok && sc.sides[side].ncurves == o.sides[side].ncurves; in operator ()()
170 a.sides[0].lambda, a.sides[0].lpb, a.sides[0].mfb, a.sides[0].ncurves, in operator ()()
171 a.sides[1].lambda, a.sides[1].lpb, a.sides[1].mfb, a.sides[1].ncurves) < in operator ()()
173 b.sides[0].lambda, b.sides[0].lpb, b.sides[0].mfb, b.sides[0].ncurves, in operator ()()
174 b.sides[1].lambda, b.sides[1].lpb, b.sides[1].mfb, b.sides[1].ncurves); in operator ()()
H A Dlas-cofactor.hpp67 conf.sides[0].ncurves, in facul_make_strategies()
68 conf.sides[1].ncurves, in facul_make_strategies()
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/elliptic_curves/ec_rationals/
H A Dec_bigint_test_appl.cc40 long ncurves = 0, nbadN = 0, nbadT = 0; in main_LiDIA() local
44 ncurves++; in main_LiDIA()
45 if ((ncurves%100) == 0) in main_LiDIA()
62 std::cout << ncurves << " curves tested\n"; in main_LiDIA()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/strategies/
H A Dscript_str_r.sh14 ncurves=$5 # say 10
26 $CADO_NFS/sieve/strategies/gst -gst_r -lim0 $lim0 -lpb0 $lpb0 -r0 $r0 -ncurves $ncurves -in $method…
H A Dgst_exec.cpp119 int ncurves = -1; in main() local
127 param_list_parse_int(pl, "ncurves", &ncurves); in main()
373 if (r0 == -1 || lpb0 == -1 || lim0 == 0 || ncurves == -1){ in main()
408 data_pp1, data_ecm, ncurves, in main()
440 lim1 == 0 || lpb1 == -1 || mfb1 == -1 || ncurves){ in main()
463 data_ecm, ncurves, in main()
H A Dgenerate_strategies.cpp262 int ncurves, unsigned long lim, in generate_strategies_oneside() argument
306 int len_strat = 2 + ncurves; in generate_strategies_oneside()
326 0, ncurves, 0, init_tab, in generate_strategies_oneside()
453 tabular_fm_t*ecm, int ncurves, in generate_matrix() argument
505 ecm, ncurves, lim0, lpb0, r0); in generate_matrix()
533 ecm, ncurves, lim1, lpb1, r1); in generate_matrix()
/dports/math/pari/pari-2.13.3/src/basemath/
H A Dcrvwtors.c309 while (ncurves--) in random_curves_with_general_X1()
355 while (ncurves) { in random_curves_with_11_torsion()
388 --ncurves; in random_curves_with_11_torsion()
427 while (ncurves--) { in random_curves_with_2_torsion()
449 while (ncurves--) { in random_curves_with_3_torsion()
468 while (ncurves--) { in random_curves_with_4_torsion()
480 while (ncurves--) { in random_curves_with_5_torsion()
492 while (ncurves--) { in random_curves_with_6_torsion()
552 while (ncurves) { in random_curves_with_10_torsion()
569 --ncurves; in random_curves_with_10_torsion()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/python/examples/pizza/
H A Dgnu.py141 self.figures[self.current-1].ncurves = 1
147 self.figures[self.current-1].ncurves = len(vectors)/2
196 if self.figures[n-1].ncurves: self.draw()
228 fig.ncurves = self.figures[self.current-1].ncurves
325 if not fig.ncurves: return
360 for i in range(int(fig.ncurves)):
374 self.ncurves = 0
/dports/science/lammps/lammps-stable_29Sep2021/tools/python/pizza/
H A Dgnu.py141 self.figures[self.current-1].ncurves = 1
147 self.figures[self.current-1].ncurves = len(vectors)/2
196 if self.figures[n-1].ncurves: self.draw()
228 fig.ncurves = self.figures[self.current-1].ncurves
325 if not fig.ncurves: return
360 for i in range(int(fig.ncurves)):
374 self.ncurves = 0
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/python/examples/pizza/
H A Dgnu.py134 self.figures[self.current-1].ncurves = 1
140 self.figures[self.current-1].ncurves = len(vectors)/2
189 if self.figures[n-1].ncurves: self.draw()
221 fig.ncurves = self.figures[self.current-1].ncurves
318 if not fig.ncurves: return
353 for i in range(fig.ncurves):
367 self.ncurves = 0
/dports/science/sparta/sparta-20Oct2021/tools/pizza/
H A Dgnu.py134 self.figures[self.current-1].ncurves = 1
140 self.figures[self.current-1].ncurves = len(vectors)/2
189 if self.figures[n-1].ncurves: self.draw()
221 fig.ncurves = self.figures[self.current-1].ncurves
318 if not fig.ncurves: return
353 for i in range(fig.ncurves):
367 self.ncurves = 0
/dports/math/p5-Math-Prime-Util-GMP/Math-Prime-Util-GMP-0.52/
H A Decm.h13 extern int _GMP_ecm_factor_affine(mpz_t n, mpz_t f, UV BMax, UV ncurves);
14 extern int _GMP_ecm_factor_projective(mpz_t n, mpz_t f, UV B1, UV B2, UV ncurves);
/dports/math/grace/grace-5.1.25/src/
H A Dfeatext.c203 int i, cs, ns, fts, ncurves, extract_err; in fext_routine() local
223 ncurves = nactive(get_cg()); in fext_routine()
226 for( i=0; i<ncurves; i++ ) in fext_routine()
231 for( i=0; i<ncurves; i++ ){ in fext_routine()
238 if( i != ncurves ) { in fext_routine()
248 if( getsetlength( abs_graph, abs_set ) < ncurves ) { in fext_routine()
253 for( i=0; i<ncurves; i++ ) in fext_routine()
261 if( getsetlength( abs_graph, abs_set ) < ncurves ) { in fext_routine()
266 for( i=0; i<ncurves; i++ ) in fext_routine()
273 for( i=0; i<ncurves; i++ ) { in fext_routine()
/dports/security/libressl/libressl-3.4.3/tests/
H A Dec_point_conversion.c220 size_t ncurves = 0; in test_random_points() local
224 ncurves = EC_get_builtin_curves(NULL, 0); in test_random_points()
225 if ((all_curves = calloc(ncurves, sizeof(EC_builtin_curve))) == NULL) in test_random_points()
227 EC_get_builtin_curves(all_curves, ncurves); in test_random_points()
229 for (curve_id = 0; curve_id < ncurves; curve_id++) in test_random_points()
/dports/www/obhttpd/libressl-3.4.1/tests/
H A Dec_point_conversion.c220 size_t ncurves = 0; in test_random_points() local
224 ncurves = EC_get_builtin_curves(NULL, 0); in test_random_points()
225 if ((all_curves = calloc(ncurves, sizeof(EC_builtin_curve))) == NULL) in test_random_points()
227 EC_get_builtin_curves(all_curves, ncurves); in test_random_points()
229 for (curve_id = 0; curve_id < ncurves; curve_id++) in test_random_points()
/dports/audio/vorbis-tools/vorbis-tools-1.4.2/oggenc/
H A Dlyrics.c233 km->ncurves++; in add_kate_karaoke_tag()
234 km->curves=(kate_curve**)realloc(km->curves,km->ncurves*sizeof(kate_curve*)); in add_kate_karaoke_tag()
235 km->durations=(kate_float*)realloc(km->durations,km->ncurves*sizeof(kate_float)); in add_kate_karaoke_tag()
236 km->curves[km->ncurves-1]=kc; in add_kate_karaoke_tag()
237 km->durations[km->ncurves-1]=dt; in add_kate_karaoke_tag()
465 for (c=0; c<li->km->ncurves; ++c) { in free_lyrics()
/dports/news/inn/inn-2.6.4/nnrpd/
H A Dtls.c444 size_t ncurves, nitems, i; in eckey_from_name() local
453 ncurves = EC_get_builtin_curves(NULL, 0); /* Number of curves. */ in eckey_from_name()
455 builtin_curves = xmalloc(ncurves * sizeof(EC_builtin_curve)); in eckey_from_name()
456 nitems = EC_get_builtin_curves(builtin_curves, ncurves); in eckey_from_name()
457 if (nitems != ncurves) { in eckey_from_name()
459 "expected %lu", (unsigned long) nitems, (unsigned long) ncurves); in eckey_from_name()
/dports/sysutils/shlock/inn-2.6.4/nnrpd/
H A Dtls.c444 size_t ncurves, nitems, i; in eckey_from_name() local
453 ncurves = EC_get_builtin_curves(NULL, 0); /* Number of curves. */ in eckey_from_name()
455 builtin_curves = xmalloc(ncurves * sizeof(EC_builtin_curve)); in eckey_from_name()
456 nitems = EC_get_builtin_curves(builtin_curves, ncurves); in eckey_from_name()
457 if (nitems != ncurves) { in eckey_from_name()
459 "expected %lu", (unsigned long) nitems, (unsigned long) ncurves); in eckey_from_name()

12345