/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | p3.cpp | 4 auto lambda = [i]() -> void {}; // expected-note 3{{candidate constructor}} local 5 decltype(lambda) foo = { 1 }; // expected-error{{no matching constructor}}
|
H A D | p20.cpp | 10 auto lambda = []{}; local 11 destroy(&lambda);
|
H A D | p6.cpp | 7 const auto lambda = [](int x) { }; local 8 void (*fp3)(int) = lambda;
|
H A D | p23.cpp | 54 auto lambda = [](Args... inner_args) { return g(inner_args...); }; local 55 lambda(args...);
|
H A D | templates.cpp | 5 auto nrl = []() [[noreturn]] {}; // expected-error{{lambda declared 'noreturn' should not return}} 19 auto lambda = [=, &y] () -> T { local 24 return lambda(); 39 auto lambda = [=](bool b) { return x + y; }; local 40 return lambda(true); // expected-error{{no viable conversion from 'X' to 'int'}} 46 // Make sure that lambda's operator() can be used from templates. 80 = typeid([=,&r] () -> R& { // expected-error{{lambda expression in an unevaluated operand}}
|
/external/clang/test/Index/ |
H A D | cxx11-lambdas.cpp | 7 auto lambda = [&localA, localB] (Integer x) -> Integer { local
|
/external/llvm/utils/emacs/ |
H A D | emacs.el | 25 (lambda nil 34 (lambda nil
|
H A D | llvm-mode.el | 55 (mapcar (function (lambda (n)
|
/external/eigen/doc/snippets/ |
H A D | ComplexEigenSolver_compute.cpp | 9 complex<float> lambda = ces.eigenvalues()[0]; variable 10 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 12 cout << "If v is the corresponding eigenvector, then lambda * v = " << endl << lambda * v << endl;
|
H A D | EigenSolver_EigenSolver_MatrixType.cpp | 8 complex<double> lambda = es.eigenvalues()[0]; variable 9 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 11 cout << "If v is the corresponding eigenvector, then lambda * v = " << endl << lambda * v << endl;
|
H A D | SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | 9 double lambda = es.eigenvalues()[0]; variable 10 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 12 cout << "If v is the corresponding eigenvector, then lambda * v = " << endl << lambda * v << endl;
|
H A D | SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType2.cpp | 12 double lambda = es.eigenvalues()[0]; variable 13 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 16 cout << "... and lambda * B * v = " << endl << lambda * B * v << endl << endl;
|
/external/libgsm/src/ |
H A D | long_term.c | 59 register int k, lambda; local 97 for (lambda = 40; lambda <= 120; lambda++) { 98 L_result = (longword)wt_k * dp[best_k - lambda]; 100 Nc = lambda; 163 register int k, lambda; local 203 for (lambda = 40; lambda <= 120; lambda 301 register int k, lambda; local 478 register int k, lambda; local 646 register int k, lambda; local 719 register int k, lambda; local [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/shadow/ |
H A D | PssmShadowUtil.java | 57 public static void updateFrustumSplits(float[] splits, float near, float far, float lambda) { argument 62 splits[i] = log * lambda + uniform * (1.0f - lambda);
|
H A D | PssmShadowRenderer.java | 118 private float lambda = 0.65f; field in class:PssmShadowRenderer 359 PssmShadowUtil.updateFrustumSplits(splitsArray, frustumNear, zFar, lambda); 461 * see {@link setLambda(float lambda)} 462 * @return lambda 465 return lambda; 474 * @param lambda the lambda value. 476 public void setLambda(float lambda) { argument 477 this.lambda = lambda; [all...] |
/external/webkit/Tools/Scripts/ |
H A D | run-qtwebkit-tests | 229 filtered_path = filter(lambda w: w.startswith('tst_') and os.access(os.path.join(root, w), os.X_OK), files) 230 filtered_path = map(lambda w: os.path.join(root, w), filtered_path) 242 package = map(lambda w: [w, self._options.tests_options, not self._options.developer, self._options.timeout], files) 272 txt = "\n\n".join(map(lambda w: w.output(), results)) 275 totals = reduce(lambda x, y: (int(x[0]) + int(y[0]), int(x[1]) + int(y[1]), int(x[2]) + int(y[2])), totals) 287 txt = "\n\n".join(map(lambda w: w.output(), results)) 291 lambda w: r"", 294 lambda w: "<case class='good'><br><br><b>" + w.group(0) + r"</b></case>", 297 lambda w: "\n<case class='good'><br><i>" + w.group(0) + r"</i> ", 300 lambda [all...] |
H A D | validate-committer-lists | 89 return filter(lambda email: not email_to_committer_map.get(email), emails) 175 authors_missing_email = filter(lambda author: author.find('@') == -1, self._last_commit_time_by_author_cache) 176 authors_with_email = filter(lambda author: author.find('@') != -1, self._last_commit_time_by_author_cache) 177 prefixes_of_authors_with_email = map(lambda author: author.split('@')[0], authors_with_email) 213 authors_and_last_commits.sort(lambda a,b: cmp(a[1], b[1]), reverse=True)
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
H A D | Tnaf.java | 75 * Computes the norm of an element <code>λ</code> of 78 * @param lambda The element <code>λ</code> of 80 * @return The norm of <code>λ</code>. 82 public static BigInteger norm(final byte mu, ZTauElement lambda) argument 87 BigInteger s1 = lambda.u.multiply(lambda.u); 90 BigInteger s2 = lambda.u.multiply(lambda.v); 93 BigInteger s3 = lambda 314 tauAdicNaf(byte mu, ZTauElement lambda) argument 670 multiplyTnaf(ECPoint.F2m p, ZTauElement lambda) argument 723 tauAdicWNaf(byte mu, ZTauElement lambda, byte width, BigInteger pow2w, BigInteger tw, ZTauElement[] alpha) argument [all...] |
H A D | ECPoint.java | 491 ECFieldElement.F2m lambda 495 = (ECFieldElement.F2m)lambda.square().add(lambda).add(this.x).add(x2).add(this.curve.getA()); 498 = (ECFieldElement.F2m)lambda.multiply(this.x.add(x3)).add(x3).add(this.y); 550 ECFieldElement.F2m lambda 554 = (ECFieldElement.F2m)lambda.square().add(lambda). 560 x3.multiply(lambda.add(ONE)));
|
H A D | WTauNafMultiplier.java | 42 * by an element <code>λ</code> of <code><b>Z</b>[τ]</code> using 45 * @param lambda The element <code>λ</code> of 48 * @return <code>p</code> multiplied by <code>λ</code>. 50 private ECPoint.F2m multiplyWTnaf(ECPoint.F2m p, ZTauElement lambda, argument 66 byte[]u = Tnaf.tauAdicWNaf(mu, lambda, Tnaf.WIDTH, 74 * by an element <code>λ</code> of <code><b>Z</b>[τ]</code> 76 * WTNAF of <code>λ</code>. 78 * @param u The the WTNAF of <code>λ</code>.. 79 * @return <code>λ * [all...] |
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | ConstrainedConjGrad.h | 114 Scalar rho = 1.0, rho_1, lambda, gamma; local 170 lambda = rho / q.dot(p); 177 lambda = (std::min)(lambda, (f.coeff(i)-C.row(i).dot(x)) / bb); 180 x += lambda * p;
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/token-rewrite/ |
H A D | basic.rb | 232 lambda { stream.render }. 243 lambda { stream.render }. 254 lambda { stream.render }. 265 lambda { stream.render }.
|
/external/webp/src/enc/ |
H A D | quant.c | 409 static WEBP_INLINE void SetRDScore(int lambda, VP8ModeScore* const rd) { argument 411 rd->score = rd->R * lambda + 256 * (rd->D + rd->SD); 414 static WEBP_INLINE score_t RDScoreTrellis(int lambda, score_t rate, argument 416 return rate * lambda + 256 * distortion; 423 int lambda) { 454 best_score = RDScoreTrellis(lambda, cost, max_error); 522 score = RDScoreTrellis(lambda, cost, total_error); 534 score = RDScoreTrellis(lambda, cost, total_error); 705 const int lambda = dqm->lambda_i16_; local 727 SetRDScore(lambda, 419 TrellisQuantizeBlock(const VP8EncIterator* const it, int16_t in[16], int16_t out[16], int ctx0, int coeff_type, const VP8Matrix* const mtx, int lambda) argument 756 const int lambda = dqm->lambda_i4_; local 832 const int lambda = dqm->lambda_uv_; local [all...] |
/external/webkit/Source/WebCore/html/parser/ |
H A D | create-html-entity-table | 72 entries.sort(key = lambda entry: entry[ENTITY])
|
/external/webkit/Tools/CodeCoverage/ |
H A D | run-generate-coverage-data | 81 deps = filter(lambda x: base_dir in x, deps) 82 deps = map(lambda x: os.path.abspath(os.path.join(dir, x)), deps) 217 candidates = map(lambda x: parse_dependency_file(x,base_dir,[]), depends)
|