Home
last modified time | relevance | path

Searched refs:preceding (Results 1 - 25 of 79) sorted by relevance

1234

/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/rbbi/
H A DRBBIAPITest.java304 * Testing the methods last(), previous(), and preceding() of RuleBasedBreakIterator
310 logln("Testing last(),previous(), preceding() with custom rules"); in TestLastPreviousPreceding()
323 q = wordIter1.preceding(25); in TestLastPreviousPreceding()
328 q = wordIter1.preceding(20); in TestLastPreviousPreceding()
330 p = wordIter1.preceding(wordIter1.first()); in TestLastPreviousPreceding()
332 errln("ERROR: preceding() at starting position returned #" + p + " instead of 0"); in TestLastPreviousPreceding()
345 q = sentIter1.preceding(40); in TestLastPreviousPreceding()
347 q = sentIter1.preceding(25); in TestLastPreviousPreceding()
351 q = sentIter1.preceding(sentIter1.first()); in TestLastPreviousPreceding()
353 errln("ERROR: previous()/preceding() a in TestLastPreviousPreceding()
[all...]
H A DAbstractBreakIteratorTests.java97 int pos = bi.preceding(0); in testPreceding()
98 TestFmwk.assertEquals("BreakIterator preceding position not correct", BreakIterator.DONE, pos); in testPreceding()
100 pos = bi.preceding(5); in testPreceding()
101 TestFmwk.assertEquals("BreakIterator preceding position not correct", 4, pos); in testPreceding()
H A DRBBITest.java106 if (brk.preceding(expectedLineResult[1]) != expectedLineResult[0]) { in TestThaiDictionaryBreakIterator()
107 errln("Incorrect preceding position."); in TestThaiDictionaryBreakIterator()
315 * Tests the method public int preceding(int offset)
322 if (rbbi.preceding(-1) != BreakIterator.DONE) { in TestPreceding()
323 errln("RuleBasedBreakIterator.preceding(-1) was suppose to return " in TestPreceding()
329 if (rbbi.preceding(-1) != 0) { in TestPreceding()
330 errln("RuleBasedBreakIterator.preceding(-1) was suppose to return " in TestPreceding()
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/
H A DRBBIAPITest.java301 * Testing the methods last(), previous(), and preceding() of RuleBasedBreakIterator
307 logln("Testing last(),previous(), preceding() with custom rules"); in TestLastPreviousPreceding()
320 q = wordIter1.preceding(25); in TestLastPreviousPreceding()
325 q = wordIter1.preceding(20); in TestLastPreviousPreceding()
327 p = wordIter1.preceding(wordIter1.first()); in TestLastPreviousPreceding()
329 errln("ERROR: preceding() at starting position returned #" + p + " instead of 0"); in TestLastPreviousPreceding()
342 q = sentIter1.preceding(40); in TestLastPreviousPreceding()
344 q = sentIter1.preceding(25); in TestLastPreviousPreceding()
348 q = sentIter1.preceding(sentIter1.first()); in TestLastPreviousPreceding()
350 errln("ERROR: previous()/preceding() a in TestLastPreviousPreceding()
[all...]
H A DAbstractBreakIteratorTests.java94 int pos = bi.preceding(0); in testPreceding()
95 TestFmwk.assertEquals("BreakIterator preceding position not correct", BreakIterator.DONE, pos); in testPreceding()
97 pos = bi.preceding(5); in testPreceding()
98 TestFmwk.assertEquals("BreakIterator preceding position not correct", 4, pos); in testPreceding()
H A DRBBITest.java109 if (brk.preceding(expectedLineResult[1]) != expectedLineResult[0]) { in TestThaiDictionaryBreakIterator()
110 errln("Incorrect preceding position."); in TestThaiDictionaryBreakIterator()
318 * Tests the method public int preceding(int offset)
325 if (rbbi.preceding(-1) != BreakIterator.DONE) { in TestPreceding()
326 errln("RuleBasedBreakIterator.preceding(-1) was suppose to return " in TestPreceding()
332 if (rbbi.preceding(-1) != 0) { in TestPreceding()
333 errln("RuleBasedBreakIterator.preceding(-1) was suppose to return " in TestPreceding()
839 int result = bi.preceding(ruleLen); in TestTable_8_16_Bits()
867 * The upshot is that the look-ahead rules all match on their preceding context,
950 /* Test preceding(inde
[all...]
/third_party/icu/icu4j/main/classes/localespi/src/com/ibm/icu/impl/jdkadapter/
H A DBreakIteratorICU.java83 public int preceding(int offset) { in preceding() method in BreakIteratorICU
84 return fIcuBrkItr.preceding(offset); in preceding()
/third_party/icu/icu4c/source/common/
H A Drbbi_cache.h42 UBool preceding(int32_t fromPos, int32_t *pos, int32_t *statusIndex);
61 // or preceding(). Optimizes sequential access.
108 void preceding(int32_t startPosition, UErrorCode &status);
124 * position on the preceding boundary and include both the
125 * preceding and following boundaries in the cache.
126 * Additional boundaries, either preceding or following, may be added
141 * Add one or more boundaries to the cache preceding the first currently cached boundary.
161 * Add the boundary preceding the current position.
169 * falls between to cached boundaries, to the preceding boundary.
H A Dustr_titlecase_brkiter.cpp62 int32_t preceding(int32_t offset) U_OVERRIDE;
112 int32_t WholeStringBreakIterator::preceding(int32_t /*offset*/) { return 0; } in preceding() function in WholeStringBreakIterator
H A Drbbi_cache.cpp81 UBool RuleBasedBreakIterator::DictionaryCache::preceding(int32_t fromPos, int32_t *result, int32_t *statusIndex) { in preceding() function in RuleBasedBreakIterator::DictionaryCache
252 void RuleBasedBreakIterator::BreakCache::preceding(int32_t startPos, UErrorCode &status) { in preceding() function in RuleBasedBreakIterator::BreakCache
260 // seek() leaves the BreakCache positioned at the preceding boundary in preceding()
351 // position on the preceding boundary and include both the in populateNear()
352 // preceding and following boundaries in the cache. in populateNear()
353 // Additional boundaries, either preceding or following, may be added in populateNear()
440 while (fTextIdx > position) { // Move backwards to a position at or preceding the requested pos. in populateNear()
459 // Back up one, leaving cache position at the boundary preceding the requested position. in populateNear()
535 if (fBI->fDictionaryCache->preceding(fromPosition, &position, &positionStatusIdx)) { in populatePreceding()
542 // Find a boundary somewhere preceding th in populatePreceding()
[all...]
H A Dfilteredbrk.cpp209 virtual int32_t preceding(int32_t offset) override;
437 SimpleFilteredSentenceBreakIterator::preceding(int32_t offset) { in preceding() function in SimpleFilteredSentenceBreakIterator
438 return internalPrev(fDelegate->preceding(offset)); in preceding()
/third_party/node/deps/icu-small/source/common/
H A Drbbi_cache.h42 UBool preceding(int32_t fromPos, int32_t *pos, int32_t *statusIndex);
61 // or preceding(). Optimizes sequential access.
108 void preceding(int32_t startPosition, UErrorCode &status);
124 * position on the preceding boundary and include both the
125 * preceding and following boundaries in the cache.
126 * Additional boundaries, either preceding or following, may be added
141 * Add one or more boundaries to the cache preceding the first currently cached boundary.
161 * Add the boundary preceding the current position.
169 * falls between to cached boundaries, to the preceding boundary.
H A Dustr_titlecase_brkiter.cpp62 int32_t preceding(int32_t offset) override;
112 int32_t WholeStringBreakIterator::preceding(int32_t /*offset*/) { return 0; } in preceding() function in WholeStringBreakIterator
H A Drbbi_cache.cpp81 UBool RuleBasedBreakIterator::DictionaryCache::preceding(int32_t fromPos, int32_t *result, int32_t *statusIndex) { in preceding() function in RuleBasedBreakIterator::DictionaryCache
253 void RuleBasedBreakIterator::BreakCache::preceding(int32_t startPos, UErrorCode &status) { in preceding() function in RuleBasedBreakIterator::BreakCache
261 // seek() leaves the BreakCache positioned at the preceding boundary in preceding()
352 // position on the preceding boundary and include both the in populateNear()
353 // preceding and following boundaries in the cache. in populateNear()
354 // Additional boundaries, either preceding or following, may be added in populateNear()
441 while (fTextIdx > position) { // Move backwards to a position at or preceding the requested pos. in populateNear()
460 // Back up one, leaving cache position at the boundary preceding the requested position. in populateNear()
536 if (fBI->fDictionaryCache->preceding(fromPosition, &position, &positionStatusIdx)) { in populatePreceding()
543 // Find a boundary somewhere preceding th in populatePreceding()
[all...]
H A Dfilteredbrk.cpp209 virtual int32_t preceding(int32_t offset) override;
437 SimpleFilteredSentenceBreakIterator::preceding(int32_t offset) { in preceding() function in SimpleFilteredSentenceBreakIterator
438 return internalPrev(fDelegate->preceding(offset)); in preceding()
/third_party/skia/third_party/externals/icu/source/common/
H A Drbbi_cache.h42 UBool preceding(int32_t fromPos, int32_t *pos, int32_t *statusIndex);
61 // or preceding(). Optimizes sequential access.
108 void preceding(int32_t startPosition, UErrorCode &status);
124 * position on the preceding boundary and include both the
125 * preceding and following boundaries in the cache.
126 * Additional boundaries, either preceding or following, may be added
141 * Add one or more boundaries to the cache preceding the first currently cached boundary.
161 * Add the boundary preceding the current position.
169 * falls between to cached boundaries, to the preceding boundary.
H A Dustr_titlecase_brkiter.cpp62 int32_t preceding(int32_t offset) U_OVERRIDE;
112 int32_t WholeStringBreakIterator::preceding(int32_t /*offset*/) { return 0; } in preceding() function in WholeStringBreakIterator
H A Drbbi_cache.cpp81 UBool RuleBasedBreakIterator::DictionaryCache::preceding(int32_t fromPos, int32_t *result, int32_t *statusIndex) { in preceding() function in RuleBasedBreakIterator::DictionaryCache
252 void RuleBasedBreakIterator::BreakCache::preceding(int32_t startPos, UErrorCode &status) { in preceding() function in RuleBasedBreakIterator::BreakCache
260 // seek() leaves the BreakCache positioned at the preceding boundary in preceding()
394 while (fTextIdx > position) { // Move backwards to a position at or preceding the requested pos. in populateNear()
413 // Back up one, leaving cache position at the boundary preceding the requested position. in populateNear()
489 if (fBI->fDictionaryCache->preceding(fromPosition, &position, &positionStatusIdx)) { in populatePreceding()
496 // Find a boundary somewhere preceding the first already-cached boundary in populatePreceding()
584 // No space in circular buffer to hold a new preceding result while in populatePreceding()
H A Dfilteredbrk.cpp210 virtual int32_t preceding(int32_t offset);
438 SimpleFilteredSentenceBreakIterator::preceding(int32_t offset) { in preceding() function in SimpleFilteredSentenceBreakIterator
439 return internalPrev(fDelegate->preceding(offset)); in preceding()
/third_party/icu/icu4c/source/i18n/unicode/
H A Dsearch.h362 * @return The character index of the first match preceding
368 int32_t preceding(int32_t position, UErrorCode &status);
/third_party/node/deps/icu-small/source/i18n/unicode/
H A Dsearch.h362 * @return The character index of the first match preceding
368 int32_t preceding(int32_t position, UErrorCode &status);
/third_party/ffmpeg/libavcodec/arm/
H A Dstartcode_armv6.S160 90: @ Found a candidate at the preceding byte
165 91: @ Found a candidate somewhere in the preceding 4 bytes
182 93: @ Found a candidate somewhere in the preceding 16 bytes
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DSimpleFilteredSentenceBreakIterator.java230 public int preceding(int offset) { in preceding() method in SimpleFilteredSentenceBreakIterator
231 return internalPrev(delegate.preceding(offset)); in preceding()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DSimpleFilteredSentenceBreakIterator.java214 public int preceding(int offset) { in preceding() method in SimpleFilteredSentenceBreakIterator
215 return internalPrev(delegate.preceding(offset)); in preceding()
/third_party/icu/icu4c/source/i18n/
H A Dbrktrans.cpp101 bi->preceding(offsets.start); in handleTransliterate()
109 // HACK: Check to see that preceding item was a letter in handleTransliterate()

Completed in 24 milliseconds

1234