/dports/math/R-cran-numbers/numbers/man/ |
H A D | divisors.Rd | 1 \name{divisors} 2 \alias{divisors} 7 Generates a list of divisors of an integer number. 10 divisors(n) 13 \item{n}{integer whose divisors will be generated.} 16 The list of all divisors of an integer \code{n} will be calculated 28 divisors(1) # 1 29 divisors(2) # 1 2 30 divisors(2^5) # 1 2 4 8 16 32 31 divisors(1000) # 1 2 4 5 8 10 ... 100 125 200 250 500 1000 [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/glmark2/src/src/libjpeg-turbo/simd/ |
H A D | jquanti-altivec.c | 173 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 174 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 191 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 192 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 193 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 194 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 195 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 196 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 197 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 198 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/graphics/dssim/dssim-3.1.2/cargo-crates/mozjpeg-sys-1.0.1/vendor/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/www/firefox-esr/firefox-91.8.0/media/libjpeg/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/graphics/libjpeg-turbo/libjpeg-turbo-2.1.1/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/graphics/jpeg-turbo/libjpeg-turbo-2.1.1/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/www/firefox/firefox-99.0/media/libjpeg/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/media/libjpeg/simd/ |
H A D | jquanti-altivec.c | 173 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 174 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 191 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 192 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 193 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 194 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 195 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 196 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 197 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 198 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/www/firefox-legacy/firefox-52.8.0esr/media/libjpeg/simd/ |
H A D | jquanti-altivec.c | 173 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 174 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 191 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 192 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 193 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 194 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 195 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 196 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 197 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 198 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/graphics/mozjpeg/mozjpeg-4.0.3/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/benchmarks/glmark2/glmark2-2021.12/src/libjpeg-turbo/simd/ |
H A D | jquanti-altivec.c | 173 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 174 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 191 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 192 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 193 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 194 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 195 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 196 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 197 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 198 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/media/libjpeg/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/media/libjpeg/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/multimedia/opentoonz/opentoonz-1.5.0/thirdparty/libjpeg-turbo/libjpeg-turbo-2.0.6/simd/powerpc/ |
H A D | jquanti-altivec.c | 171 corr0 = vec_ld(DCTSIZE2 * 2, divisors); in jsimd_quantize_altivec() 172 corr1 = vec_ld(DCTSIZE2 * 2 + 16, divisors); in jsimd_quantize_altivec() 189 recip0 = vec_ld(0, divisors); in jsimd_quantize_altivec() 190 recip1 = vec_ld(16, divisors); in jsimd_quantize_altivec() 191 recip2 = vec_ld(32, divisors); in jsimd_quantize_altivec() 192 recip3 = vec_ld(48, divisors); in jsimd_quantize_altivec() 193 recip4 = vec_ld(64, divisors); in jsimd_quantize_altivec() 194 recip5 = vec_ld(80, divisors); in jsimd_quantize_altivec() 195 recip6 = vec_ld(96, divisors); in jsimd_quantize_altivec() 196 recip7 = vec_ld(112, divisors); in jsimd_quantize_altivec() [all …]
|
/dports/games/gcompris-qt/gcompris-qt-2.0/src/activities/gnumch-equality/ |
H A D | Warning.qml | 62 var divisors = [] 65 divisors.push(div) 70 if (divisors.length > 2) { 72 fault += ", " + divisors[div] 76 fault += " " + qsTr("and") + " " + divisors[divisors.length - 1] + "." 86 var divisors = [] 89 divisors.push(div) 92 fault += divisors[0] 94 if (divisors.length > 2) { 96 fault += ", " + divisors[div] [all …]
|
/dports/x11-drivers/xf86-video-intel/xf86-video-intel-31486f40f8e8f8923ca0799aea84b58799754564/test/ |
H A D | dri2-race.c | 145 loop = 256 >> ffs(divisors[n]); in race_window() 168 DRI2SwapBuffers(dpy, win, 0, divisors[n], count & (divisors[n]-1)); in race_window() 233 msc += divisors[n]; in race_window() 293 DRI2SwapBuffers(dpy, win, 0, divisors[n], count & (divisors[n]-1)); in race_resize() 365 msc += divisors[n]; in race_resize() 424 DRI2SwapBuffers(dpy, win, 0, divisors[n], count & (divisors[n]-1)); in race_manager() 493 msc += divisors[n]; in race_manager() 551 DRI2SwapBuffers(dpy, win, 0, divisors[n], count & (divisors[n]-1)); in race_close() 615 msc += divisors[n]; in race_close() 671 DRI2SwapBuffers(dpy, win, 0, divisors[n], count & (divisors[n]-1)); in race_client() [all …]
|
/dports/math/pari/pari-2.13.3/src/functions/number_theoretical/ |
H A D | divisors | 1 Function: divisors 5 Help: divisors(x,{flag=0}): gives a vector formed by the divisors of x in 8 (gen,?0):vec divisors($1) 11 divisors of $x$. The factorization of $x$ (as output by \tet{factor}) can 14 By definition, these divisors are the products of the irreducible 17 an integer, they are the positive divisors, in increasing order. 20 ? divisors(12) 22 ? divisors(12, 1) \\ include their factorization 26 ? divisors(x^4 + 2*x^3 + x^2) \\ also works for polynomials 31 This function requires a lot of memory if $x$ has many divisors. The [all …]
|
/dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/strength_reduce-0.2.3/benches/ |
H A D | strength_reduce_benchmarks.rs | 33 fn compute_single_division(divisors: &[$primitive_type]) -> $primitive_type { 35 for divisor in divisors { 134 let divisors = test::black_box(vec![8; REPETITIONS]); localVariable 135 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); 141 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); 180 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_32bit() 185 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_64bit() 210 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_032bit() 215 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_064bit() 220 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_096bit() [all …]
|
/dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/strength_reduce-0.2.3/benches/ |
H A D | strength_reduce_benchmarks.rs | 33 fn compute_single_division(divisors: &[$primitive_type]) -> $primitive_type { 35 for divisor in divisors { 134 let divisors = test::black_box(vec![8; REPETITIONS]); localVariable 135 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); 141 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); 180 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_32bit() 185 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_64bit() 210 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_032bit() 215 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_064bit() 220 b.iter(|| { test::black_box(compute_single_division(&divisors)); }); in targeted_single_division_096bit() [all …]
|
/dports/math/flint2/flint-2.8.4/fmpq_poly/ |
H A D | integral.c | 38 mp_ptr divisors; in _fmpq_poly_integral() local 52 divisors = TMP_ALLOC(sizeof(ulong) * len); in _fmpq_poly_integral() 70 divisors[k] = 1; in _fmpq_poly_integral() 77 divisors[k] = k; in _fmpq_poly_integral() 82 divisors[k] = k / c; in _fmpq_poly_integral() 85 c = divisors[k]; in _fmpq_poly_integral() 102 if (!fmpz_is_zero(rpoly + k) && v != divisors[k]) in _fmpq_poly_integral() 103 fmpz_mul_ui(rpoly + k, rpoly + k, divisors[k] == 1 ? v : v / divisors[k]); in _fmpq_poly_integral() 114 if (divisors[k] == 1) in _fmpq_poly_integral() 120 fmpz_divexact_ui(u, t, divisors[k]); in _fmpq_poly_integral()
|
/dports/math/pari/pari-2.13.3/src/functions/programming/ |
H A D | fordiv | 6 divisors of n. 8 the formal variable $X$ ranges through the divisors of $n$ 9 (see \tet{divisors}, which is used as a subroutine). It is assumed that 14 This routine uses \kbd{divisors} as a subroutine, then loops over the 15 divisors. In particular, if $n$ is an integer, divisors are sorted by 18 To avoid storing all divisors, possibly using a lot of memory, the following 19 (slower) routine loops over the divisors using essentially constant space: 30 @eprog\noindent Of course, the divisors are no longer sorted by inreasing
|
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/doc/ |
H A D | nmbrthry_functions.tex | 25 functions, e.g., computing all divisors of an integer number. 32 \begin{fcode}{sort_vector < bigint >}{divisors}{rational_factorization & $f$} 33 returns a sorted vector of all positive divisors of the number represented by $f$ (in 38 \begin{fcode}{sort_vector < bigint >}{divisors}{const bigint & $N$} 39 returns a sorted vector of all positive divisors of $N$ (in ascending order). 49 returns a sorted vector of all positive and negative divisors of $N$ (in ascending order). 59 returns a sorted vector of all positive square-free divisors of $N$ (in ascending order). 63 returns a sorted vector of all positive and negative square-free divisors of the number 81 returns a sorted vector of all positive square-free divisors of $N$ (in ascending order). 85 returns a sorted vector of all positive and negative square-free divisors of the number [all …]
|
/dports/math/fxt/fxt/src/mod/ |
H A D | divisors.h | 15 class divisors 27 divisors(const divisors&) = delete; 28 divisors & operator = (const divisors&) = delete; 50 explicit divisors(umod_t x, const umod_t *f=nullptr) 57 explicit divisors(const factorization &F) in divisors() function 60 ~divisors() in ~divisors()
|
/dports/graphics/libjpeg-turbo/libjpeg-turbo-2.1.1/ |
H A D | jcdctmgr.c | 58 DCTELEM *divisors[NUM_QUANT_TBLS]; member 260 if (fdct->divisors[qtblno] == NULL) { in start_pass_fdctmgr() 265 dtbl = fdct->divisors[qtblno]; in start_pass_fdctmgr() 305 dtbl = fdct->divisors[qtblno]; in start_pass_fdctmgr() 422 recip = divisors[i + DCTSIZE2 * 0]; in quantize() 423 corr = divisors[i + DCTSIZE2 * 1]; in quantize() 424 shift = divisors[i + DCTSIZE2 * 3]; in quantize() 445 qval = divisors[i]; in quantize() 497 DCTELEM *divisors = fdct->divisors[compptr->quant_tbl_no]; in forward_DCT() local 565 temp = workspace[i] * divisors[i]; in quantize_float() [all …]
|
/dports/graphics/jpeg-turbo/libjpeg-turbo-2.1.1/ |
H A D | jcdctmgr.c | 58 DCTELEM *divisors[NUM_QUANT_TBLS]; member 260 if (fdct->divisors[qtblno] == NULL) { in start_pass_fdctmgr() 265 dtbl = fdct->divisors[qtblno]; in start_pass_fdctmgr() 305 dtbl = fdct->divisors[qtblno]; in start_pass_fdctmgr() 422 recip = divisors[i + DCTSIZE2 * 0]; in quantize() 423 corr = divisors[i + DCTSIZE2 * 1]; in quantize() 424 shift = divisors[i + DCTSIZE2 * 3]; in quantize() 445 qval = divisors[i]; in quantize() 497 DCTELEM *divisors = fdct->divisors[compptr->quant_tbl_no]; in forward_DCT() local 565 temp = workspace[i] * divisors[i]; in quantize_float() [all …]
|