| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| D | BlockSparseMatrix.h | 415 for(StorageIndex bj = 0; bj < m_outerBSize; ++bj)
419 blockPattern.startVec(bj);
420 for(StorageIndex j = blockOuterIndex(bj); j < blockOuterIndex(bj+1); ++j)
430 blockPattern.insertBackByOuterInnerUnordered(bj, bi) = true;
432 m_nonzeros += blockOuterSize(bj) * blockInnerSize(bi);
443 for(StorageIndex bj = 0; bj < m_outerBSize; ++bj)
446 for(StorageIndex j = blockOuterIndex(bj); j < blockOuterIndex(bj+1); ++j)
455 while(bi > m_indices[m_outerIndex[bj]+idx]) ++idx; // Not expensive for ordered blocks
460 idxVal = m_blockPtr[m_outerIndex[bj]+idx];
462 … idxVal += (j - blockOuterIndex(bj)) * blockOuterSize(bj) + it_spmat.index() - m_innerOffset[bi];
[all …]
|
| /external/webrtc/modules/third_party/fft/ |
| D | fft.c | 280 REAL s1, s2, s3, sd, bb, bj, bk, bjm, bjp, bkm, bkp; in FFTRADIX() local
574 bj = Im [k1] + Im [k2]; in FFTRADIX()
576 Im [kk] = bk + bj; in FFTRADIX()
578 bk -= 0.5 * bj; in FFTRADIX()
580 bj = (Im [k1] - Im [k2]) * s60; in FFTRADIX()
581 Re [k1] = ak - bj; in FFTRADIX()
582 Re [k2] = ak + bj; in FFTRADIX()
615 bj = bkm * s72 + bjm * s2; in FFTRADIX()
616 Re [k1] = ak - bj; in FFTRADIX()
617 Re [k4] = ak + bj; in FFTRADIX()
[all …]
|
| /external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/resolution/typeinference/ |
| D | BoundSet.java | 78 Bound bj = bounds.get(j); in findPairSameAs() local
79 if (bj instanceof SameAsBound) { in findPairSameAs()
80 SameAsBound sj = (SameAsBound)bj; in findPairSameAs()
107 Bound bj = bounds.get(j); in forEachPairSameAs() local
108 if (bj instanceof SameAsBound) { in forEachPairSameAs()
109 SameAsBound sj = (SameAsBound)bj; in forEachPairSameAs()
125 Bound bj = bounds.get(j); in forEachPairSameAndSubtype() local
126 if (bj instanceof SubtypeOfBound) { in forEachPairSameAndSubtype()
127 SubtypeOfBound sj = (SubtypeOfBound)bj; in forEachPairSameAndSubtype()
143 Bound bj = bounds.get(j); in forEachPairSubtypeAndSubtype() local
[all …]
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Conj.pbtxt | 7 complex numbers in `input` must be of the form \\(a + bj\\), where *a* is the
10 The complex conjugate returned by this operation is of the form \\(a - bj\\).
|
| D | api_def_Real.pbtxt | 7 `input` must be complex numbers of the form \\(a + bj\\), where *a* is the real
|
| D | api_def_Imag.pbtxt | 7 elements in `input` must be complex numbers of the form \\(a + bj\\), where *a*
|
| D | api_def_ComplexAbs.pbtxt | 7 elements in `x` must be complex numbers of the form \\(a + bj\\). The absolute
|
| D | api_def_Complex.pbtxt | 7 operation returns complex numbers elementwise of the form \\(a + bj\\), where
|
| D | api_def_Angle.pbtxt | 7 `input` must be complex numbers of the form \\(a + bj\\), where *a*
|
| /external/python/cpython2/Lib/ |
| D | difflib.py | 562 for ai, bj, size in self.get_matching_blocks():
569 if i < ai and j < bj:
573 elif j < bj:
576 answer.append( (tag, i, ai, j, bj) )
577 i, j = ai+size, bj+size
581 answer.append( ('equal', ai, i, bj, j) )
972 bj = b[j]
973 cruncher.set_seq2(bj)
976 if ai == bj:
|
| /external/python/cpython3/Lib/ |
| D | difflib.py | 525 for ai, bj, size in self.get_matching_blocks():
532 if i < ai and j < bj:
536 elif j < bj:
539 answer.append( (tag, i, ai, j, bj) )
540 i, j = ai+size, bj+size
544 answer.append( ('equal', ai, i, bj, j) )
922 bj = b[j]
923 cruncher.set_seq2(bj)
926 if ai == bj:
|
| /external/cronet/net/base/registry_controlled_domains/ |
| D | effective_tld_names_unittest5.gperf | 4 bj, 4 keyword
|
| /external/grpc-grpc/examples/csharp/HelloworldXamarin/ |
| D | .gitignore | 5 [Oo]bj/
|
| /external/cldr/tools/cldr-code/src/main/resources/org/unicode/cldr/util/data/transforms/ |
| D | en-IPA-spellout.txt | 27 [Ww] > dəbjə ;
|
| /external/clang/test/CodeGenCXX/ |
| D | dynamic-cast-hint.cpp | 49 volatile J *bj = dynamic_cast<J *>(b); in test() local
|
| /external/cldr/common/testData/transforms/ |
| D | ja-t-cs-fonipa.txt | 9 bjɛlorusko ビェロルスコ
200 zaːbjɛɦlɪt͡sɛ ザービェフリツェ
|
| D | cs-fonipa-t-cs.txt | 17 Bělorusko bjɛlorusko
214 Záběhlice zaːbjɛɦlɪt͡sɛ
|
| /external/icu/icu4c/source/data/translit/ |
| D | dsb_dsb_FONIPA.txt | 16 bj → bʲ ; # modern spelling
|
| D | cs_FONIPA_ko.txt | 17 bj } $vowel → b ; # objɛc → obeti
|
| D | vec_vec_FONIPA.txt | 31 {ps} {pɾ} {pɾw} {pl} {pj} {pw} {bɾ} {bɾw} {bw} {bj} {bl}
|
| /external/cronet/third_party/icu/source/data/translit/ |
| D | dsb_dsb_FONIPA.txt | 16 bj → bʲ ; # modern spelling
|
| D | cs_FONIPA_ko.txt | 17 bj } $vowel → b ; # objɛc → obeti
|
| D | vec_vec_FONIPA.txt | 31 {ps} {pɾ} {pɾw} {pl} {pj} {pw} {bɾ} {bɾw} {bw} {bj} {bl}
|
| /external/mesa3d/src/mesa/main/ |
| D | mipmap.c | 154 const GLfloat bj = _mesa_half_to_float(rowB[j][e]); \
160 dst[i][e] = _mesa_float_to_half((aj + ak + bj + bk + cj + ck + dj + dk) \
441 GLfloat aj, ak, bj, bk; in do_row() local
444 bj = _mesa_half_to_float(rowB[j][comp]); in do_row()
446 dst[i][comp] = _mesa_float_to_half((aj + ak + bj + bk) * 0.25F); in do_row()
458 GLfloat aj, ak, bj, bk; in do_row() local
461 bj = _mesa_half_to_float(rowB[j][comp]); in do_row()
463 dst[i][comp] = _mesa_float_to_half((aj + ak + bj + bk) * 0.25F); in do_row()
475 GLfloat aj, ak, bj, bk; in do_row() local
478 bj = _mesa_half_to_float(rowB[j][comp]); in do_row()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | ranges_mismatch.pass.cpp | 176 auto [aj, bj] = std::ranges::mismatch(a, a+4, b, b+5); in test()
178 assert(bj == b + 2); in test()
|