| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| AdamsIntegrator.java | 44 * @param maxStep maximal step (must be positive even for backward
51 final double minStep, final double maxStep,
55 super(name, nSteps, order, minStep, maxStep,
67 * @param maxStep maximal step (must be positive even for backward
74 final double minStep, final double maxStep,
78 super(name, nSteps, order, minStep, maxStep,
|
| DormandPrince54Integrator.java | 98 * @param maxStep maximal step (must be positive even for backward
103 public DormandPrince54Integrator(final double minStep, final double maxStep,
107 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance);
114 * @param maxStep maximal step (must be positive even for backward
119 public DormandPrince54Integrator(final double minStep, final double maxStep,
123 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
| HighamHall54Integrator.java | 71 * @param maxStep maximal step (must be positive even for backward
76 public HighamHall54Integrator(final double minStep, final double maxStep,
80 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance);
87 * @param maxStep maximal step (must be positive even for backward
92 public HighamHall54Integrator(final double minStep, final double maxStep,
96 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
| AdaptiveStepsizeIntegrator.java | 90 private final double maxStep;
97 * @param maxStep maximal step (must be positive even for backward
103 final double minStep, final double maxStep,
110 this.maxStep = FastMath.abs(maxStep);
127 * @param maxStep maximal step (must be positive even for backward
133 final double minStep, final double maxStep,
140 this.maxStep = maxStep;
164 if ((initialStepSize < minStep) || (initialStepSize > maxStep)) {
[all...] |
| DormandPrince853Integrator.java | 210 * @param maxStep maximal step (must be positive even for backward
215 public DormandPrince853Integrator(final double minStep, final double maxStep,
220 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance);
227 * @param maxStep maximal step (must be positive even for backward
232 public DormandPrince853Integrator(final double minStep, final double maxStep,
237 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
| AdamsBashforthIntegrator.java | 151 * @param maxStep maximal step (must be positive even for backward
158 final double minStep, final double maxStep,
162 super(METHOD_NAME, nSteps, nSteps, minStep, maxStep,
171 * @param maxStep maximal step (must be positive even for backward
178 final double minStep, final double maxStep,
182 super(METHOD_NAME, nSteps, nSteps, minStep, maxStep,
|
| AdamsMoultonIntegrator.java | 167 * @param maxStep maximal step (must be positive even for backward
174 final double minStep, final double maxStep,
178 super(METHOD_NAME, nSteps, nSteps + 1, minStep, maxStep,
187 * @param maxStep maximal step (must be positive even for backward
194 final double minStep, final double maxStep,
198 super(METHOD_NAME, nSteps, nSteps + 1, minStep, maxStep,
|
| EmbeddedRungeKuttaIntegrator.java | 104 * @param maxStep maximal step (must be positive even for backward
112 final double minStep, final double maxStep,
116 super(name, minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance);
142 * @param maxStep maximal step (must be positive even for backward
150 final double minStep, final double maxStep,
154 super(name, minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance);
|
| GraggBulirschStoerIntegrator.java | 160 * @param maxStep maximal step (must be positive even for backward
165 public GraggBulirschStoerIntegrator(final double minStep, final double maxStep,
168 super(METHOD_NAME, minStep, maxStep,
182 * @param maxStep maximal step (must be positive even for backward
187 public GraggBulirschStoerIntegrator(final double minStep, final double maxStep,
190 super(METHOD_NAME, minStep, maxStep,
[all...] |
| /external/skia/src/core/ |
| SkAlphaRuns.cpp | 27 void SkAlphaRuns::assertValid(int y, int maxStep) const {
28 int max = (y + 1) * maxStep - (y == maxStep - 1);
|
| SkAntiRun.h | 110 SkDEBUGCODE(void assertValid(int y, int maxStep) const;)
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| MultistepIntegrator.java | 104 * @param maxStep maximal 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,
151 * @param maxStep maximal 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,
|
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
| WindowSurface.java | 109 float adjDelta(float cur, float minStep, float maxStep) {
113 if (cur > maxStep) cur = maxStep;
114 if (cur < -maxStep) cur = -maxStep;
118 void step(int width, int height, float minStep, float maxStep) {
123 dx = adjDelta(-dx, minStep, maxStep);
129 dy = adjDelta(-dy, minStep, maxStep);
|
| /external/libxml2/ |
| pattern.c | 103 int maxStep; /* allocated number of steps */
171 int maxStep;
213 cur->maxStep = 10;
214 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp));
351 if (comp->nbStep >= comp->maxStep) {
353 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 *
361 comp->maxStep *= 2;
422 if (comp->nbStep >= comp->maxStep) {
424 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 *
432 comp->maxStep *= 2
[all...] |
| xpath.c | 944 int maxStep; /* Maximum number of steps allocated */
998 cur->maxStep = 10;
1000 cur->steps = (xmlXPathStepOp *) xmlMalloc(cur->maxStep *
1007 memset(cur->steps, 0, cur->maxStep * sizeof(xmlXPathStepOp));
1091 if (comp->nbStep >= comp->maxStep) {
1094 if (comp->maxStep >= XPATH_MAX_STEPS) {
1098 comp->maxStep *= 2;
1100 comp->maxStep * sizeof(xmlXPathStepOp));
1102 comp->maxStep /= 2;
[all...] |
