Lines Matching refs:len
147 sal_Int32 len = lenArray[i] - lenArray[i - 1]; in getLongestMatch() local
148 if (sLen >= len) { in getLongestMatch()
152 while (pos < len && dstr[pos] == str[pos]) { pos++; } in getLongestMatch()
154 if (pos == len) in getLongestMatch()
155 return len + 1; in getLongestMatch()
246 sal_Int32 len = wordBoundary.endPos - wordBoundary.startPos; in getCache() local
248 if (aCache.size == 0 || len > aCache.size) { in getCache()
252 aCache.size = len; in getCache()
255 aCache.size = len > DEFAULT_SIZE ? len : DEFAULT_SIZE; in getCache()
259 aCache.length = len; in getCache()
260 memcpy(aCache.contents, text + wordBoundary.startPos, len * sizeof(sal_Unicode)); in getCache()
261 *(aCache.contents + len) = 0x0000; in getCache()
263 memset(aCache.wordboundary, '\0', sizeof(sal_Int32)*(len + 2)); in getCache()
267 len = 0; in getCache()
269 … while (u_isWhitespace((sal_uInt32)text[wordBoundary.startPos + aCache.wordboundary[i] + len])) in getCache()
270 len ++; in getCache()
272 if (len == 0) { in getCache()
276 for (;len == 0 && slen > 0; str++, slen--) { in getCache()
277 len = getLongestMatch(str, slen); in getCache()
278 if (len == 0) { in getCache()
280 len = 1; in getCache()
304 if (len) { in getCache()
305 aCache.wordboundary[i+1] = aCache.wordboundary[i] + len; in getCache()
349 sal_Int32 len=rText.getLength(); in getWordBoundary() local
350 if (anyPos >= len || anyPos < 0) { in getWordBoundary()
351 boundary.startPos = boundary.endPos = anyPos < 0 ? 0 : len; in getWordBoundary()
372 if (anyPos < len) rText.iterateCodePoints(&anyPos, 1); in getWordBoundary()
373 boundary.endPos = anyPos < len ? anyPos : len; in getWordBoundary()
377 while (boundary.endPos < len) in getWordBoundary()