Home
last modified time | relevance | path

Searched +refs:factor +refs:if +refs:small (Results 1 – 25 of 18030) sorted by relevance

12345678910>>...722

/dports/lang/nickle/nickle-2.90/examples/
H A Dis-prime.5c22 * 6. let q be the largest prime factor of r - 1;
40 /* Returns the largest factor of n, computed
43 int factor = 1;
46 factor = i;
47 n /= factor;
50 return factor;
79 global int small = 50;
80 if (n >= small)
83 bool[small] sieve = {true ...};
85 while (k < small) {
[all …]
/dports/science/gnudatalanguage/gdl-1.0.1/testsuite/
H A Dtest_read_jpeg.pro7 ; -- reading back a small (600x259) JPEG image
11 pro TEST_READ_JPEG, filename=filename, path=path, factor=factor, $
14 if KEYWORD_SET(help) then begin
15 print, 'pro TEST_READ_JPEG, filename=filename, path=path, factor=factor, $'
26 if N_ELEMENTS(factor) EQ 0 then factor=1
68 if (vertical EQ -1) then begin
69 MESSAGE, /continue, 'Soo small screen/too big image ! automatic rescaling !!'
80 xy_win1=xy_img/factor
83 xy_win0=xy_img/factor
91 ; just a trick to be able to test for small screens
[all …]
/dports/math/R-cran-DoE.base/DoE.base/man/
H A DcorrPlot.Rd15 pal = NULL, col.grid = "black", col.small = "grey", lwd.grid = 1.5, lwd.small = 0.5,
49 logical; if FALSE (default), only two-factor interactions are included,
75 \item{col.small}{
76 color of the small grid lines
81 \item{lwd.small}{
82 with of the small grid lines
87 \item{lty.small}{
88 line type of the small grid lines
131 (and, if \code{main.only=FALSE}, also the two-factor interactions), the horizontal axis
132 shows the two-factor interactions (and, if \code{three=TRUE}, also the three-factor
[all …]
/dports/lang/racket/racket-8.3/share/pkgs/drracket/drracket/private/
H A Dstick-figures.rkt9 (define small-bitmap-factor 1/2)
10 (define small-factor 1/5)
108 (let* ([running-w (* small-factor (- max-rx min-rx))]
109 [waiting-w (* small-factor (- max-wx min-wx))]
110 [running-h (* small-factor (- max-ry min-ry))]
126 [w (ceiling (* bw small-bitmap-factor))]
127 [h (ceiling (* bh small-bitmap-factor))]
135 (draw-callback bdc-big small-factor #f points
141 (send bdc-small set-scale small-bitmap-factor small-bitmap-factor)
259 (if (eq? (car x) clicked-point)
[all …]
/dports/math/yacas/yacas-1.9.1/scripts/factors.rep/
H A Dcode.ys13 Local(small'powers);
19 …small'powers := TrialFactorize(n, 257), // value is {n1, {p1,q1}, {p2,q2}, ...} and n1=1 if comple…
20 small'powers := {n} // pretend we had run TrialFactorize without success
22 n := small'powers[1]; // remainder
23 If(n=1, Tail(small'powers),
24 // if n!=1, need to factorize the remainder with Pollard Rho algorithm
28 PollardCombineLists(Tail(small'powers), PollardRhoFactorize(n))
73 factor := factor^2;
77 factor := old'factor;
139 * "Modern Computer Algebra" reasons that if f(x) = (x^2+1) mod n for
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/mrvlimit/
H A Dmrvlimit.red137 off mcd; on factor;
335 on factor; off mcd;
343 off factor;
360 small:=e^(-x);
362 % if lim is infinity, need to set w to 1/small
363 rule1:={small => ww };
376 h:=log(small);
382 small:=small^-1;
383 if lisp(!*tracelimit) then write "small has been changed to ", small;
386 rule1 := { small => ww, 1/small => ww^-1 };
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/doc/src/
H A Dbox.rst18 *tilt* value = *small* or *large*
26 box tilt small
40 LAMMPS normally requires that no tilt factor can skew the box more
42 dimension in the tilt factor (x for xz). If *tilt* is set to
43 *small*, which is the default, then an error will be
44 generated if a box is created which exceeds this limit. If *tilt*
48 Note that if a simulation box has a large tilt factor, LAMMPS will run
70 The default value is tilt = small.
/dports/math/R-cran-psych/psych/man/
H A Dfactor.fit.Rd1 \name{factor.fit}
2 \alias{factor.fit}
3 \title{ How well does the factor model fit a correlation matrix. Part of the VSS package }
4 …ion{The basic factor or principal components model is that a correlation or covariance matrix may …
7 factor.fit(r, f)
12 \item{f}{A factor matrix of loadings.}
14 …factor model. Note that it is sensitive to the size of the original correlations. That is, if th…
27 round(factor.fit(Harman74.cor$cov,fa4$loading),2)
30 round(factor.fit(Harman74.cor$cov,fa3$loading),2)
/dports/graphics/krita/krita-4.4.8/3rdparty/ext_qt/
H A D0032-Update-Dpi-and-scale-factor-computation.patch79 + qreal factor;
89 + return factor;
161 + // Rounding down is then preferable since "small UI" is a more acceptable
198 + // Round up for .75 and higher. This favors "small UI" over "large UI".
220 + // rounded scale factor and the actual scale factor. The effect
224 + // since the adjustment is small (typically +/- 48 max) this might be OK.
260 // Determine if there is a global scale factor set.
281 qreal factor = qreal(1.0);
308 - if (!screen)
473 - // small fonts on a High DPI monitor, resulting in lower logical DPI.
[all …]
/dports/games/el/Eternal-Lands-1.9.5.9-1/map_editor/
H A Dmapedit.ini28 This setting provides you with a small X on the map where you're currently located
32 This setting decides if you should show the grid as default or not.
35 This setting decides if you should show the tooltips as default or not.
43 Turn on only if you actually need them for some reason.
46 Global scale factor for user interface elements. The default factor is 1. Use a higher scale
47 factor if you have a HiDPI screen and find the buttons or text are too small
/dports/math/e-antic/flint2-ae7ec89/doc/source/
H A Dnmod_poly_factor.rst1 .. _nmod-poly-factor:
34 Reallocates the factor structure to provide space for
39 Ensures that the factor structure has space for at
54 Inserts the factor ``poly`` with multiplicity ``exp`` into
110 irreducible factors of degree ``d``. If it passes, a factor is
111 placed in factor and 1 is returned, otherwise 0 is returned and
112 the value of factor is undetermined.
162 This function first checks for small special cases, deflates ``f``
173 This function first checks for small special cases, deflates ``f``
184 This function first checks for small special cases, deflates ``f``
[all …]
H A Dfq_poly_factor.rst1 .. _fq-poly-factor:
34 Reallocates the factor structure to provide space for
39 Ensures that the factor structure has space for at least
63 Inserts the factor ``poly`` with multiplicity ``exp`` into
127 the value of factor is undetermined.
141 linear factor of ``input`` and places it in ``linfactor``.
189 of ``f``, or 0 if ``f`` is the zero polynomial.
191 This function first checks for small special cases, deflates
200 of ``f``, or 0 if ``f`` is the zero polynomial.
202 This function first checks for small special cases, deflates
[all …]
H A Dfq_nmod_poly_factor.rst1 .. _fq-nmod-poly-factor:
34 Reallocates the factor structure to provide space for
39 Ensures that the factor structure has space for at least
63 Inserts the factor ``poly`` with multiplicity ``exp`` into
127 the value of factor is undetermined.
141 linear factor of ``input`` and places it in ``linfactor``.
189 of ``f``, or 0 if ``f`` is the zero polynomial.
191 This function first checks for small special cases, deflates
200 of ``f``, or 0 if ``f`` is the zero polynomial.
202 This function first checks for small special cases, deflates
[all …]
H A Dfq_zech_poly_factor.rst1 .. _fq-zech-poly-factor:
34 Reallocates the factor structure to provide space for
39 Ensures that the factor structure has space for at least
63 Inserts the factor ``poly`` with multiplicity ``exp`` into
127 the value of factor is undetermined.
141 linear factor of ``input`` and places it in ``linfactor``.
189 of ``f``, or 0 if ``f`` is the zero polynomial.
191 This function first checks for small special cases, deflates
200 of ``f``, or 0 if ``f`` is the zero polynomial.
202 This function first checks for small special cases, deflates
[all …]
/dports/math/flint2/flint-2.8.4/doc/source/
H A Dnmod_poly_factor.rst1 .. _nmod-poly-factor:
34 Reallocates the factor structure to provide space for
39 Ensures that the factor structure has space for at
54 Inserts the factor ``poly`` with multiplicity ``exp`` into
110 irreducible factors of degree ``d``. If it passes, a factor is
111 placed in factor and 1 is returned, otherwise 0 is returned and
112 the value of factor is undetermined.
162 This function first checks for small special cases, deflates ``f``
173 This function first checks for small special cases, deflates ``f``
184 This function first checks for small special cases, deflates ``f``
[all …]
H A Dfq_nmod_poly_factor.rst1 .. _fq-nmod-poly-factor:
34 Reallocates the factor structure to provide space for
39 Ensures that the factor structure has space for at least
63 Inserts the factor ``poly`` with multiplicity ``exp`` into
127 the value of factor is undetermined.
141 linear factor of ``input`` and places it in ``linfactor``.
189 of ``f``, or 0 if ``f`` is the zero polynomial.
191 This function first checks for small special cases, deflates
200 of ``f``, or 0 if ``f`` is the zero polynomial.
202 This function first checks for small special cases, deflates
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/doc/source/
H A Dnmod_poly_factor.rst1 .. _nmod-poly-factor:
34 Reallocates the factor structure to provide space for
39 Ensures that the factor structure has space for at
54 Inserts the factor ``poly`` with multiplicity ``exp`` into
110 irreducible factors of degree ``d``. If it passes, a factor is
111 placed in factor and 1 is returned, otherwise 0 is returned and
112 the value of factor is undetermined.
162 This function first checks for small special cases, deflates ``f``
173 This function first checks for small special cases, deflates ``f``
184 This function first checks for small special cases, deflates ``f``
[all …]
/dports/math/R/R-4.1.2/src/library/base/man/
H A Dfactor.Rd51 \item{x}{a vector of data, usually taking a small number of distinct
71 \item{ifany}{only add an \code{NA} level if it is used, i.e.
72 if \code{any(is.na(x))}.}
97 \code{as.ordered(x)} returns \code{x} if this is ordered, and
104 currently only \code{levels(object)}, and returns \code{TRUE} if it is
155 Since factors typically have quite a small number of levels, for large
160 ordered) factor with other objects, if all objects are (possibly
163 level sets of the elements (which means that if all the elements have
204 Collation is done by the levels of the operands: if both operands are
209 space efficient if there is even a small proportion of
[all …]
/dports/math/libRmath/R-4.1.1/src/library/base/man/
H A Dfactor.Rd51 \item{x}{a vector of data, usually taking a small number of distinct
71 \item{ifany}{only add an \code{NA} level if it is used, i.e.
72 if \code{any(is.na(x))}.}
97 \code{as.ordered(x)} returns \code{x} if this is ordered, and
104 currently only \code{levels(object)}, and returns \code{TRUE} if it is
155 Since factors typically have quite a small number of levels, for large
160 ordered) factor with other objects, if all objects are (possibly
163 level sets of the elements (which means that if all the elements have
204 Collation is done by the levels of the operands: if both operands are
209 space efficient if there is even a small proportion of
[all …]
/dports/math/p5-Math-Pari/pari-2.3.5/src/functions/number_theoretical/
H A Dfactor1 Function: factor
5 Help: factor(x,{lim}): factorization of x. lim is optional and can be set
7 partial factorization, using primes up to lim (up to primelimit if lim=0)
10 (gen, ?-1):gen factor($1)
12 (gen, small):gen factor0($1, $2)
/dports/finance/odoo/odoo-19d77c2a03335eb95a686bd69a1b56b38e87d609/odoo/addons/web_editor/static/src/scss/
H A Dweb_editor.common.scss23 @if not color('o-cc#{$index}-text') {
26 @if not color('o-cc#{$index}-headings') {
29 @if not color('o-cc#{$index}-h2') {
32 @if not color('o-cc#{$index}-h3') {
35 @if not color('o-cc#{$index}-h4') {
38 @if not color('o-cc#{$index}-h5') {
41 @if not color('o-cc#{$index}-h6') {
50 @if not $-btn-primary {
58 @if not $-btn-secondary {
164 img.padding-small, .img.padding-small, span.fa.padding-small, iframe.padding-small {
[all …]
/dports/multimedia/mjpegtools/mjpegtools-2.1.0/mpeg2enc/
H A DNOTES34 Where d is a very small correction factor. We now observe that since
36 whether the rounding factor generates a "carry" so it doesn't need to
45 term (K%d)[K/d]x + d which for large K and small d will fit into a
48 We can compute it "exactly" adding a small fixed round up d (32
52 0 <= K%d < d. We also know the factor gets very small for larger d.
53 Thus we really only need a correction that "works" for small d.
87 Experiments have revealed that if you're compressing on the margins of
88 acceptable quality you do *far* better if you squeeze the higher
90 simply allow the encoder to jack up the global quantisation factor.
102 However, if you go below the sampling resolution you *will* miss
/dports/math/pari/pari-2.13.3/src/functions/number_theoretical/
H A Dfactor1 Function: factor
10 (int,small):vec Z_factor_limit($1, $2)
14 Doc: factor $x$ over domain $D$; if $D$ is omitted, it is determined from $x$.
15 For instance, if $x$ is an integer, it is factored in $\Z$, if it is a
77 guarantee that all small prime factors are found, but it also finds larger
96 ? factorint(F, 1+8) \\ much faster and all small primes were found
127 not proven primes; a rational factor is prime if less than $2^{64}$ and an
128 irrational one if its norm is less than $2^{64}$.
202 $p$-adic accuracy \kbd{padicprec}$(D)$, possibly less if $x$ is inexact
229 \typ{INTMOD}s and \typ{POLMOD}s (e.g.~if a coefficient in $\Z/n\Z$ is known,
[all …]
/dports/math/fricas/fricas-1.3.7/src/algebra/
H A Dgalfact.spad174 if degree(factor)=(d::N) then return factor
608 if (p.exponent = 1) and (not zero? (lc rem p.factor)) and
647 small =>
670 do_ddfact(pol : UP, p : Integer, small : Boolean) : DDres ==
672 small =>
710 small : Boolean := true
712 if small and not(degp*cprime*cprime < 18446744073709551616) then
713 small := false
717 (not is_mod_coprime?(p, diffp, cprime, small)) repeat
719 dd_res1 := do_ddfact(p, cprime, small)
[all …]
/dports/devel/p5-Perl-Tidy/Perl-Tidy-20211029/t/
H A Dsnippets5.t183 $c->small("(ie, where to find it)"),
200 $c->br(), $c->small("Maximum 750 letters.")
299 my$factor=exp(-(18/$u)**4);
300 my$ovp=(1-$factor)*(70-0.655515*$u)+(1000/($u**1.3)+10000/($u**3.3))*$factor;
301 my$impulse=(1-$factor)*(170-$u)+(350/$u**0.65+500/$u**5)*$factor;
492 $c->small("(ie, where to find it)"),
510 $c->small("Maximum 750 letters.")
653 $c->small("(ie, where to find it)"),
858 my $factor = exp( -( 18 / $u )**4 );
859 my $ovp = ( 1 - $factor ) * ( 70 - 0.655515 * $u ) +
[all …]

12345678910>>...722