Searched refs:step (Results 1 - 25 of 819) sorted by path

1234567891011>>

/external/aac/libAACdec/src/
H A Dblock.cpp543 int step = hcb->Dimension; local
556 for (index=BandOffsets[band]; index < BandOffsets[band+1]; index+=step)
560 for (i=0; i<step; i++) {
/external/aac/libAACenc/src/
H A Dsf_estim.cpp127 int step = psyOutChan->sfbPerGroup; local
128 for(sfbGrp = 0; sfbGrp < tmp0; sfbGrp += step) {
/external/aac/libSBRdec/src/
H A Denv_dec.cpp369 FIXP_SGL step; /* speed of fade */ local
401 step = (FIXP_SGL)DECAY_COUPLING;
405 step = (FIXP_SGL)DECAY;
409 step <<= 1;
414 h_sbr_data->iEnvelope[i] = -step;
416 h_sbr_data->iEnvelope[i] = step;
H A Dsbrdec_freq_sca.cpp432 /* Scaled bandfactor and step 1 bit right to avoid overflow
435 FIXP_DBL step = FL2FXCONST_DBL(0.125f); /* Initial increment for factor */ local
448 while ( step > FL2FXCONST_DBL(0.0f)) {
459 /* Halfen step. Right shift is not done as fract because otherwise the
461 step = (FIXP_DBL)((LONG)step >> 1);
463 bandfactor = bandfactor + step;
467 step = (FIXP_DBL)((LONG)step >> 1);
469 bandfactor = bandfactor - step;
654 int step; local
[all...]
/external/aac/libSBRenc/src/
H A Dnf_est.cpp390 INT step; local
404 step=org_length/result_length; /* floor; */
405 org_length=org_length - step;
407 v_index[i]=v_index[i-1]+step;
/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.Tools.pas781 // (2nd ed) has a bug: step R4 should go to step R1, not R2 (already errata'd).
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Ddfa.rb54 each step, the machine examines the next symbol on the input stream, checks the
H A Dstreams.rb344 a recognizer can arbitrarily step forward and backward through the stream's
899 # advance the stream one step to the next on-channel token
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/debugging/
H A Dprofile-mode.rb24 * Use ANTLRWorks to see the lookahead use (step by Location)
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/
H A Dll-star.rb29 * Use ANTLRWorks to see the look use (step by Location)
/external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/
H A DSSLEngineImplTest.java760 int step = (client.getHandshakeStatus()
763 SSLEngine current_engine = engines[step];
790 buffer = buffers[step];
802 step ^= 1;
803 current_engine = engines[step];
816 if (!buffers[step].hasRemaining()) {
836 print(result = engines[(step + 1) % 2].unwrap(
843 buffer = buffers[step ^ 1];
852 step ^= 1;
853 current_engine = engines[step];
[all...]
/external/apache-http/src/org/apache/http/conn/routing/
H A DBasicRouteDirector.java59 * Provides the next step.
66 * either the next step to perform, or success, or failure.
75 int step = UNREACHABLE;
78 step = firstStep(plan);
80 step = proxiedStep(plan, fact);
82 step = directStep(plan, fact);
84 return step;
90 * Determines the first step to establish a route.
94 * @return the first step
104 * Determines the next step t
[all...]
/external/apache-http/src/org/apache/http/impl/client/
H A DDefaultRequestDirector.java627 int step;
630 step = rowdy.nextStep(route, fact);
632 switch (step) {
674 ("Unknown step indicator "+step+" from RouteDirector.");
677 } while (step > HttpRouteDirector.COMPLETE);
/external/apache-xml/src/main/java/org/apache/xpath/
H A DXPathVisitor.java78 * Visit a step within a location path.
81 * @param step The Step object.
84 public boolean visitStep(ExpressionOwner owner, NodeTest step) argument
/external/apache-xml/src/main/java/org/apache/xpath/axes/
H A DWalkerFactory.java53 * @param stepOpCodePos The opcode position for the step.
87 * @param stepOpCodePos The opcode position for the step.
88 * @param stepIndex The top-level step index withing the iterator.
169 // Is the iteration a one-step attribute pattern (i.e. select="@foo")?
180 // Is the iteration exactly one child step?
202 // Is the iteration a one-step attribute pattern (i.e. select="@foo")?
293 * @param stepOpCodePos The opcode position for the step.
548 * @param stepOpCodePos The opcode position for the step.
549 * @param stepIndex The top-level step index withing the iterator.
656 * @param stepOpCodePos The opcode position for the step
[all...]
/external/apache-xml/src/main/java/org/apache/xpath/compiler/
H A DXPathParser.java1586 // Tell how long the step is without the predicate
1638 // "Location step expected following '/' or '//'"
1651 * @returns false if step was empty (or only a '/'); true, otherwise
1673 // by a regular step pattern.
1675 // Make room for telling how long the step is without the predicate
1680 // Tell how long the step is without the predicate
1684 // Tell how long the step is with the predicate
1702 // Tell how long the step is without the predicate
1711 // Tell how long the step is without the predicate
1729 // Tell how long the entire step i
[all...]
/external/bison/data/
H A Dlocation.cc210 void step ()
/external/bison/examples/calc++/
H A Dcalc++-scanner.cc811 yylloc->step ();
926 yylloc->step ();
932 yylloc->lines (yyleng); yylloc->step ();
H A Dlocation.hh90 void step () function in class:yy::location
/external/blktrace/btt/doc/
H A Dbtt.tex73 parameters you want. You must save the traces to disk in this step,
84 While this step is optional, we have found that performing this
/external/blktrace/doc/
H A Dblktrace.tex79 Note that you may skip this step, if you kernel is at least 2.6.17-rc1.
/external/ceres-solver/internal/ceres/
H A Ddogleg_strategy.cc74 // gradient) and the new Gauss-Newton step are computed from
75 // scratch. The Dogleg step is then computed as interpolation of these
81 double* step) {
84 CHECK_NOTNULL(step);
93 ComputeTraditionalDoglegStep(step);
97 ComputeSubspaceDoglegStep(step);
119 // || D * step || <= radius_ .
144 // Interpolate the Cauchy point and the Gauss-Newton step.
146 ComputeTraditionalDoglegStep(step);
150 // Cauchy point and the (Gauss-)Newton step
77 ComputeStep( const TrustRegionStrategy::PerSolveOptions& per_solve_options, SparseMatrix* jacobian, const double* residuals, double* step) argument
[all...]
H A Ddogleg_strategy.h40 // Dogleg step computation and trust region sizing strategy based on
47 // Gauss-Newton step, we compute a regularized version of it. This is
64 double* step);
88 void ComputeTraditionalDoglegStep(double* step);
90 void ComputeSubspaceDoglegStep(double* step);
107 // reports an invalid step, the value of mu_ is increased so that
110 // If a successful step is reported, then the value of mu_ is
144 // problem with the step computed in the last call to ComputeStep,
H A Dlevenberg_marquardt_strategy.cc69 double* step) {
72 CHECK_NOTNULL(step);
101 InvalidateArray(num_parameters, step);
107 linear_solver_->Solve(jacobian, residuals, solve_options, step);
112 !IsArrayValid(num_parameters, step)) {
113 LOG(WARNING) << "Linear solver failure. Failed to compute a finite step.";
116 VectorRef(step, num_parameters) *= -1.0;
128 step,
65 ComputeStep( const TrustRegionStrategy::PerSolveOptions& per_solve_options, SparseMatrix* jacobian, const double* residuals, double* step) argument

Completed in 1340 milliseconds

1234567891011>>