/development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
WindowSurface.java | 102 void init(int width, int height, float minStep) { 105 dx = (float)(Math.random()*minStep*2) + 1; 106 dy = (float)(Math.random()*minStep*2) + 1; 109 float adjDelta(float cur, float minStep, float maxStep) { 110 cur += (Math.random()*minStep) - (minStep/2); 111 if (cur < 0 && cur > -minStep) cur = -minStep; 112 if (cur >= 0 && cur < minStep) cur = minStep; [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
AdaptiveStepsizeIntegrator.java | 87 private final double minStep; 95 * @param minStep minimal step (must be positive even for backward 103 final double minStep, final double maxStep, 109 this.minStep = FastMath.abs(minStep); 125 * @param minStep minimal step (must be positive even for backward 133 final double minStep, final double maxStep, 139 this.minStep = minStep; 164 if ((initialStepSize < minStep) || (initialStepSize > maxStep)) [all...] |
AdamsIntegrator.java | 42 * @param minStep minimal step (must be positive even for backward 51 final double minStep, final double maxStep, 55 super(name, nSteps, order, minStep, maxStep, 65 * @param minStep minimal step (must be positive even for backward 74 final double minStep, final double maxStep, 78 super(name, nSteps, order, minStep, maxStep,
|
DormandPrince54Integrator.java | 96 * @param minStep minimal step (must be positive even for backward 103 public DormandPrince54Integrator(final double minStep, final double maxStep, 107 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); 112 * @param minStep minimal step (must be positive even for backward 119 public DormandPrince54Integrator(final double minStep, final double maxStep, 123 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
HighamHall54Integrator.java | 69 * @param minStep minimal step (must be positive even for backward 76 public HighamHall54Integrator(final double minStep, final double maxStep, 80 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); 85 * @param minStep minimal step (must be positive even for backward 92 public HighamHall54Integrator(final double minStep, final double maxStep, 96 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
DormandPrince853Integrator.java | 208 * @param minStep minimal step (must be positive even for backward 215 public DormandPrince853Integrator(final double minStep, final double maxStep, 220 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); 225 * @param minStep minimal step (must be positive even for backward 232 public DormandPrince853Integrator(final double minStep, final double maxStep, 237 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
AdamsBashforthIntegrator.java | 149 * @param minStep minimal step (must be positive even for backward 158 final double minStep, final double maxStep, 162 super(METHOD_NAME, nSteps, nSteps, minStep, maxStep, 169 * @param minStep minimal step (must be positive even for backward 178 final double minStep, final double maxStep, 182 super(METHOD_NAME, nSteps, nSteps, minStep, maxStep,
|
EmbeddedRungeKuttaIntegrator.java | 102 * @param minStep minimal step (must be positive even for backward 112 final double minStep, final double maxStep, 116 super(name, minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); 140 * @param minStep minimal step (must be positive even for backward 150 final double minStep, final double maxStep, 154 super(name, minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
AdamsMoultonIntegrator.java | 165 * @param minStep minimal step (must be positive even for backward 174 final double minStep, final double maxStep, 178 super(METHOD_NAME, nSteps, nSteps + 1, minStep, maxStep, 185 * @param minStep minimal step (must be positive even for backward 194 final double minStep, final double maxStep, 198 super(METHOD_NAME, nSteps, nSteps + 1, minStep, maxStep,
|
GraggBulirschStoerIntegrator.java | 158 * @param minStep minimal step (must be positive even for backward 165 public GraggBulirschStoerIntegrator(final double minStep, final double maxStep, 168 super(METHOD_NAME, minStep, maxStep, 180 * @param minStep minimal step (must be positive even for backward 187 public GraggBulirschStoerIntegrator(final double minStep, final double maxStep, 190 super(METHOD_NAME, minStep, maxStep, [all...] |
/external/opencv3/modules/core/src/ |
cuda_gpu_mat.cpp | 55 size_t minstep = cols * elemSize(); local 59 step = minstep; 65 step = minstep; 67 CV_DbgAssert( step >= minstep ); 69 flags |= step == minstep ? Mat::CONTINUOUS_FLAG : 0; 72 dataend += step * (rows - 1) + minstep; 81 size_t minstep = cols * elemSize(); local 85 step = minstep; 91 step = minstep; 93 CV_DbgAssert( step >= minstep ); [all...] |
umatrix.cpp | 441 size_t esz = elemSize(), minstep; 452 minstep = (ofs.x + cols)*esz; 453 wholeSize.height = (int)((delta2 - minstep)/step[0] + 1);
|
matrix.cpp | 594 size_t esz = CV_ELEM_SIZE(m->type), minstep = thiz.cols*esz, _step = m->step; 596 _step = minstep; 598 thiz.dataend = thiz.datalimit - _step + minstep; 887 size_t esz = elemSize(), minstep; local 898 minstep = (ofs.x + cols)*esz; 899 wholeSize.height = (int)((delta2 - minstep)/step[0] + 1); [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
MultistepIntegrator.java | 102 * @param minStep minimal step (must be positive even for backward 111 final double minStep, final double maxStep, 115 super(name, minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); 123 starter = new DormandPrince853Integrator(minStep, maxStep, 149 * @param minStep minimal step (must be positive even for backward 158 final double minStep, final double maxStep, 161 super(name, minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance); 162 starter = new DormandPrince853Integrator(minStep, maxStep,
|
/external/deqp/framework/randomshaders/ |
rsgUtils.cpp | 226 int minStep = rnd.getInt(0, maxSteps-rangeLen); 228 float minVal = minFloatVal + step*(float)minStep;
|
rsgExpression.cpp | 207 int minStep = rnd.getInt(0, maxSteps-rangeLen); 209 float minVal = minFloatVal + step*(float)minStep; [all...] |
/external/opencv3/modules/core/include/opencv2/core/ |
mat.inl.hpp | 400 size_t minstep = cols * esz; local 403 _step = minstep; 408 if( rows == 1 ) _step = minstep; 409 CV_DbgAssert( _step >= minstep ); 416 flags |= _step == minstep ? CONTINUOUS_FLAG : 0; 421 dataend = datalimit - _step + minstep; 431 size_t minstep = cols*esz; local 434 _step = minstep; 439 if( rows == 1 ) _step = minstep; 440 CV_DbgAssert( _step >= minstep ); [all...] |
/external/deqp/framework/common/ |
tcuTexLookupVerifier.cpp | 147 const Vec4 minStep = 1.0f / (stepCount + 1.0f); 148 const float step = de::max(minComp(minStep), 1.0f / float(maxSteps)); 165 const Vec4 minStep = 1.0f / (stepCount + 1.0f); 166 const float step = de::max(minComp(minStep), 1.0f / float(maxSteps)); 176 const Vec4 minStep = 1.0f / (stepCount + 1.0f); 177 const float step = minComp(minStep); 187 const Vec4 minStep = 1.0f / (stepCount + 1.0f); 188 const float step = minComp(minStep); [all...] |