Searched defs:index1 (Results 1 - 25 of 52) sorted by relevance

123

/external/libexif/libexif/pentax/
H A Dmnote-pentax-entry.c271 int index1, index2; member in struct:__anon8010::__anon8011
380 || ((items2[i].elem[j].index2 == vs2) && (items2[i].elem[j].index1 < vs))); j++);
381 if ((items2[i].elem[j].index1 != vs) || (items2[i].elem[j].index2 != vs2)) {
/external/icu/icu4c/source/common/
H A Dutrie2_impl.h143 int32_t index1[UNEWTRIE2_INDEX_1_LENGTH]; member in struct:UNewTrie2
/external/jmonkeyengine/engine/src/core/com/jme3/math/
H A DEigen3f.java183 * @param index1
187 private void computeVectors(Matrix3f mat, Vector3f vect, int index1, argument
233 p00 = eigenValues[index1] - vect.dot(tempVect);
235 p11 = eigenValues[index1] - vectorS.dot(mat.mult(vectorS));
253 eigenVectors[index1] = vect.mult(p01).add(vectorS.mult(p00));
258 eigenVectors[index1] = vect.mult(p11).add(vectorS.mult(p01));
262 eigenVectors[index1].set(vectorS);
264 eigenVectors[index1].set(vect);
268 eigenVectors[index3].cross(eigenVectors[index1], eigenVectors[index2]);
/external/v8/test/cctest/
H A Dtest-liveedit.cc51 bool Equals(int index1, int index2) { argument
52 return s1_[index1] == s2_[index2];
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DPropsVectors.java46 // elements in v starting from index1 to index1 + length - 1
49 private boolean areElementsSame(int index1, int[] target, int index2, argument
52 if (v[index1 + i] != target[index2 + i]) {
H A DTrie2Writable.java118 index1[i]=j;
123 index1[i]=UNEWTRIE2_INDEX_2_NULL_OFFSET;
159 i2=index1[c>>UTRIE2_SHIFT_1]+
192 i2=index1[i1];
195 index1[i1]=i2;
326 this.index1 = tempTrie.index1;
588 i2=index1[c>>UTRIE2_SHIFT_1]+
679 i2Block=index1[--i1];
899 index1[
1186 private int[] index1 = new int[UNEWTRIE2_INDEX_1_LENGTH]; field in class:Trie2Writable
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/
H A DBIHTree.java377 public void swapTriangles(int index1, int index2) { argument
378 int p1 = index1 * 9;
391 int tmp2 = triIndices[index1];
392 triIndices[index1] = triIndices[index2];
/external/jmonkeyengine/engine/src/core/com/jme3/scene/
H A DNode.java398 * @param index1 The index of the first child to swap
401 public void swapChildren(int index1, int index2) { argument
403 Spatial c1 = children.remove(index1);
404 children.add(index1, c2);
/external/libyuv/files/source/
H A Dformat_conversion.cc85 int index1 = (selector >> 8) & 0xff; local
89 dst_bayer[1] = src_argb[index1];
/external/mesa3d/src/gallium/auxiliary/tgsi/
H A Dtgsi_sanity.c87 uint file, uint index1, uint index2)
91 reg->indices[0] = index1;
86 fill_scan_register2d(scan_register *reg, uint file, uint index1, uint index2) argument
/external/pdfium/third_party/freetype/src/type1/
H A Dt1afm.c92 FT_ULong index1 = KERN_INDEX( pair1->index1, pair1->index2 ); local
93 FT_ULong index2 = KERN_INDEX( pair2->index1, pair2->index2 );
96 if ( index1 > index2 )
98 else if ( index1 < index2 )
202 kp->index1 = FT_Get_Char_Index( t1_face, p[0] );
337 midi = KERN_INDEX( mid->index1, mid->index2 );
/external/skia/src/core/
H A DSkLineClipper.cpp97 int index0, index1; local
101 index1 = 1;
104 index1 = 0;
114 if (tmp[index1].fY > clip.fBottom) {
115 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom);
120 index1 = 1;
123 index1 = 0;
127 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) &&
128 tmp[index0].fX < tmp[index1].fX) {
136 if (tmp[index1]
188 int index0, index1; local
[all...]
/external/nist-sip/java/gov/nist/javax/sip/header/
H A DSIPHeaderList.java633 public java.util.List<HDR> subList(int index1, int index2) { argument
634 return this.hlist.subList(index1, index2);
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/builder/
H A DMutableMethodImplementation.java305 public void swapInstructions(int index1, int index2) { argument
306 if (index1 >= instructionList.size() - 1 || index2 >= instructionList.size() - 1) {
309 MethodLocation first = instructionList.get(index1);
325 if (index2 < index1) {
327 index2 = index1;
328 index1 = tmp;
332 for (int i=index1+1; i<=index2; i++) {
/external/vboot_reference/utility/
H A Dbmpblk_utility.cc256 int depth = 0, index1 = 0, index2 = 0; local
267 screen.data.images[index1].x = atoi((char*)event.data.scalar.value);
270 screen.data.images[index1].y = atoi((char*)event.data.scalar.value);
273 screen.image_names[index1] = (char*)event.data.scalar.value;
281 if (screen.image_names[index1] == RENDER_HWID) {
286 } else if (screen.image_names[index1] == RENDER_HWID_RTOL) {
301 index1++;
/external/aac/libFDK/src/
H A Dfixpoint_math.cpp294 UINT index1 = (UINT)(LONG)(x >> 20) & 0x1F; local
297 UINT lookup1 = exp2_tab_long[index1]*set_zero;
/external/ceres-solver/internal/ceres/
H A Dcovariance_impl.cc292 int index1 = FindOrDie(parameter_block_to_row_index_, block_pair.first); local
299 if (index1 > index2) {
/external/freetype/include/internal/
H A Dt1types.h160 FT_UInt index1; member in struct:AFM_KernPairRec_
/external/freetype/src/pshinter/
H A Dpshrec.c372 FT_UInt index1,
375 PS_Mask mask1 = table->masks + index1;
404 FT_UInt index1,
411 /* swap index1 and index2 so that index1 < index2 */
412 if ( index1 > index2 )
417 temp = index1;
418 index1 = index2;
422 if ( index1 < index2 && index2 < table->num_masks )
424 /* we need to merge the bitsets of index1 an
371 ps_mask_table_test_intersect( PS_Mask_Table table, FT_UInt index1, FT_UInt index2 ) argument
403 ps_mask_table_merge( PS_Mask_Table table, FT_UInt index1, FT_UInt index2, FT_Memory memory ) argument
503 FT_Int index1, index2; local
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dtransapi.cpp442 UTransPosition index1[]={ local
449 for(uint32_t i=0; i<sizeof(index1)/sizeof(index1[0]); i++){
451 t->transliterate(rs, index1[i], insertion, status);
/external/opencv/cv/src/
H A Dcvconvhull.cpp610 int index1, index2, index3; local
615 CV_CALL( index1 = cvSeqElemIdx( ptseq, pos ));
625 index1 = *CV_SEQ_ELEM( hull, int, 0 );
630 sign += (index2 > index1) ? 1 : 0;
632 sign += (index1 > index3) ? 1 : 0;
/external/pdfium/third_party/freetype/include/internal/
H A Dt1types.h160 FT_Int index1; member in struct:AFM_KernPairRec_
/external/pdfium/third_party/freetype/src/pshinter/
H A Dpshrec.c375 FT_Int index1,
378 PS_Mask mask1 = table->masks + index1;
407 FT_Int index1,
415 /* swap index1 and index2 so that index1 < index2 */
416 if ( index1 > index2 )
418 temp = index1;
419 index1 = index2;
423 if ( index1 < index2 && index1 >
374 ps_mask_table_test_intersect( PS_Mask_Table table, FT_Int index1, FT_Int index2 ) argument
406 ps_mask_table_merge( PS_Mask_Table table, FT_Int index1, FT_Int index2, FT_Memory memory ) argument
501 FT_Int index1, index2; local
[all...]
/external/skia/src/effects/gradients/
H A DSkLinearGradient.cpp135 int index1 = index0; local
137 index1 += 1;
139 SkPMColor lerp = SkFastFourByteInterp(cache[index1], cache[index0], remainder);
141 index1 ^= SkGradientShaderBase::kDitherStride32;
142 SkPMColor dlerp = SkFastFourByteInterp(cache[index1], cache[index0], remainder);
/external/skia/tests/
H A DPathOpsCubicIntersectionTest.cpp506 static void intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, argument
509 const SkDCubic& cubic2 = newTestSet[index1];

Completed in 4321 milliseconds

123