| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| D | AdaptiveStepsizeIntegrator.java | 90 private final double maxStep; field in AdaptiveStepsizeIntegrator
103 final double minStep, final double maxStep, in AdaptiveStepsizeIntegrator() argument
110 this.maxStep = FastMath.abs(maxStep); in AdaptiveStepsizeIntegrator()
133 final double minStep, final double maxStep, in AdaptiveStepsizeIntegrator() argument
140 this.maxStep = maxStep; in AdaptiveStepsizeIntegrator()
164 if ((initialStepSize < minStep) || (initialStepSize > maxStep)) { in setInitialStepSize()
307 if (filteredH > maxStep) { in filterStep()
308 filteredH = maxStep; in filterStep()
309 } else if (filteredH < -maxStep) { in filterStep()
310 filteredH = -maxStep; in filterStep()
[all …]
|
| D | HighamHall54Integrator.java | 76 public HighamHall54Integrator(final double minStep, final double maxStep, in HighamHall54Integrator() argument
80 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); in HighamHall54Integrator()
92 public HighamHall54Integrator(final double minStep, final double maxStep, in HighamHall54Integrator() argument
96 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance); in HighamHall54Integrator()
|
| D | AdamsIntegrator.java | 51 final double minStep, final double maxStep, in AdamsIntegrator() argument
55 super(name, nSteps, order, minStep, maxStep, in AdamsIntegrator()
74 final double minStep, final double maxStep, in AdamsIntegrator() argument
78 super(name, nSteps, order, minStep, maxStep, in AdamsIntegrator()
|
| D | DormandPrince54Integrator.java | 103 public DormandPrince54Integrator(final double minStep, final double maxStep, in DormandPrince54Integrator() argument
107 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); in DormandPrince54Integrator()
119 public DormandPrince54Integrator(final double minStep, final double maxStep, in DormandPrince54Integrator() argument
123 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance); in DormandPrince54Integrator()
|
| D | DormandPrince853Integrator.java | 215 public DormandPrince853Integrator(final double minStep, final double maxStep, in DormandPrince853Integrator() argument
220 minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); in DormandPrince853Integrator()
232 public DormandPrince853Integrator(final double minStep, final double maxStep, in DormandPrince853Integrator() argument
237 minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance); in DormandPrince853Integrator()
|
| D | AdamsBashforthIntegrator.java | 158 final double minStep, final double maxStep, in AdamsBashforthIntegrator() argument
162 super(METHOD_NAME, nSteps, nSteps, minStep, maxStep, in AdamsBashforthIntegrator()
178 final double minStep, final double maxStep, in AdamsBashforthIntegrator() argument
182 super(METHOD_NAME, nSteps, nSteps, minStep, maxStep, in AdamsBashforthIntegrator()
|
| D | AdamsMoultonIntegrator.java | 174 final double minStep, final double maxStep, in AdamsMoultonIntegrator() argument
178 super(METHOD_NAME, nSteps, nSteps + 1, minStep, maxStep, in AdamsMoultonIntegrator()
194 final double minStep, final double maxStep, in AdamsMoultonIntegrator() argument
198 super(METHOD_NAME, nSteps, nSteps + 1, minStep, maxStep, in AdamsMoultonIntegrator()
|
| D | EmbeddedRungeKuttaIntegrator.java | 112 final double minStep, final double maxStep, in EmbeddedRungeKuttaIntegrator() argument
116 super(name, minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); in EmbeddedRungeKuttaIntegrator()
150 final double minStep, final double maxStep, in EmbeddedRungeKuttaIntegrator() argument
154 super(name, minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance); in EmbeddedRungeKuttaIntegrator()
|
| D | GraggBulirschStoerIntegrator.java | 165 public GraggBulirschStoerIntegrator(final double minStep, final double maxStep, in GraggBulirschStoerIntegrator() argument
168 super(METHOD_NAME, minStep, maxStep, in GraggBulirschStoerIntegrator()
187 public GraggBulirschStoerIntegrator(final double minStep, final double maxStep, in GraggBulirschStoerIntegrator() argument
190 super(METHOD_NAME, minStep, maxStep, in GraggBulirschStoerIntegrator()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| D | MultistepIntegrator.java | 111 final double minStep, final double maxStep, in MultistepIntegrator() argument
115 super(name, minStep, maxStep, scalAbsoluteTolerance, scalRelativeTolerance); in MultistepIntegrator()
123 starter = new DormandPrince853Integrator(minStep, maxStep, in MultistepIntegrator()
158 final double minStep, final double maxStep, in MultistepIntegrator() argument
161 super(name, minStep, maxStep, vecAbsoluteTolerance, vecRelativeTolerance); in MultistepIntegrator()
162 starter = new DormandPrince853Integrator(minStep, maxStep, in MultistepIntegrator()
|
| /external/skia/src/core/ |
| D | SkAlphaRuns.cpp | 28 void SkAlphaRuns::assertValid(int y, int maxStep) const { in assertValid()
29 int max = (y + 1) * maxStep - (y == maxStep - 1); in assertValid()
|
| D | SkAntiRun.h | 106 SkDEBUGCODE(void assertValid(int y, int maxStep) const;)
|
| /external/libxml2/ |
| D | pattern.c | 103 int maxStep; /* allocated number of steps */ member
171 int maxStep; member
213 cur->maxStep = 10; in xmlNewPattern()
214 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp)); in xmlNewPattern()
351 if (comp->nbStep >= comp->maxStep) { in xmlPatternAdd()
353 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlPatternAdd()
361 comp->maxStep *= 2; in xmlPatternAdd()
422 if (comp->nbStep >= comp->maxStep) { in xmlReversePattern()
424 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 * in xmlReversePattern()
432 comp->maxStep *= 2; in xmlReversePattern()
[all …]
|
| D | xpath.c | 944 int maxStep; /* Maximum number of steps allocated */ member
998 cur->maxStep = 10; in xmlXPathNewCompExpr()
1000 cur->steps = (xmlXPathStepOp *) xmlMalloc(cur->maxStep * in xmlXPathNewCompExpr()
1007 memset(cur->steps, 0, cur->maxStep * sizeof(xmlXPathStepOp)); in xmlXPathNewCompExpr()
1091 if (comp->nbStep >= comp->maxStep) { in xmlXPathCompExprAdd()
1094 if (comp->maxStep >= XPATH_MAX_STEPS) { in xmlXPathCompExprAdd()
1098 comp->maxStep *= 2; in xmlXPathCompExprAdd()
1100 comp->maxStep * sizeof(xmlXPathStepOp)); in xmlXPathCompExprAdd()
1102 comp->maxStep /= 2; in xmlXPathCompExprAdd()
|