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

  /external/slf4j/slf4j-migrator/src/test/java/org/slf4j/migrator/helper/
AbbreviatorTest.java 111 int targetLen = (maxLen / 2) + rh.nextInt(maxLen / 2) + 1;
113 if (targetLen > maxLen) {
114 targetLen = maxLen;
118 Abbreviator abb = new Abbreviator(fixedLen, targetLen, FS);
120 assertTheory0(averageLen, filename, result, fixedLen, targetLen);
121 assertUsefulness(averageLen, filename, result, fixedLen, targetLen);
122 assertTheory1(filename, result, fixedLen, targetLen);
123 assertTheory2(filename, result, fixedLen, targetLen);
  /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/
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.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/icu/icu4c/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/icu/icu4c/source/tools/genrb/
wrtjava.c 103 uCharsToChars( char* target,int32_t targetLen, UChar* source, int32_t sourceLen,UErrorCode* status){
108 if (j + 2 < targetLen) {
113 if(j+2<targetLen){
119 if(j+2<targetLen){
126 if(j+2<targetLen){
146 if(j+2<targetLen){
153 if(j+3<targetLen){
159 if(j<targetLen){
166 if(j<targetLen){
172 if(j<targetLen){
    [all...]
  /external/icu/icu4j/main/tests/charset/src/com/ibm/icu/dev/test/charset/
TestConversion.java 391 int targetLen = cc.bytes.capacity() + 20; // for BOM, and to let failures produce excess output
393 ByteBuffer target = ByteBuffer.allocate(targetLen);
401 currentTargetLimit = Math.min(step, targetLen);
404 currentTargetLimit = targetLen;
423 //target.limit(targetLen);
424 target.limit(targetLen);
438 if (currentTargetLimit == targetLen) {
442 currentTargetLimit = Math.min(currentTargetLimit + step, targetLen);
    [all...]
  /external/skia/tests/
MathTest.cpp 192 const SkPoint& p, SkScalar targetLen) {
197 len /= SkScalarToFloat(targetLen);
  /external/slf4j/log4j-over-slf4j/compatibility/lib/
logback-classic-0.9.8-SNAPSHOT.jar 

Completed in 361 milliseconds