Searched refs:previous (Results 1 - 25 of 550) sorted by path

1234567891011>>

/external/aac/libSBRdec/src/
H A Dsbrdec_freq_sca.cpp532 int previous; local
537 previous = stop; /* Start with highest QMF channel */
552 diff[i] = previous - current;
553 previous = current;
/external/aac/libSBRenc/src/
H A Dsbrenc_freq_sca.cpp562 INT previous; local
566 previous=start;
575 diff[i-1] = current-previous;
576 previous = current;
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas351 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
742 /// Seek back to previous index saved during last Push() call.
4557 FPreviousNode := FLookahead[FHead]; // track previous node before moving on
H A DAntlr.Runtime.pas74 /// Negative indexes are allowed. LA(-1) is previous token (token just matched).
325 /// I < 0 indicates tokens in the past. So -1 is previous token and -2 is
1132 /// previous changes to the text.
2772 /// 3. Throw exception upon boundary overlap with any previous replace.
2779 /// 3. throw exception if index in same range as previous replace
6051 + ROp.ToString + ' overlap with previous ' + PrevROp.ToString);
6093 + IOp.ToString + ' within boundaries of previous ' + ROp.ToString);
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/
H A Drewrite.rb313 def conflict!( current, previous )
314 message = 'operation %p overlaps with previous operation %p' % [ current, previous ]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/test/
H A Dgrammar.rb295 previous, @path = @path, v.to_s
296 previous == @path or write_to_disk
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/token-rewrite/
H A Dbasic.rb234 error.to_s.should == %q<operation (replace @ 1..2 : "foo") overlaps with previous operation (replace @ 0..3 : "bar")>
245 error.to_s.should == %q<operation (insert-before @ 4 : "y") overlaps with previous operation (replace @ 2..4 : "x")>
256 error.to_s.should == %q<operation (replace @ 3..5 : "foo") overlaps with previous operation (replace @ 2..4 : "xyz")>
267 error.to_s.should == %q<operation (replace @ 1..3 : "foo") overlaps with previous operation (replace @ 2..4 : "xyz")>
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DIntervalSet.java123 iter.previous(); // move backwards to what we just set
131 iter.previous();
239 Interval previous = (Interval)intervals.get(i-1);
241 IntervalSet s = IntervalSet.of(previous.b+1, current.a-1);
/external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/
H A DGaussNewtonEstimator.java173 double previous = Double.POSITIVE_INFINITY;
222 previous = cost;
226 (FastMath.abs(previous - cost) > (cost * steadyStateThreshold) &&
/external/apache-commons-math/src/main/java/org/apache/commons/math/exception/
H A DNonMonotonousSequenceException.java49 private final Number previous; field in class:NonMonotonousSequenceException
57 * @param previous Previous value in the sequence.
61 Number previous,
63 this(wrong, previous, index, MathUtils.OrderDirection.INCREASING, true);
70 * @param previous Previous value in the sequence.
78 Number previous,
89 wrong, previous, index, index - 1);
94 this.previous = previous;
118 * @return the previous valu
60 NonMonotonousSequenceException(Number wrong, Number previous, int index) argument
77 NonMonotonousSequenceException(Number wrong, Number previous, int index, MathUtils.OrderDirection direction, boolean strict) argument
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/
H A DContinuousOutputModel.java151 final double previous = lastInterpolator.getPreviousTime();
152 final double step = current - previous;
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/
H A DAdamsMoultonIntegrator.java45 * on the number k of previous steps one wants to use for computing the next
68 * <p>The definitions above use the classical representation with several previous first
99 * The previous formula can be used with several values for i to compute the transform between
347 private final double[] previous; field in class:AdamsMoultonIntegrator.Corrector
359 * @param previous previous state
363 public Corrector(final double[] previous, final double[] scaled, final double[] state) { argument
364 this.previous = previous;
398 after[i] += previous[
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/
H A DRealConvergenceChecker.java43 * call if needed. Each time this method is called, the previous and current point
49 * @param previous point from previous iteration
53 boolean converged(int iteration, RealPointValuePair previous, RealPointValuePair current); argument
H A DSimpleRealPointChecker.java73 final RealPointValuePair previous,
75 final double[] p = previous.getPoint();
72 converged(final int iteration, final RealPointValuePair previous, final RealPointValuePair current) argument
H A DSimpleScalarValueChecker.java73 final RealPointValuePair previous,
75 final double p = previous.getValue();
72 converged(final int iteration, final RealPointValuePair previous, final RealPointValuePair current) argument
H A DSimpleVectorialPointChecker.java73 final VectorialPointValuePair previous,
75 final double[] p = previous.getPointRef();
72 converged(final int iteration, final VectorialPointValuePair previous, final VectorialPointValuePair current) argument
H A DSimpleVectorialValueChecker.java73 final VectorialPointValuePair previous,
75 final double[] p = previous.getValueRef();
72 converged(final int iteration, final VectorialPointValuePair previous, final VectorialPointValuePair current) argument
H A DVectorialConvergenceChecker.java43 * call if needed. Each time this method is called, the previous and current point
49 * @param previous point from previous iteration
53 boolean converged(int iteration, VectorialPointValuePair previous, VectorialPointValuePair current); argument
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/
H A DDirectSearchOptimizer.java74 * previous and current simplex to the convergence checker, not the best ones.</p>
289 RealPointValuePair[] previous = new RealPointValuePair[simplex.length];
295 converged &= checker.converged(iterations, previous[i], simplex[i]);
304 System.arraycopy(simplex, 0, previous, 0, simplex.length);
H A DPowellOptimizer.java130 final RealPointValuePair previous = new RealPointValuePair(x1, fX);
132 if (getConvergenceChecker().converged(getIterations(), previous, current)) {
134 return (fVal < fX) ? current : previous;
136 return (fVal > fX) ? current : previous;
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
H A DGaussNewtonOptimizer.java74 VectorialPointValuePair previous = current;
124 if (previous != null) {
125 converged = checker.converged(getIterations(), previous, current);
H A DLevenbergMarquardtOptimizer.java280 VectorialPointValuePair previous = current;
437 if (checker.converged(getIterations(), previous, current)) {
442 // failed iteration, reset the previous values
H A DNonLinearConjugateGradientOptimizer.java146 RealPointValuePair previous = current;
148 if (previous != null) {
149 if (checker.converged(getIterations(), previous, current)) {

Completed in 585 milliseconds

1234567891011>>