/dalvik/tools/dexdeps/src/com/android/dexdeps/ |
Output.java | 227 int targetLen = descr.length(); 232 while (targetLen > 1 && descr.charAt(offset) == '[') { 234 targetLen--; 238 if (targetLen == 1) { 241 targetLen = descr.length(); 244 if (targetLen >= 2 && descr.charAt(offset) == 'L' && 245 descr.charAt(offset+targetLen-1) == ';') 247 targetLen -= 2; /* two fewer chars to copy */ 252 char[] buf = new char[targetLen + arrayDepth * 2]; 256 for (i = 0; i < targetLen; i++) [all...] |
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
LevenshteinSuggestionFormatter.java | 85 final int targetLen = target.length; 86 final int[] result = new int[targetLen]; 88 for (int i = 0; i < targetLen; ++i) {
|
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
LevenshteinDistance.java | 68 final int targetLen = trg.length; 73 for (int t = 1; t <= targetLen; ++t) { 95 return distTab[sourceLen][targetLen];
|
/dalvik/dexdump/ |
DexDump.c | 126 int targetLen = strlen(str); 132 while (targetLen > 1 && str[offset] == '[') { 134 targetLen--; 138 if (targetLen == 1) { 142 targetLen = strlen(str); 145 if (targetLen >= 2 && str[offset] == 'L' && 146 str[offset+targetLen-1] == ';') 148 targetLen -= 2; 153 newStr = malloc(targetLen + arrayDepth * 2 +1); 157 for (i = 0; i < targetLen; i++) [all...] |
/external/chromium/third_party/icu/source/test/cintltst/ |
nfsprep.c | 151 findStringIndex(const char* const *sortedArr, int32_t sortedArrLen, const char* target, int32_t targetLen){ 160 rc=strncmp(sortedArr[middle],target, targetLen);
|
/external/icu4c/test/cintltst/ |
nfsprep.c | 151 findStringIndex(const char* const *sortedArr, int32_t sortedArrLen, const char* target, int32_t targetLen){ 160 rc=strncmp(sortedArr[middle],target, targetLen);
|
/external/chromium/third_party/icu/source/tools/genrb/ |
wrtjava.c | 104 uCharsToChars( char* target,int32_t targetLen, UChar* source, int32_t sourceLen,UErrorCode* status){ 109 if (j + 2 < targetLen) { 114 if(j+2<targetLen){ 120 if(j+2<targetLen){ 127 if(j+2<targetLen){ 147 if(j+2<targetLen){ 154 if(j+3<targetLen){ 160 if(j<targetLen){ 167 if(j<targetLen){ 173 if(j<targetLen){ [all...] |
/external/icu4c/tools/genrb/ |
wrtjava.c | 104 uCharsToChars( char* target,int32_t targetLen, UChar* source, int32_t sourceLen,UErrorCode* status){ 109 if (j + 2 < targetLen) { 114 if(j+2<targetLen){ 120 if(j+2<targetLen){ 127 if(j+2<targetLen){ 147 if(j+2<targetLen){ 154 if(j+3<targetLen){ 160 if(j<targetLen){ 167 if(j<targetLen){ 173 if(j<targetLen){ [all...] |
/external/skia/tests/ |
MathTest.cpp | 28 const SkPoint& p, SkScalar targetLen) { 34 len /= SkScalarToFloat(targetLen);
|
/dalvik/vm/jdwp/ |
JdwpEvent.c | 417 int targetLen = strlen(target); 421 pattern+1, target + (targetLen-patLen)); 423 if (targetLen < patLen) 425 return strcmp(pattern+1, target + (targetLen-patLen)) == 0; [all...] |
/external/chromium/third_party/icu/source/test/intltest/ |
ssearch.cpp | 422 int32_t targetLen = 0; 423 const UChar *target = ucbuf_getBuffer(ucharBuf, &targetLen, &status); 460 bms = bms_open(ucd, pattern, plen, target, targetLen, &status); [all...] |
/external/icu4c/test/intltest/ |
ssearch.cpp | 415 int32_t targetLen = 0; 416 const UChar *target = ucbuf_getBuffer(ucharBuf, &targetLen, &status); 453 bms = bms_open(ucd, pattern, plen, target, targetLen, &status); [all...] |