HomeSort by relevance Sort by last modified time
    Searched defs:targetLen (Results 1 - 6 of 6) sorted by null

  /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) {
  /dalvik/tools/dexdeps/src/com/android/dexdeps/
Output.java 273 int targetLen = descr.length();
278 while (targetLen > 1 && descr.charAt(offset) == '[') {
280 targetLen--;
284 if (targetLen == 1) {
287 targetLen = descr.length();
290 if (targetLen >= 2 && descr.charAt(offset) == 'L' &&
291 descr.charAt(offset+targetLen-1) == ';')
293 targetLen -= 2; /* two fewer chars to copy */
298 char[] buf = new char[targetLen + arrayDepth * 2];
302 for (i = 0; i < targetLen; i++)
    [all...]
  /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/vm/jdwp/
JdwpEvent.cpp 423 int targetLen = strlen(target);
427 pattern+1, target + (targetLen-patLen));
429 if (targetLen < patLen)
431 return strcmp(pattern+1, target + (targetLen-patLen)) == 0;
    [all...]
  /dalvik/dexdump/
DexDump.cpp 128 int targetLen = strlen(str);
134 while (targetLen > 1 && str[offset] == '[') {
136 targetLen--;
140 if (targetLen == 1) {
144 targetLen = strlen(str);
147 if (targetLen >= 2 && str[offset] == 'L' &&
148 str[offset+targetLen-1] == ';')
150 targetLen -= 2;
155 newStr = (char*)malloc(targetLen + arrayDepth * 2 +1);
159 for (i = 0; i < targetLen; i++)
    [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...]

Completed in 1168 milliseconds