HomeSort by relevance Sort by last modified time
    Searched refs:targetLen (Results 1 - 14 of 14) 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];
  /prebuilts/misc/windows/sdl2/test/
testautomation_sdltest.c     [all...]
  /external/icu/icu4c/source/test/cintltst/
nfsprep.c 153 findStringIndex(const char* const *sortedArr, int32_t sortedArrLen, const char* target, int32_t targetLen){
162 rc=strncmp(sortedArr[middle],target, targetLen);
  /art/dexdump/
dexdump.cc 125 int targetLen = strlen(str);
129 while (targetLen > 1 && str[offset] == '[') {
131 targetLen--;
136 if (targetLen == 1) {
140 targetLen = strlen(str);
143 if (targetLen >= 2 && str[offset] == 'L' &&
144 str[offset + targetLen - 1] == ';') {
145 targetLen -= 2;
151 std::unique_ptr<char[]> newStr(new char[targetLen + arrayDepth * 2 + 1]);
153 for (; i < targetLen; i++)
    [all...]
  /external/icu/icu4c/source/tools/genrb/
wrtjava.cpp 106 uCharsToChars(char *target, int32_t targetLen, const UChar *source, int32_t sourceLen, UErrorCode *status) {
111 if (j + 2 < targetLen) {
116 if(j+2<targetLen){
122 if(j+2<targetLen){
129 if(j+2<targetLen){
149 if(j+2<targetLen){
156 if(j+3<targetLen){
162 if(j<targetLen){
169 if(j<targetLen){
175 if(j<targetLen){
    [all...]
  /dalvik/dexdump/
DexDump.cpp 136 int targetLen = strlen(str);
142 while (targetLen > 1 && str[offset] == '[') {
144 targetLen--;
148 if (targetLen == 1) {
152 targetLen = strlen(str);
155 if (targetLen >= 2 && str[offset] == 'L' &&
156 str[offset+targetLen-1] == ';')
158 targetLen -= 2;
163 newStr = (char*)malloc(targetLen + arrayDepth * 2 +1);
167 for (i = 0; i < targetLen; i++)
    [all...]
  /external/icu/icu4j/main/tests/charset/src/com/ibm/icu/dev/test/charset/
TestConversion.java 401 int targetLen = cc.bytes.capacity() + 20; // for BOM, and to let failures produce excess output
403 ByteBuffer target = ByteBuffer.allocate(targetLen);
411 currentTargetLimit = Math.min(step, targetLen);
414 currentTargetLimit = targetLen;
433 //target.limit(targetLen);
434 target.limit(targetLen);
448 if (currentTargetLimit == targetLen) {
452 currentTargetLimit = Math.min(currentTargetLimit + step, targetLen);
    [all...]
  /prebuilts/tools/common/m2/repository/com/cedarsoftware/java-util/1.24.0/
java-util-1.24.0.jar 
  /external/skia/tests/
MathTest.cpp 226 const SkPoint& p, SkScalar targetLen) {
231 len /= SkScalarToFloat(targetLen);
  /prebuilts/ndk/r13/sources/third_party/vulkan/src/
generator.py     [all...]
  /external/slf4j/log4j-over-slf4j/compatibility/lib/
logback-classic-0.9.8-SNAPSHOT.jar 

Completed in 1763 milliseconds