/art/test/Interfaces/ |
Interfaces.java | 24 public void j2(); method in interface:Interfaces.J 32 public void j2() {}; method in class:Interfaces.A 36 public void j2() {}; method in class:Interfaces.B
|
/external/webrtc/src/modules/audio_processing/aec/ |
aec_rdft.c | 318 int j0, j1, j2, j3, k, k1, k2, m2; local 324 j2 = j0 + 16; 330 x2r = a[j2 + 0] + a[j3 + 0]; 331 x2i = a[j2 + 1] + a[j3 + 1]; 332 x3r = a[j2 + 0] - a[j3 + 0]; 333 x3i = a[j2 + 1] - a[j3 + 1]; 336 a[j2 + 0] = x0r - x2r; 337 a[j2 + 1] = x0i - x2i; 346 j2 = j0 + 16; 352 x2r = a[j2 + 0] + a[j3 + 0] 442 int j, j1, j2, j3, l; local 472 int j, j1, j2, j3, l; local 504 int j1, j2, k1, k2; local 525 int j1, j2, k1, k2; local [all...] |
aec_rdft_sse2.c | 244 int j1, j2, k1, k2; local 253 for (j1 = 1, j2 = 2; j2 + 7 < 64; j1 += 4, j2 += 8) { 262 const __m128 a_j2_0 = _mm_loadu_ps(&a[0 + j2]); // 2, 3, 4, 5, 263 const __m128 a_j2_4 = _mm_loadu_ps(&a[4 + j2]); // 6, 7, 8, 9, 264 const __m128 a_k2_0 = _mm_loadu_ps(&a[122 - j2]); // 120, 121, 122, 123, 265 const __m128 a_k2_4 = _mm_loadu_ps(&a[126 - j2]); // 124, 125, 126, 127, 289 // a[j2 + 0] -= yr; 290 // a[j2 + 1] -= yi 334 int j1, j2, k1, k2; local [all...] |
/external/eigen/Eigen/src/Core/products/ |
SelfadjointMatrixMatrix.h | 88 for(Index j2=0; j2<k2; j2+=nr) 92 blockB[count+0] = rhs(k,j2+0); 93 blockB[count+1] = rhs(k,j2+1); 96 blockB[count+2] = rhs(k,j2+2); 97 blockB[count+3] = rhs(k,j2+3); 104 for(Index j2=k2; j2<(std::min)(k2+rows,packet_cols); j2+=nr [all...] |
TriangularSolverMatrix.h | 99 for(Index j2=0; j2<cols; j2+=subcols) 101 Index actual_cols = (std::min)(cols-j2,subcols); 115 for (Index j=j2; j<j2+actual_cols; ++j) 144 pack_rhs(blockB+actual_kc*j2, &other(startBlock,j2), otherStride, actualPanelWidth, actual_cols, actual_kc, blockBOffset); 153 gebp_kernel(&other(startTarget,j2), otherStride, blockA, blockB+actual_kc*j2, lengthTarget, actualPanelWidth, actual_cols, Scalar(-1) local [all...] |
TriangularMatrixMatrix.h | 288 for (Index j2=0; j2<actual_kc; j2+=SmallPanelWidth) 290 Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth); 291 Index actual_j2 = actual_k2 + j2; 292 Index panelOffset = IsLower ? j2+actualPanelWidth : 0; 293 Index panelLength = IsLower ? actual_kc-j2-actualPanelWidth : j2; 295 pack_rhs_panel(blockB+j2*actual_kc, 309 pack_rhs_panel(blockB+j2*actual_kc [all...] |
GeneralBlockPanelKernel.h | 550 for(Index j2=0; j2<packet_cols; j2+=nr) 552 traits.unpackRhs(depth*nr,&blockB[j2*strideB+offsetB*nr],unpackedB); 573 ResScalar* r0 = &res[(j2+0)*resStride + i]; 931 ResScalar* r0 = &res[(j2+0)*resStride + i]; [all...] |
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.unqual/ |
p14.cpp | 14 extern S j2; 19 N::S N::j2(i);
|
/external/svox/pico/lib/ |
picofftsg.c | 1707 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local 2034 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local 2248 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
jsdifflib.js | 260 j2 = block[1]; 262 if (i1 + k1 == i2 && j1 + k1 == j2) { 267 j1 = j2; 319 var code, tag, i1, i2, j1, j2; 326 j2 = code[4]; 327 codes[0] = [tag, Math.max(i1, i2 - n), i2, Math.max(j1, j2 - n), j2]; 335 j2 = code[4]; 336 codes[codes.length - 1] = [tag, i1, Math.min(i2, i1 + n), j1, Math.min(j2, j1 + n)]; 348 j2 = code[4] [all...] |
/external/webrtc/src/modules/audio_processing/utility/ |
fft4g.c | 904 int j, j1, j2, j3, l; local 919 j2 = j1 + l; 920 j3 = j2 + l; 925 x2r = a[j2] + a[j3]; 926 x2i = a[j2 + 1] + a[j3 + 1]; 927 x3r = a[j2] - a[j3]; 928 x3i = a[j2 + 1] - a[j3 + 1]; 931 a[j2] = x0r - x2r; 932 a[j2 + 1] = x0i - x2i; 954 int j, j1, j2, j3, l local 1109 int j, j1, j2, j3, k, k1, k2, m, m2; local [all...] |
/external/clang/test/CXX/over/over.match/over.match.best/over.ics.rank/ |
p3-0x.cpp | 15 int &j2 = g2(i); member in namespace:std_example
|
/external/clang/test/SemaCXX/ |
dr1301.cpp | 60 int j2 = J().f(); // ok variable
|
address-of-temporary.cpp | 48 void j2() { (void)S { A{} }; } function in namespace:PointerToArrayDecay
|
/external/eigen/Eigen/src/LU/ |
Inverse.h | 121 j2 = (j+2) % 3 enumerator in enum:Eigen::internal::__anon19694 123 return m.coeff(i1, j1) * m.coeff(i2, j2) 124 - m.coeff(i1, j2) * m.coeff(i2, j1); 189 (const MatrixBase<Derived>& matrix, int i1, int i2, int i3, int j1, int j2, int j3) 192 * (matrix.coeff(i2,j2) * matrix.coeff(i3,j3) - matrix.coeff(i2,j3) * matrix.coeff(i3,j2)); 203 j2 = (j+2) % 4, enumerator in enum:Eigen::internal::__anon19695 206 return general_det3_helper(matrix, i1, i2, i3, j1, j2, j3) 207 + general_det3_helper(matrix, i2, i3, i1, j1, j2, j3) 208 + general_det3_helper(matrix, i3, i1, i2, j1, j2, j3) [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
prog_noise.c | 353 int i2, j2, k2; /* Offsets for third corner of simplex in (i,j,k) coords */ local 362 j2 = 1; 370 j2 = 0; 378 j2 = 0; 388 j2 = 1; 396 j2 = 1; 404 j2 = 1; 419 y2 = y0 - j2 + 2.0f * G3; 455 t2 * t2 * grad3(perm[ii + i2 + perm[jj + j2 + perm[kk + k2]]], x2, 526 int i2, j2, k2, l2; /* The integer offsets for the third simplex corner * local [all...] |
/external/mesa3d/src/mesa/program/ |
prog_noise.c | 353 int i2, j2, k2; /* Offsets for third corner of simplex in (i,j,k) coords */ local 362 j2 = 1; 370 j2 = 0; 378 j2 = 0; 388 j2 = 1; 396 j2 = 1; 404 j2 = 1; 419 y2 = y0 - j2 + 2.0f * G3; 455 t2 * t2 * grad3(perm[ii + i2 + perm[jj + j2 + perm[kk + k2]]], x2, 526 int i2, j2, k2, l2; /* The integer offsets for the third simplex corner * local [all...] |
/external/chromium_org/courgette/ |
disassembler_elf_32_arm.cc | 74 uint32 j2 = (arm_op & (1 << 11)) >> 11; local 79 uint32 i2 = ~(j2 ^ S) & 1; 113 uint32 j2 = (arm_op & (1 << 11)) >> 11; local 116 temp |= (S << 20) | (j1 << 19) | (j2 << 18); 166 uint32 j2 = ((~i2) ^ S) & 1; local 169 temp |= j2 << 11; 187 uint32 j2 = (addr & (1 << 18)) >> 18; local 190 temp |= j2 << 11;
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
difflib.py | 196 # a list of (tag, i1, i2, j1, j2) tuples, where tag is 198 # 'replace' a[i1:i2] should be replaced by b[j1:j2] 200 # 'insert' b[j1:j2] should be inserted 201 # 'equal' a[i1:i2] == b[j1:j2] 510 for i2, j2, k2 in matching_blocks: 512 if i1 + k1 == i2 and j1 + k1 == j2: 523 i1, j1, k1 = i2, j2, k2 534 Each tuple is of the form (tag, i1, i2, j1, j2). The first tuple 536 tuple preceding it, and likewise for j1 == the previous j2. 540 'replace': a[i1:i2] should be replaced by b[j1:j2] [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
difflib.py | 196 # a list of (tag, i1, i2, j1, j2) tuples, where tag is 198 # 'replace' a[i1:i2] should be replaced by b[j1:j2] 200 # 'insert' b[j1:j2] should be inserted 201 # 'equal' a[i1:i2] == b[j1:j2] 510 for i2, j2, k2 in matching_blocks: 512 if i1 + k1 == i2 and j1 + k1 == j2: 523 i1, j1, k1 = i2, j2, k2 534 Each tuple is of the form (tag, i1, i2, j1, j2). The first tuple 536 tuple preceding it, and likewise for j1 == the previous j2. 540 'replace': a[i1:i2] should be replaced by b[j1:j2] [all...] |
/external/eigen/test/ |
product_extra.cpp | 94 Index j2 = internal::random<Index>(0,m1.cols()-1); local 96 VERIFY_IS_APPROX(m1.col(j2).adjoint() * m1.block(0,j,m1.rows(),c), m1.col(j2).adjoint().eval() * m1.block(0,j,m1.rows(),c).eval());
|
/packages/apps/Camera/jni/feature_mos/src/mosaic/ |
Pyramid.cpp | 156 int j2 = j * 2; local 161 scr->ptr[j2][i] = (short) 163 scr->ptr[j2+1][i] = (short)((t1 + t2 + 1) >> 1);
|
/packages/apps/Camera2/jni/feature_mos/src/mosaic/ |
Pyramid.cpp | 156 int j2 = j * 2; local 161 scr->ptr[j2][i] = (short) 163 scr->ptr[j2+1][i] = (short)((t1 + t2 + 1) >> 1);
|
/packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
Pyramid.cpp | 156 int j2 = j * 2; local 158 scr->ptr[j2][i] = (short) 160 scr->ptr[j2+1][i] = (short)((in->ptr[j][i] + in->ptr[j+1][i] + 1) >> 1);
|
/cts/apps/CtsVerifier/include/colorchecker/ |
colorcheckertest.h | 83 void findBestMatch(int i1, int i2, int j1, int j2);
|