| /external/clang/lib/AST/ |
| Decl.cpp | 89 /// Kinds of LV computation. The linkage side of the computation is
93 /// Do an LV computation for, ultimately, a type.
98 /// Do an LV computation for, ultimately, a non-type declaration.
103 /// Do an LV computation for, ultimately, a type that already has
108 /// Do an LV computation for, ultimately, a non-type declaration
114 /// Does this computation kind permit us to consider additional
116 static bool hasExplicitVisibilityAlready(LVComputationKind computation) {
117 return ((unsigned(computation) & IgnoreExplicitVisibilityBit) != 0);
142 /// visibility computation
888 LVComputationKind computation = local
[all...] |
| /external/libvorbis/doc/ |
| 07-floor1.tex | 35 \item floor computation produces two new line segments, one running from
42 the codec setup header at floor 1 initialization time. Computation
74 pattern should be clear; we complete the floor computation as follows:
88 algorithm splits Y value computation and line plotting into two steps
237 \paragraph{curve computation} \label{vorbis:spec:floor1-synth}
239 Curve computation is split into two logical steps; the first step
244 conditionally skipped during final line computation in step two.
|
| 06-floor0.tex | 91 required for curve computation. For example, if the VQ codebook used
104 \subsubsection{curve computation} \label{vorbis:spec:floor0-synth}
|
| 04-codec.tex | 533 length for floor computation is \varname{[n]}/2.
|
| /external/v8/test/mjsunit/regress/ |
| regress-728.js | 36 // Force computation of hash for the string representation of array index.
|
| regress-732.js | 41 // Force hash computation for the string representation of index.
|
| /external/ceres-solver/docs/ |
| changes.tex | 75 \item Numerically robust computation of \texttt{model\_cost\_change}.
105 \item Gradient computation support in the evaluators, with an eye
|
| solving.tex | 115 The key advantage of the Dogleg over Levenberg Marquardt is that if the step computation for a particular choice of $\mu$ does not result in sufficient decrease in the value of the objective function, Levenberg-Marquardt solves the linear approximation from scratch with a smaller value of $\mu$. Dogleg on the other hand, only needs to compute the interpolation between the Gauss-Newton and the Cauchy vectors, as neither of them depend on the value of $\mu$.
435 (\texttt{LEVENBERG\_MARQUARDT}) The trust region step computation
[all...] |
| modeling.tex | 33 The most important method here is \texttt{Evaluate}. It implements the residual and Jacobian computation.
|
| /external/v8/benchmarks/ |
| base.js | 56 // mean computation.
|
| deltablue.js | 634 * that do no computation, such as stay and edit constraints, are
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| codegen.ml | 284 (* Return the body computation. *)
|
| /external/dropbear/libtommath/ |
| bn.tex | 573 /* use the number [e.g. pre-computation] */
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| BaseRecognizer.as | 358 * from within the rule; i.e., the FIRST computation done by
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-deltablue.js | 628 * that do no computation, such as stay and edit constraints, are
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-deltablue.js | 628 * that do no computation, such as stay and edit constraints, are
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-deltablue.js | 628 * that do no computation, such as stay and edit constraints, are
|
| /external/dropbear/libtomcrypt/ |
| crypt.tex | [all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.pas | [all...] |
| /external/grub/docs/ |
| texinfo.tex | [all...] |
| /external/bison/build-aux/ |
| texinfo.tex | [all...] |
| /ndk/sources/host-tools/sed-4.2.1/build-aux/ |
| texinfo.tex | [all...] |
| /build/tools/droiddoc/templates-sac/assets/js/ |
| android_3p-bundle.js | [all...] |
| /build/tools/droiddoc/templates-sdk/assets/js/ |
| android_3p-bundle.js | [all...] |
