/external/skqp/src/core/ |
D | SkLineClipper.cpp | 110 int index0, index1; in IntersectLine() local 114 index1 = 1; in IntersectLine() 117 index1 = 0; in IntersectLine() 127 if (tmp[index1].fY > clip.fBottom) { in IntersectLine() 128 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom); in IntersectLine() 133 index1 = 1; in IntersectLine() 136 index1 = 0; in IntersectLine() 140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) { in IntersectLine() 151 if (tmp[index1].fX > clip.fRight) { in IntersectLine() 152 tmp[index1].set(clip.fRight, sect_with_vertical(src, clip.fRight)); in IntersectLine() [all …]
|
/external/skia/src/core/ |
D | SkLineClipper.cpp | 110 int index0, index1; in IntersectLine() local 114 index1 = 1; in IntersectLine() 117 index1 = 0; in IntersectLine() 127 if (tmp[index1].fY > clip.fBottom) { in IntersectLine() 128 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom); in IntersectLine() 133 index1 = 1; in IntersectLine() 136 index1 = 0; in IntersectLine() 140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) { in IntersectLine() 151 if (tmp[index1].fX > clip.fRight) { in IntersectLine() 152 tmp[index1].set(clip.fRight, sect_with_vertical(src, clip.fRight)); in IntersectLine() [all …]
|
/external/python/cpython3/Lib/idlelib/ |
D | undo.py | 85 def delete(self, index1, index2=None): argument 86 self.addcmd(DeleteCommand(index1, index2)) 167 def __init__(self, index1, index2, chars, tags=None): argument 170 self.index1 = index1 178 t = (self.index1, self.index2, self.chars, self.tags) 210 def __init__(self, index1, chars, tags=None): argument 211 Command.__init__(self, index1, None, chars, tags) 215 self.index1 = text.index(self.index1) 216 if text.compare(self.index1, ">", "end-1c"): 218 self.index1 = text.index("end-1c") [all …]
|
D | colorizer.py | 138 def delete(self, index1, index2=None): argument 140 index1 = self.index(index1) 141 self.delegate.delete(index1, index2) 142 self.notify_range(index1) 144 def notify_range(self, index1, index2=None): argument 146 self.tag_add("TODO", index1, index2)
|
/external/python/cpython2/Lib/idlelib/ |
D | UndoDelegator.py | 83 def delete(self, index1, index2=None): argument 84 self.addcmd(DeleteCommand(index1, index2)) 166 def __init__(self, index1, index2, chars, tags=None): argument 169 self.index1 = index1 177 t = (self.index1, self.index2, self.chars, self.tags) 210 def __init__(self, index1, chars, tags=None): argument 211 Command.__init__(self, index1, None, chars, tags) 215 self.index1 = text.index(self.index1) 216 if text.compare(self.index1, ">", "end-1c"): 218 self.index1 = text.index("end-1c") [all …]
|
D | ColorDelegator.py | 86 def delete(self, index1, index2=None): argument 87 index1 = self.index(index1) 88 self.delegate.delete(index1, index2) 89 self.notify_range(index1) 95 def notify_range(self, index1, index2=None): argument 96 self.tag_add("TODO", index1, index2)
|
/external/tensorflow/tensorflow/contrib/image/kernels/ |
D | bipartite_match_op.cc | 24 DistancePair(int i1, int i2, double d) : index1(i1), index2(i2), dist(d) {} in DistancePair() 28 int index1, index2; member 95 for (int index1 = 0; index1 < num_valid_rows; index1++) { in Compute() local 98 DistancePair(index1, index2, distance_mat(index1, index2))); in Compute() 107 if (row_to_col_match_vec[match.index1] == -1 && in Compute() 109 row_to_col_match_vec[match.index1] = match.index2; in Compute() 110 col_to_row_match_vec[match.index2] = match.index1; in Compute()
|
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/test/QA/ |
D | runiSACfixfloat.txt | 18 index1=0 27 $ISACFIXFLOAT $INDIR/$channel -m 1 -PLC $INDIR/"$file" $OUTDIR/flfx$index1"$file" >> $LOGFILE 28 $ISACFIXFLOAT $INDIR/$channel -m 2 -PLC $INDIR/"$file" $OUTDIR/fxfl$index1"$file" >> $LOGFILE 33 index1=0 38 $ISACFIXFLOAT $INDIR/$channel -m 1 -NB 1 $INDIR/"$file" $OUTDIR/flfxnb1_$index1"$file" >> $LOGFILE 39 $ISACFIXFLOAT $INDIR/$channel -m 2 -NB 1 $INDIR/"$file" $OUTDIR/fxflnb1_$index1"$file" >> $LOGFILE 40 …$ISACFIXFLOAT $INDIR/$channel -m 1 -NB 2 -PLC $INDIR/"$file" $OUTDIR/flfxnb2_$index1"$file" >> $LO… 41 …$ISACFIXFLOAT $INDIR/$channel -m 2 -NB 2 -PLC $INDIR/"$file" $OUTDIR/fxflnb2_$index1"$file" >> $LO…
|
D | runiSACNB.txt | 22 index1=0 32 $ISAC $rate -FL 30 -NB 1 $INDIR/"$file" $OUTDIR/nb130_$index1"$file" >> $LOGFILE 33 $ISAC $rate -FL 60 -NB 1 $INDIR/"$file" $OUTDIR/nb160_$index1"$file" >> $LOGFILE 34 $ISAC $rate -FL 30 -NB 2 $INDIR/"$file" $OUTDIR/nb230_$index1"$file" >> $LOGFILE 35 $ISAC $rate -FL 60 -NB 2 $INDIR/"$file" $OUTDIR/nb260_$index1"$file" >> $LOGFILE 36 $ISAC $rate -FL 30 -NB 2 -PL 10 $INDIR/"$file" $OUTDIR/nb2plc30_$index1"$file" >> $LOGFILE 37 $ISAC $rate -FL 60 -NB 2 -PL 10 $INDIR/"$file" $OUTDIR/nb2plc60_$index1"$file" >> $LOGFILE
|
D | runiSACLongtest.txt | 22 index1=0 31 $ISAC -I $rate -FL 30 $INDIR/"$file" $OUTDIR/i30_$index1"$file" >> $LOGFILE 32 $ISAC -I $rate -FL 60 $INDIR/"$file" $OUTDIR/i60_$index1"$file" >> $LOGFILE 42 index1=0 47 …$ISAC $INDIR/${CHANNELLIST[0]} -FL 30 -FIXED_FL $INDIR/"$file" $OUTDIR/a30_$index1"$file" >> $LOGF… 48 …$ISAC $INDIR/${CHANNELLIST[0]} -FL 60 -FIXED_FL $INDIR/"$file" $OUTDIR/a60_$index1"$file" >> $LOGF… 52 …$ISAC $INDIR/${CHANNELLIST[0]} -INITRATE 25000 -FL 30 $INDIR/"$file" $OUTDIR/a60_$index1"$file" >>…
|
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/test/QA/ |
D | runiSACfixfloat.txt | 18 index1=0 27 $ISACFIXFLOAT $INDIR/$channel -m 1 -PLC $INDIR/"$file" $OUTDIR/flfx$index1"$file" >> $LOGFILE 28 $ISACFIXFLOAT $INDIR/$channel -m 2 -PLC $INDIR/"$file" $OUTDIR/fxfl$index1"$file" >> $LOGFILE 33 index1=0 38 $ISACFIXFLOAT $INDIR/$channel -m 1 -NB 1 $INDIR/"$file" $OUTDIR/flfxnb1_$index1"$file" >> $LOGFILE 39 $ISACFIXFLOAT $INDIR/$channel -m 2 -NB 1 $INDIR/"$file" $OUTDIR/fxflnb1_$index1"$file" >> $LOGFILE 40 …$ISACFIXFLOAT $INDIR/$channel -m 1 -NB 2 -PLC $INDIR/"$file" $OUTDIR/flfxnb2_$index1"$file" >> $LO… 41 …$ISACFIXFLOAT $INDIR/$channel -m 2 -NB 2 -PLC $INDIR/"$file" $OUTDIR/fxflnb2_$index1"$file" >> $LO…
|
/external/libldac/src/ |
D | mdct_ldac.c | 29 int coef, index0, index1, offset; in proc_mdct_core_ldac() local 57 index1 = 1 << (i+1); in proc_mdct_core_ldac() 66 c = p_work[index1+0] * cc + p_work[index1+1] * cs; in proc_mdct_core_ldac() 67 d = p_work[index1+0] * cs - p_work[index1+1] * cc; in proc_mdct_core_ldac() 71 p_work[index1+0] = a - c; in proc_mdct_core_ldac() 72 p_work[index1+1] = b - d; in proc_mdct_core_ldac() 74 index1 += offset; in proc_mdct_core_ldac() 77 index1 += 2 - nsmpl; in proc_mdct_core_ldac()
|
D | mdct_fixp_ldac.c | 29 INT32 coef, index0, index1, offset; in proc_mdct_core_ldac() local 79 index1 = 1 << (i+1); in proc_mdct_core_ldac() 84 g0 = mul_rsftrnd_ldac(a_work[index1], p_c[coef], LDAC_Q_MDCT_COS+1); in proc_mdct_core_ldac() 85 g1 = mul_rsftrnd_ldac(a_work[index1+1], p_s[coef], LDAC_Q_MDCT_SIN+1); in proc_mdct_core_ldac() 88 g0 = mul_rsftrnd_ldac(a_work[index1], p_s[coef], LDAC_Q_MDCT_SIN+1); in proc_mdct_core_ldac() 89 g1 = mul_rsftrnd_ldac(a_work[index1+1], p_c[coef], LDAC_Q_MDCT_COS+1); in proc_mdct_core_ldac() 97 a_work[index1] = g0 - g2; in proc_mdct_core_ldac() 98 a_work[index1+1] = g1 - g3; in proc_mdct_core_ldac() 101 index1 += 2; in proc_mdct_core_ldac() 105 index1 += offset; in proc_mdct_core_ldac()
|
/external/libchrome/base/task/sequence_manager/ |
D | intrusive_heap_unittest.cc | 50 HeapHandle index1; in TEST_F() local 52 heap.insert({11, &index1}); in TEST_F() 54 EXPECT_TRUE(index1.IsValid()); in TEST_F() 58 EXPECT_FALSE(index1.IsValid()); in TEST_F() 62 HeapHandle index1; in TEST_F() local 67 heap.insert({11, &index1}); in TEST_F() 69 EXPECT_TRUE(index1.IsValid()); in TEST_F() 72 EXPECT_FALSE(index1.IsValid()); in TEST_F() 94 HeapHandle index1; in TEST_F() local 118 HeapHandle index1; in TEST_F() local [all …]
|
/external/protobuf/javanano/src/main/java/com/google/protobuf/nano/ |
D | InternalNano.java | 206 int index1 = 0; in equals() local 211 while (index1 < length1 && field1[index1] == null) { in equals() 212 index1++; in equals() 217 boolean atEndOf1 = index1 >= length1; in equals() 225 } else if (!Arrays.equals(field1[index1], field2[index2])) { in equals() 229 index1++; in equals() 241 int index1 = 0; in equals() local 246 while (index1 < length1 && field1[index1] == null) { in equals() 247 index1++; in equals() 252 boolean atEndOf1 = index1 >= length1; in equals() [all …]
|
/external/tensorflow/tensorflow/core/kernels/neon/ |
D | types.h | 49 int MatchingArraySize(const ArrayType1& array1, int index1, in MatchingArraySize() argument 51 DCHECK_EQ(ArraySize(array1, index1), ArraySize(array2, index2)); in MatchingArraySize() 52 return ArraySize(array1, index1); in MatchingArraySize() 56 int MatchingArraySize(const ArrayType1& array1, int index1, in MatchingArraySize() argument 58 DCHECK_EQ(ArraySize(array1, index1), ArraySize(array2, index2)); in MatchingArraySize() 59 return MatchingArraySize(array1, index1, args...); in MatchingArraySize()
|
/external/protobuf/src/google/protobuf/util/ |
D | message_differencer.cc | 560 int index1 = 0; in CombineFields() local 563 while (index1 < fields1.size() && index2 < fields2.size()) { in CombineFields() 564 const FieldDescriptor* field1 = fields1[index1]; in CombineFields() 569 combined_fields->push_back(fields1[index1]); in CombineFields() 571 ++index1; in CombineFields() 578 combined_fields->push_back(fields1[index1]); in CombineFields() 579 ++index1; in CombineFields() 749 int index1, int index2) { in IsMatch() argument 753 *message1, *message2, repeated_field, index1, index2, in IsMatch() 766 *message1, *message2, repeated_field, index1, index2, in IsMatch() [all …]
|
/external/archive-patcher/generator/src/test/java/com/google/archivepatcher/generator/bsdiff/ |
D | SuffixSorterTestBase.java | 131 RandomAccessObject input, int index1, int index2) throws Exception { in checkSuffixLessThanOrEqual() argument 133 if (index1 == input.length()) { in checkSuffixLessThanOrEqual() 136 input.seek(index1); in checkSuffixLessThanOrEqual() 146 index1++; in checkSuffixLessThanOrEqual() 155 int index1 = suffixArray.readInt(); in assertSorted() local 158 if (!checkSuffixLessThanOrEqual(input, index1, index2)) { in assertSorted()
|
/external/python/cpython3/Lib/idlelib/idle_test/ |
D | mock_tk.py | 197 def get(self, index1, index2=None): argument 200 startline, startchar = self._decode(index1) 216 def delete(self, index1, index2=None): argument 222 startline, startchar = self._decode(index1, -1) 247 def compare(self, index1, op, index2): argument 248 line1, char1 = self._decode(index1) 276 def tag_remove(self, tagName, index1, index2=None): argument
|
/external/python/cpython2/Lib/idlelib/idle_test/ |
D | mock_tk.py | 197 def get(self, index1, index2=None): argument 200 startline, startchar = self._decode(index1) 216 def delete(self, index1, index2=None): argument 222 startline, startchar = self._decode(index1, -1) 247 def compare(self, index1, op, index2): argument 248 line1, char1 = self._decode(index1) 276 def tag_remove(self, tagName, index1, index2=None): argument
|
/external/freetype/src/pshinter/ |
D | pshrec.c | 372 FT_UInt index1, in ps_mask_table_test_intersect() argument 375 PS_Mask mask1 = table->masks + index1; in ps_mask_table_test_intersect() 404 FT_UInt index1, in ps_mask_table_merge() argument 412 if ( index1 > index2 ) in ps_mask_table_merge() 417 temp = index1; in ps_mask_table_merge() 418 index1 = index2; in ps_mask_table_merge() 422 if ( index1 < index2 && index2 < table->num_masks ) in ps_mask_table_merge() 426 PS_Mask mask1 = table->masks + index1; in ps_mask_table_merge() 489 index1, index2 )); in ps_mask_table_merge() 503 FT_Int index1, index2; in ps_mask_table_merge_all() local [all …]
|
/external/proguard/src/proguard/ |
D | ConfigurationChecker.java | 191 for (int index1 = 0; index1 < classPath1.size(); index1++) in checkConflicts() 193 ClassPathEntry entry1 = classPath1.get(index1); in checkConflicts() 197 if (classPath1 != classPath2 || index1 != index2) in checkConflicts()
|
/external/freetype/src/type1/ |
D | t1afm.c | 94 FT_ULong index1 = KERN_INDEX( pair1->index1, pair1->index2 ); in compare_kern_pairs() local 95 FT_ULong index2 = KERN_INDEX( pair2->index1, pair2->index2 ); in compare_kern_pairs() 98 if ( index1 > index2 ) in compare_kern_pairs() 100 else if ( index1 < index2 ) in compare_kern_pairs() 204 kp->index1 = FT_Get_Char_Index( t1_face, p[0] ); in T1_Read_PFM() 349 midi = KERN_INDEX( mid->index1, mid->index2 ); in T1_Get_Kerning()
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
D | Trie2Writable.java | 120 index1[i]=j; in init() 125 index1[i]=UNEWTRIE2_INDEX_2_NULL_OFFSET; in init() 161 i2=index1[c>>UTRIE2_SHIFT_1]+ in isInNullBlock() 194 i2=index1[i1]; in getIndex2Block() 197 index1[i1]=i2; in getIndex2Block() 328 this.index1 = tempTrie.index1; in uncompact() 590 i2=index1[c>>UTRIE2_SHIFT_1]+ in get() 681 i2Block=index1[--i1]; in findHighStart() 901 index1[i]=map[index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2() 1116 …dest.index[destIdx++] = (char)(UTRIE2_INDEX_2_OFFSET + index1[i+UTRIE2_OMITTED_BMP_INDEX_1_LENGTH]… in freeze() [all …]
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
D | Trie2Writable.java | 122 index1[i]=j; in init() 127 index1[i]=UNEWTRIE2_INDEX_2_NULL_OFFSET; in init() 163 i2=index1[c>>UTRIE2_SHIFT_1]+ in isInNullBlock() 196 i2=index1[i1]; in getIndex2Block() 199 index1[i1]=i2; in getIndex2Block() 330 this.index1 = tempTrie.index1; in uncompact() 592 i2=index1[c>>UTRIE2_SHIFT_1]+ in get() 683 i2Block=index1[--i1]; in findHighStart() 903 index1[i]=map[index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2() 1118 …dest.index[destIdx++] = (char)(UTRIE2_INDEX_2_OFFSET + index1[i+UTRIE2_OMITTED_BMP_INDEX_1_LENGTH]… in freeze() [all …]
|