/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 96 for (int index2 = 0; index2 < num_input_columns; index2++) { in Compute() local 98 DistancePair(index1, index2, distance_mat(index1, index2))); in Compute() 108 col_to_row_match_vec[match.index2] == -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/source/ |
D | pitch_filter_c.c | 28 int* index2) { in WebRtcIsacfix_PitchFilterCore() argument 38 tmpW32 += ubufQQpos2[*index2 + j] * coefficient[j]; in WebRtcIsacfix_PitchFilterCore() 66 tmpW32 = inputBuf[*index2] - sign * tmpW16; in WebRtcIsacfix_PitchFilterCore() 67 outputBuf[*index2] = WebRtcSpl_SatW32ToW16(tmpW32); in WebRtcIsacfix_PitchFilterCore() 68 tmpW32 = inputBuf[*index2] + outputBuf[*index2]; in WebRtcIsacfix_PitchFilterCore() 69 outputBuf2[*index2 + PITCH_BUFFSIZE] = WebRtcSpl_SatW32ToW16(tmpW32); in WebRtcIsacfix_PitchFilterCore() 71 (*index2)++; in WebRtcIsacfix_PitchFilterCore()
|
D | pitch_filter_armv6.S | 31 @ int* index2) { 39 ldr r6, [sp, #60] @ index2 40 ldr r7, [r6] @ *index2 45 str r4, [r6] @ Store return value to index2. 48 add r12, r10 @ &outputBuf[*index2] 49 add r8, r10 @ &inputBuf[*index2] 51 add r4, r7, #PITCH_BUFFSIZE @ *index2 + PITCH_BUFFSIZE 52 add r6, r3, r4, lsl #1 @ &outputBuf2[*index2 + PITCH_BUFFSIZE] 54 sub r4, #2 @ *index2 + PITCH_BUFFSIZE - index - 2 55 add r3, r4, lsl #1 @ &ubufQQpos2[*index2] [all …]
|
D | pitch_filter_mips.c | 22 int* index2) { in WebRtcIsacfix_PitchFilterCore() argument 23 int ind2t = *index2; in WebRtcIsacfix_PitchFilterCore() 132 (*index2) += loopNumber; in WebRtcIsacfix_PitchFilterCore()
|
/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 171 self.index2 = index2 178 t = (self.index1, self.index2, self.chars, self.tags) 220 self.index2 = text.index("%s+%dc" % (self.index1, len(self.chars))) 233 text.delete(self.index1, self.index2) 241 if self.index2 != cmd.index1: 250 self.index2 = cmd.index2 267 def __init__(self, index1, index2=None): argument [all …]
|
/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 170 self.index2 = index2 177 t = (self.index1, self.index2, self.chars, self.tags) 220 self.index2 = text.index("%s+%dc" % (self.index1, len(self.chars))) 233 text.delete(self.index1, self.index2) 241 if self.index2 != cmd.index1: 250 self.index2 = cmd.index2 268 def __init__(self, index1, index2=None): argument [all …]
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
D | Trie2Writable.java | 69 index2[i]=j; in init() 99 index2[i]=UNEWTRIE2_DATA_NULL_OFFSET; in init() 107 index2[UNEWTRIE2_INDEX_GAP_OFFSET+i]=-1; in init() 112 index2[UNEWTRIE2_INDEX_2_NULL_OFFSET+i]=UNEWTRIE2_DATA_NULL_OFFSET; in init() 166 block=index2[i2]; in isInNullBlock() 175 if(newTop > index2.length) { in allocIndex2Block() 184 System.arraycopy(index2, index2NullOffset, index2, newBlock, UTRIE2_INDEX_2_BLOCK_LENGTH); in allocIndex2Block() 260 oldBlock=index2[i2]; in setIndex2Entry() 264 index2[i2]=block; in setIndex2Entry() 279 oldBlock=index2[i2]; in getDataBlock() [all …]
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
D | Trie2Writable.java | 67 index2[i]=j; in init() 97 index2[i]=UNEWTRIE2_DATA_NULL_OFFSET; in init() 105 index2[UNEWTRIE2_INDEX_GAP_OFFSET+i]=-1; in init() 110 index2[UNEWTRIE2_INDEX_2_NULL_OFFSET+i]=UNEWTRIE2_DATA_NULL_OFFSET; in init() 164 block=index2[i2]; in isInNullBlock() 173 if(newTop > index2.length) { in allocIndex2Block() 182 System.arraycopy(index2, index2NullOffset, index2, newBlock, UTRIE2_INDEX_2_BLOCK_LENGTH); in allocIndex2Block() 258 oldBlock=index2[i2]; in setIndex2Entry() 262 index2[i2]=block; in setIndex2Entry() 277 oldBlock=index2[i2]; in getDataBlock() [all …]
|
/external/protobuf/javanano/src/main/java/com/google/protobuf/nano/ |
D | InternalNano.java | 208 int index2 = 0; in equals() local 214 while (index2 < length2 && field2[index2] == null) { in equals() 215 index2++; in equals() 218 boolean atEndOf2 = index2 >= length2; in equals() 225 } else if (!Arrays.equals(field1[index1], field2[index2])) { in equals() 230 index2++; in equals() 243 int index2 = 0; in equals() local 249 while (index2 < length2 && field2[index2] == null) { in equals() 250 index2++; in equals() 253 boolean atEndOf2 = index2 >= length2; in equals() [all …]
|
/external/python/cpython3/Lib/idlelib/idle_test/ |
D | mock_tk.py | 197 def get(self, index1, index2=None): argument 201 if index2 is None: 204 endline, endchar = self._decode(index2) 216 def delete(self, index1, index2=None): argument 223 if index2 is None: 234 endline, endchar = self._decode(index2, -1) 247 def compare(self, index1, op, index2): argument 249 line2, char2 = self._decode(index2) 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 201 if index2 is None: 204 endline, endchar = self._decode(index2) 216 def delete(self, index1, index2=None): argument 223 if index2 is None: 234 endline, endchar = self._decode(index2, -1) 247 def compare(self, index1, op, index2): argument 249 line2, char2 = self._decode(index2) 276 def tag_remove(self, tagName, index1, index2=None): argument
|
/external/protobuf/src/google/protobuf/util/ |
D | message_differencer.cc | 561 int index2 = 0; in CombineFields() local 563 while (index1 < fields1.size() && index2 < fields2.size()) { in CombineFields() 565 const FieldDescriptor* field2 = fields2[index2]; in CombineFields() 574 combined_fields->push_back(fields2[index2]); in CombineFields() 576 ++index2; in CombineFields() 580 ++index2; 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() 774 reflection2->GetRepeatedMessage(*message2, repeated_field, index2); in IsMatch() [all …]
|
/external/python/cpython2/Lib/ |
D | ntpath.py | 125 index2 = normp.find(sep, index + 1) 128 if index2 == index + 1: 130 if index2 == -1: 131 index2 = len(p) 132 return p[:index2], p[index2:] 158 index2 = normp.find('/', index + 1) 161 if index2 == index + 1: 163 if index2 == -1: 164 index2 = len(p) 165 return p[:index2], p[index2:]
|
/external/icu/icu4c/source/common/ |
D | utrie2_builder.cpp | 177 newTrie->index2[i]=j; in utrie2_open() 205 newTrie->index2[i]=UNEWTRIE2_DATA_NULL_OFFSET; in utrie2_open() 213 newTrie->index2[UNEWTRIE2_INDEX_GAP_OFFSET+i]=-1; in utrie2_open() 218 newTrie->index2[UNEWTRIE2_INDEX_2_NULL_OFFSET+i]=UNEWTRIE2_DATA_NULL_OFFSET; in utrie2_open() 274 uprv_memcpy(trie->index2, other->index2, (size_t)other->index2Length*4); in cloneBuilder() 506 block=trie->index2[i2]; in isInNullBlock() 516 if(newTop>UPRV_LENGTHOF(trie->index2)) { in allocIndex2Block() 525 …uprv_memcpy(trie->index2+newBlock, trie->index2+trie->index2NullOffset, UTRIE2_INDEX_2_BLOCK_LENGT… in allocIndex2Block() 611 oldBlock=trie->index2[i2]; in setIndex2Entry() 615 trie->index2[i2]=block; in setIndex2Entry() [all …]
|
/external/lzma/CPP/7zip/Archive/7z/ |
D | 7zHandler.cpp | 549 const UInt32 index2 = index; in GetProperty() local 564 CNum folderIndex = _db.FileIndexToFolderIndexMap[index2]; in GetProperty() 567 if (_db.FolderStartFileIndex[folderIndex] == (CNum)index2) in GetProperty() 580 …case kpidPosition: { UInt64 v; if (_db.StartPos.GetItem(index2, v)) PropVarEm_Set_UInt64(value, v… in GetProperty() 581 case kpidCTime: SetFileTimeProp_From_UInt64Def(value, _db.CTime, index2); break; in GetProperty() 582 case kpidATime: SetFileTimeProp_From_UInt64Def(value, _db.ATime, index2); break; in GetProperty() 583 case kpidMTime: SetFileTimeProp_From_UInt64Def(value, _db.MTime, index2); break; in GetProperty() 584 …se kpidAttrib: if (_db.Attrib.ValidAndDefined(index2)) PropVarEm_Set_UInt32(value, _db.Attrib.Val… in GetProperty() 586 …ypted: PropVarEm_Set_Bool(value, IsFolderEncrypted(_db.FileIndexToFolderIndexMap[index2])); break; in GetProperty() 587 case kpidIsAnti: PropVarEm_Set_Bool(value, _db.IsItemAnti(index2)); break; in GetProperty() [all …]
|
/external/freetype/src/pshinter/ |
D | pshrec.c | 373 FT_UInt index2 ) in ps_mask_table_test_intersect() argument 376 PS_Mask mask2 = table->masks + index2; in ps_mask_table_test_intersect() 405 FT_UInt index2, in ps_mask_table_merge() argument 412 if ( index1 > index2 ) in ps_mask_table_merge() 418 index1 = index2; in ps_mask_table_merge() 419 index2 = temp; in ps_mask_table_merge() 422 if ( index1 < index2 && index2 < table->num_masks ) in ps_mask_table_merge() 427 PS_Mask mask2 = table->masks + index2; in ps_mask_table_merge() 471 delta = (FT_Int)( table->num_masks - 1 - index2 ); in ps_mask_table_merge() 489 index1, index2 )); in ps_mask_table_merge() [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 138 input.seek(index2); in checkSuffixLessThanOrEqual() 147 index2++; in checkSuffixLessThanOrEqual() 157 int index2 = suffixArray.readInt(); in assertSorted() local 158 if (!checkSuffixLessThanOrEqual(input, index1, index2)) { in assertSorted()
|
/external/tensorflow/tensorflow/core/kernels/neon/ |
D | types.h | 50 const ArrayType2& array2, int index2) { in MatchingArraySize() argument 51 DCHECK_EQ(ArraySize(array1, index1), ArraySize(array2, index2)); in MatchingArraySize() 57 const ArrayType2& array2, int index2, Args... args) { in MatchingArraySize() argument 58 DCHECK_EQ(ArraySize(array1, index1), ArraySize(array2, index2)); in MatchingArraySize()
|
/external/dng_sdk/source/ |
D | dng_utils.cpp | 642 for (uint32 index2 = 0; index2 < count2; index2++) in Process() local 665 for (uint32 index2 = 0; index2 < count2; index2++) in Process() local 687 for (uint32 index2 = 0; index2 < count2; index2++) in Process() local
|
/external/libchrome/base/task/sequence_manager/ |
D | intrusive_heap_unittest.cc | 117 HeapHandle index2; in TEST_F() local 122 EXPECT_FALSE(index2.IsValid()); in TEST_F() 130 heap.insert({12, &index2}); in TEST_F() 134 EXPECT_TRUE(index2.IsValid()); in TEST_F() 145 HeapHandle index2; in TEST_F() local 148 heap.insert({12, &index2}); in TEST_F() 151 EXPECT_TRUE(index2.IsValid()); in TEST_F() 156 EXPECT_TRUE(index2.IsValid()); in TEST_F() 161 EXPECT_FALSE(index2.IsValid()); in TEST_F()
|
/external/proguard/src/proguard/ |
D | ConfigurationChecker.java | 195 for (int index2 = 0; index2 < classPath2.size(); index2++) in checkConflicts() 197 if (classPath1 != classPath2 || index1 != index2) in checkConflicts() 199 ClassPathEntry entry2 = classPath2.get(index2); in checkConflicts()
|
/external/freetype/src/type1/ |
D | t1afm.c | 94 FT_ULong index1 = KERN_INDEX( pair1->index1, pair1->index2 ); in compare_kern_pairs() 95 FT_ULong index2 = KERN_INDEX( pair2->index1, pair2->index2 ); in compare_kern_pairs() local 98 if ( index1 > index2 ) in compare_kern_pairs() 100 else if ( index1 < index2 ) in compare_kern_pairs() 205 kp->index2 = FT_Get_Char_Index( t1_face, p[1] ); in T1_Read_PFM() 349 midi = KERN_INDEX( mid->index1, mid->index2 ); in T1_Get_Kerning()
|
/external/skqp/tests/ |
D | PathOpsAngleTest.cpp | 441 for (int index2 = 0; index2 < dataSize - 2; ++index2) { in DEF_TEST() local 445 IntersectData& data = dataArray[index2 + index3]; in DEF_TEST() 463 seg1->debugAddAngle(dataArray[index2 + 0].fTStart, dataArray[index2 + 0].fTEnd); in DEF_TEST() 465 seg2->debugAddAngle(dataArray[index2 + 1].fTStart, dataArray[index2 + 1].fTEnd); in DEF_TEST() 467 seg3->debugAddAngle(dataArray[index2 + 2].fTStart, dataArray[index2 + 2].fTEnd); in DEF_TEST()
|
/external/skia/tests/ |
D | PathOpsAngleTest.cpp | 441 for (int index2 = 0; index2 < dataSize - 2; ++index2) { in DEF_TEST() local 445 IntersectData& data = dataArray[index2 + index3]; in DEF_TEST() 463 seg1->debugAddAngle(dataArray[index2 + 0].fTStart, dataArray[index2 + 0].fTEnd); in DEF_TEST() 465 seg2->debugAddAngle(dataArray[index2 + 1].fTStart, dataArray[index2 + 1].fTEnd); in DEF_TEST() 467 seg3->debugAddAngle(dataArray[index2 + 2].fTStart, dataArray[index2 + 2].fTEnd); in DEF_TEST()
|
/external/u-boot/cmd/ti/ |
D | ddr3.c | 139 u32 index, value, index2, value2; in ddr_memory_compare() local 141 for (index = address1, index2 = address2; in ddr_memory_compare() 143 index += 4, index2 += 4) { in ddr_memory_compare() 145 value2 = __raw_readl(index2); in ddr_memory_compare() 149 index, value, index2, value2); in ddr_memory_compare()
|