| /dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Modules/Transformation/include/mirtk/ |
| H A D | LinearFreeFormTransformationTD.h | 173 int minsteps = abs(iround((t2 - t1) / _MaxTimeStep)); in LocalTransform() local
175 if (minsteps < 2) minsteps = 2; in LocalTransform()
179 int N = minsteps; in LocalTransform()
|
| /dports/net/ntpsec/ntpsec-NTPsec_1_2_1/ntpfrob/ |
| H A D | precision.c | 78 int minsteps = MINLOOPS; /* need at least this many steps */ in default_get_resolution() local
82 for (i = - --minsteps; i< MAXLOOPS; i++) { in default_get_resolution()
87 if (diff > MINSTEP && minsteps-- <= 0) { in default_get_resolution()
|
| /dports/net/ntp/ntp-4.2.8p15/util/ |
| H A D | precision.c | 71 int minsteps = MINLOOPS; /* need at least this many steps */ in default_get_resolution() local
75 for (i = - --minsteps; i< MAXLOOPS; i++) { in default_get_resolution()
79 if (diff > MINSTEP) if (minsteps-- <= 0) break; in default_get_resolution()
|
| /dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Documentation/commands/ |
| H A D | convert-dof2velo.rst | 61 .. option:: -minsteps <int>
71 Number of integration steps. Sets both :option:`-minsteps` and :option:`-maxsteps`.
|
| /dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Applications/src/ |
| H A D | convert-dof.cc | 415 int minsteps; member
423 minsteps(0), maxsteps(0), in FFDIMParams()
435 if (minsteps <= maxsteps) { in MinNumberOfSteps()
436 n = (minsteps > 0 ? minsteps : (maxsteps > 0 ? maxsteps : 0)); in MinNumberOfSteps()
438 n = (maxsteps > 0 ? maxsteps : (minsteps > 0 ? minsteps : 0)); in MinNumberOfSteps()
446 if (minsteps > maxsteps) { in MaxNumberOfSteps()
447 n = (minsteps > 0 ? minsteps : (maxsteps > 0 ? maxsteps : 0)); in MaxNumberOfSteps()
449 n = (maxsteps > 0 ? maxsteps : (minsteps > 0 ? minsteps : 0)); in MaxNumberOfSteps()
1911 if (ffdim.minsteps > 0) { in WriteMIRTK()
2501 PARSE_ARGUMENT(ffdim.minsteps); in main()
[all …]
|
| /dports/graphics/kdiagram/kdiagram-2.8.0/src/KChart/Cartesian/ |
| H A D | KChartCartesianGrid.h | 48 void setMinimalSteps(int minsteps);
|
| H A D | KChartCartesianGrid.cpp | 48 void CartesianGrid::setMinimalSteps(int minsteps) in setMinimalSteps() argument
50 m_minsteps = minsteps; in setMinimalSteps()
|
| /dports/biology/seaview/seaview/csrc/ |
| H A D | protpars.c | 134 static double like, bestyet, bestlike, minsteps, bstlike2; variable
1184 minsteps = sum; in evaluate()
1185 } else if (sum < minsteps) { in evaluate()
1187 minsteps = sum; in evaluate()
2025 standev(chars, numtrees, minwhich, minsteps, nsteps, fsteps, seed); in maketree()
|
| H A D | dnapars.c | 100 static double like, minsteps, bestyet, bestlike, bstlike2; variable
544 minsteps = sum; in evaluate()
545 } else if (sum < minsteps) { in evaluate()
547 minsteps = sum; in evaluate()
1525 standev(chars, numtrees, minwhich, minsteps, nsteps, fsteps, seed); in maketree()
|
| H A D | seq.c | 3521 void standev(long chars, long numtrees, long minwhich, double minsteps, in standev() argument
3555 (nsteps[which - 1] - minsteps) / 10, sd); in standev()
|
| /dports/math/linbox/linbox-1.6.3/linbox/algorithms/ |
| H A D | rational-reconstruction.h | 1281 size_t minsteps = (size_t)logp(bound, mod)+1; in getRational4() local
1327 size_t endingsteps =minsteps; in getRational4()
1622 size_t minsteps = logp(bound, mod)+1; in getRational5() local
1668 size_t endingsteps =minsteps; in getRational5()
1962 size_t minsteps = logp(bound, mod)+1; in getRational6() local
2008 size_t endingsteps =minsteps; in getRational6()
|
| /dports/graphics/py-altair/altair-4.1.0/altair/vega/v5/schema/ |
| H A D | core.py | 1955 method=Undefined, minsteps=Undefined, signal=Undefined, steps=Undefined, **kwds): argument
1957 maxsteps=maxsteps, method=method, minsteps=minsteps,
2223 minsteps=Undefined, resolve=Undefined, signal=Undefined, steps=Undefined, **kwds): argument
2226 maxsteps=maxsteps, minsteps=minsteps, resolve=resolve,
|
| /dports/graphics/py-altair/altair-4.1.0/altair/vegalite/v4/ |
| H A D | api.py | 900 minsteps=Undefined, argument
952 minsteps=minsteps,
|
| /dports/math/gsl/gsl-2.7/ode-initval2/ |
| H A D | test.c | 2052 const size_t minsteps = ceil (t1 / hmax); in test_driver() local
2080 if (d->n < minsteps) in test_driver()
2083 gsl_odeiv2_step_name (d->s), d->n, minsteps); in test_driver()
|
| /dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/hotint/HotInt_V1/MBSKernelLib/ |
| H A D | timeint.cpp | 764 const int minsteps = 30; in FullAdaptiveStep() local
772 …if (reduce_order || (steps_since_orderchange > minsteps && (steps_per_jac <= 2 || min_newtonits > … in FullAdaptiveStep()
783 min_newtonits <= 6 && (steps_since_orderchange > minsteps)) in FullAdaptiveStep()
797 if (old_stage != act_stage || reduce_order || steps_since_orderchange > 1.5*minsteps) in FullAdaptiveStep()
|
| /dports/graphics/py-altair/altair-4.1.0/altair/vegalite/v4/schema/ |
| H A D | core.py | 18098 extent=Undefined, groupby=Undefined, maxsteps=Undefined, minsteps=Undefined, argument
18102 … maxsteps=maxsteps, minsteps=minsteps, steps=steps, **kwds)
|
| /dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/phylip/src/ |
| H A D | seq.cpp | 3527 void standev(long chars, long numtrees, long minwhich, double minsteps, in standev() argument
3561 (nsteps[which - 1] - minsteps) / 10, sd); in standev()
|