| /external/webrtc/webrtc/modules/rtp_rtcp/source/rtcp_packet/ |
| D | extended_jitter_report_unittest.cc | 28 void BuildPacket() { packet = ij.Build(); } in BuildPacket()
38 ExtendedJitterReport ij; member in webrtc::__anon520b6b1a0111::RtcpPacketExtendedJitterReportTest
55 EXPECT_TRUE(ij.WithJitter(0x11121314)); in TEST_F()
65 EXPECT_TRUE(ij.WithJitter(0x11121418)); in TEST_F()
66 EXPECT_TRUE(ij.WithJitter(0x22242628)); in TEST_F()
79 EXPECT_TRUE(ij.WithJitter(i)); in TEST_F()
81 EXPECT_FALSE(ij.WithJitter(kMaxIjItems)); in TEST_F()
85 ij.WithJitter(0x11121418); in TEST_F()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| D | default.pass.cpp | 79 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
118 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| D | default.pass.cpp | 79 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
118 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| D | default.pass.cpp | 80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
119 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| D | default.pass.cpp | 80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
119 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/clang/test/CodeGen/ |
| D | unsigned-overflow.c | 6 unsigned int ii, ij, ik; variable
78 ii = ij + ik; in testintadd()
90 ii = ij - ik; in testintsub()
102 ii = ij * ik; in testintmul()
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| D | default.pass.cpp | 79 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| D | default.pass.cpp | 79 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| D | make_default_searcher.pass.cpp | 64 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
65 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
68 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search.pass.cpp | 92 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
93 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
96 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); in test()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopStrengthReduce/AMDGPU/ |
| D | lsr-void.ll | 14 %ij = phi i32 [ 0, %for.body ], [ %inc14, %for.body.i ]
16 %inc13 = or i32 %ij, 2
26 %inc1 = or i32 %ij, 3
35 %inc14 = add nuw nsw i32 %ij, 4
|
| /external/icu/icu4c/source/test/intltest/ |
| D | testutil.cpp | 282 for (int32_t ij = 0; ij < UPRV_LENGTHOF(ZIG_ZAG); ++ij) { in checkEditsIter() local
283 int32_t j = ZIG_ZAG[ij]; in checkEditsIter()
293 for (int32_t ij = 0; ij < UPRV_LENGTHOF(ZIG_ZAG); ++ij) { in checkEditsIter() local
294 int32_t j = ZIG_ZAG[ij]; in checkEditsIter()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
| D | CorrelatedRandomVectorGenerator.java | 256 int ij = index[j]; in decompose() local
257 double f = c[ii][ij] - e * b[j][rank]; in decompose()
258 c[ii][ij] = f; in decompose()
259 c[ij][ii] = f; in decompose()
|
| /external/icu/icu4c/source/data/translit/ |
| D | pl_FONIPA_ja.txt | 43 b[ij]a → ビャ;
44 b[ij]o → ビョ;
45 b[ij] → ビ;
230 ts[ij] → ツィ ;
|
| D | nl_Title.txt | 9 # Special titlecasing for Dutch initial "ij".
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | xsmm_conv2d_test.cc | 134 int img, ofm, ifm, oj, oi, ij, ii, kj, ki; in naive_conv_fp() local
146 ij = oj * stride_h - pad_h; in naive_conv_fp()
150 if (ij + kj < 0 || ij + kj >= ifh) continue; in naive_conv_fp()
155 LIBXSMM_VLA_ACCESS(4, input_t, img, ifm, ij + kj, ii + ki, in naive_conv_fp()
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/data/transformtest/ |
| D | kk-fonipa-t-kk.txt | 43 Виктория viktu̯ʊɾijɑ
52 Григорий ɡɾiɡu̯ʊɾij
209 Неонатология ni̯ɘu̯ʊnɑtu̯ʊlu̯ʊɡijɑ
270 Сирияның siɾijɑnəŋ
427 биология biu̯ʊlu̯ʊɡijɑ
486 дилогиясында dilu̯ʊɡijɑsəndɑ
488 директориясын diɾi̯ɘktu̯ʊɾijɑsən
524 жариялау ʒɑɾijɑlɑw
577 идеологиясына idi̯ɘu̯ʊlu̯ʊɡijɑsənɑ
583 империя impi̯ɘɾijɑ
[all …]
|
| D | ky-fonipa-t-ky.txt | 341 Чехиянын t͡ʃeχijɑnɯn
397 антропология ɑntropoloɡijɑ
435 биология bioloɡijɑ
500 диалектологиясын diɑlektoloɡijɑsɯn
594 ийген ijɡen
595 ийгиликке ijɡilikːe
596 ийгиликтер ijɡilikter
754 морфологиясын morfoloɡijɑsɯn
808 психологиялык psiχoloɡijɑlɯq
809 психологиясы psiχoloɡijɑsɯ
[all …]
|
| D | ug-fonipa-t-ug.txt | 16 بېلگىيە belɡijɛ
353 نورۋېگىيە norweɡijɛ
412 گېئولوگىيە ɡeʔoloɡijɛ
736 ئاددىي ʔadːij
918 ئىدېئولوگىيە ʔideʔoloɡijɛ
955 تاللىي talːij
1551 مىللىي milːij
1819 جىيەن d͡ʒijɛn
1867 بېرىللىي berilːij
|
| /external/pdfium/third_party/agg23/ |
| D | agg_vcgen_stroke.h | 48 void inner_join(inner_join_e ij) in inner_join() argument
50 m_inner_join = ij; in inner_join()
|
| D | agg_conv_stroke.h | 44 void inner_join(inner_join_e ij) in inner_join()
46 base_type::generator().inner_join(ij); in inner_join()
|
| /external/tensorflow/tensorflow/contrib/factorization/g3doc/ |
| D | wals.md | 29 - $$W$$ is a weight matrix of the form $$W_{i, j} = w_0 + 1_{A_{ij} \neq 0}R_i
52 &= \sum_{(i, j) \in S} (w_0 + R_i C_j) (A_{ij} - \bracket{u_i}{v_j})^2 +
54 &= \sum_{(i, j) \in S} \left( (w_0 + R_i C_j) (A_{ij} - \bracket{u_i}{v_j})^2 -
|
| /external/fonttools/Tests/mtiLib/data/mti/ |
| D | gsubligature.txt | 23 ij i j
|
| /external/webp/src/dsp/ |
| D | upsampling_sse41.c | 43 #define GET_M(ij, in, out) do { \ argument
45 const __m128i tmp1 = _mm_and_si128((ij), st); /* (ij) & (s^t) */ \
|
| /external/deqp-deps/glslang/Test/ |
| D | decls.frag | 15 int ij, ik5[5] = int[](5, 6, 7, 8, 9);
|