HomeSort by relevance Sort by last modified time
    Searched refs:isBoundary (Results 1 - 25 of 46) sorted by null

1 2

  /libcore/luni/src/test/java/libcore/java/text/
BreakIteratorTest.java 110 it.isBoundary(-1);
116 assertTrue(it.isBoundary(0));
117 assertTrue(it.isBoundary(1));
118 assertTrue(it.isBoundary(4));
119 assertTrue(it.isBoundary(5));
122 it.isBoundary(6);
  /libcore/luni/src/main/java/java/text/
BreakIterator.java 360 public boolean isBoundary(int offset) {
361 return wrapped.isBoundary(offset);
RuleBasedBreakIterator.java 24 * We need this because BreakIterator.isBoundary and BreakIterator.preceding are non-abstract,
86 @Override public boolean isBoundary(int offset) {
88 return wrapped.isBoundary(offset);
  /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
BreakIteratorTest.java 102 iterator.isBoundary(2);
107 assertTrue(iterator.isBoundary(2));
108 assertFalse(iterator.isBoundary(1));
109 assertTrue(iterator.isBoundary(0));
111 iterator.isBoundary(-1);
115 assertTrue(iterator.isBoundary(TEXT.length()));
  /external/chromium_org/third_party/icu/source/test/perf/ubrkperf/
ubrkperf.h 67 if(m_brkIt_->isBoundary(j)) {
77 if(m_brkIt_->isBoundary(j)) {
ubrkperfold.cpp 377 if(brkit->isBoundary(j)) {
391 if(brkit->isBoundary(j)) {
  /external/icu4c/test/perf/ubrkperf/
ubrkperf.h 67 if(m_brkIt_->isBoundary(j)) {
77 if(m_brkIt_->isBoundary(j)) {
ubrkperfold.cpp 377 if(brkit->isBoundary(j)) {
391 if(brkit->isBoundary(j)) {
  /frameworks/base/core/java/android/text/method/
WordIterator.java 115 if (mIterator.isBoundary(shiftedOffset)) {
145 if (mIterator.isBoundary(shiftedOffset)) {
  /external/chromium_org/third_party/icu/source/common/unicode/
brkiter.h 273 virtual UBool isBoundary(int32_t offset) = 0;
rbbi.h 463 virtual UBool isBoundary(int32_t offset);
  /external/chromium_org/third_party/icu/source/i18n/
stsearch.cpp 388 (m_breakiterator_->isBoundary(m_search_->matchedIndex) &&
389 m_breakiterator_->isBoundary(m_search_->matchedIndex +
476 (m_breakiterator_->isBoundary(m_search_->matchedIndex) &&
477 m_breakiterator_->isBoundary(m_search_->matchedIndex +
  /external/icu4c/common/unicode/
brkiter.h 280 virtual UBool isBoundary(int32_t offset) = 0;
rbbi.h 491 virtual UBool isBoundary(int32_t offset);
  /external/icu4c/i18n/
stsearch.cpp 388 (m_breakiterator_->isBoundary(m_search_->matchedIndex) &&
389 m_breakiterator_->isBoundary(m_search_->matchedIndex +
476 (m_breakiterator_->isBoundary(m_search_->matchedIndex) &&
477 m_breakiterator_->isBoundary(m_search_->matchedIndex +
  /frameworks/base/core/java/android/view/
AccessibilityIterators.java 109 while (!mImpl.isBoundary(start)) {
135 while (!mImpl.isBoundary(end)) {
  /libcore/luni/src/main/java/libcore/icu/
NativeBreakIterator.java 136 public boolean isBoundary(int offset) {
  /external/chromium/chrome/browser/history/
snippet.cc 127 // isBoundary() is not very fast, but should be good enough for the
129 bi->isBoundary(*utf8_pos);
148 bi->isBoundary(previous_match_end);
  /external/chromium_org/chrome/browser/history/
snippet.cc 127 // isBoundary() is not very fast, but should be good enough for the
129 bi->isBoundary(*utf8_pos);
148 bi->isBoundary(previous_match_end);
  /external/chromium_org/third_party/icu/source/common/
ubrk.cpp 275 return ((RuleBasedBreakIterator *)bi)->RuleBasedBreakIterator::isBoundary(offset);
  /external/icu4c/common/
ubrk.cpp 261 return ((RuleBasedBreakIterator *)bi)->RuleBasedBreakIterator::isBoundary(offset);
  /libcore/luni/src/main/native/
libcore_icu_NativeBreakIterator.cpp 164 return it->isBoundary(offset);
  /external/chromium_org/third_party/icu/source/test/intltest/
rbbiapts.cpp 538 // isBoundary()
541 if (bi->isBoundary(3) != TRUE) {
550 if (bi->isBoundary(11) != FALSE) {
    [all...]
  /external/icu4c/test/intltest/
rbbiapts.cpp 538 // isBoundary()
541 if (bi->isBoundary(3) != TRUE) {
550 if (bi->isBoundary(11) != FALSE) {
    [all...]
rbbitst.cpp 614 if (bi.isBoundary(i)) {
781 onBoundary = iter->isBoundary(index);
783 errln((UnicodeString)"Didn't handle isBoundary correctly with offset = " + index +
    [all...]

Completed in 1471 milliseconds

1 2