/frameworks/base/core/java/android/text/method/ |
WordIterator.java | 66 public int preceding(int offset) { method in class:WordIterator 69 shiftedOffset = mIterator.preceding(shiftedOffset); 113 return mIterator.preceding(shiftedOffset) + mOffsetShift; 117 return mIterator.preceding(shiftedOffset) + mOffsetShift;
|
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
BreakIteratorTest.java | 146 iterator.preceding(2); 151 assertEquals(0, iterator.preceding(2)); 152 assertEquals(2, iterator.preceding(3)); 153 assertEquals(16, iterator.preceding(17)); 154 assertEquals(17, iterator.preceding(18)); 155 assertEquals(18, iterator.preceding(19)); 157 iterator.preceding(-1); 162 iterator.preceding(TEXT.length());
|
/libcore/luni/src/main/java/java/text/ |
BreakIterator.java | 365 * Returns the position of last boundary preceding the given offset, and 371 * @return the position of the last boundary preceding the given offset. 375 public int preceding(int offset) { method in class:BreakIterator 376 return wrapped.preceding(offset);
|
RuleBasedBreakIterator.java | 24 * We need this because BreakIterator.isBoundary and BreakIterator.preceding are non-abstract, 89 @Override public int preceding(int offset) { method in class:RuleBasedBreakIterator 91 return wrapped.preceding(offset);
|
/libcore/luni/src/test/java/libcore/java/text/ |
BreakIteratorTest.java | 148 it.preceding(-1); 154 assertEquals(BreakIterator.DONE, it.preceding(0)); 155 assertEquals(0, it.preceding(1)); 156 assertEquals(4, it.preceding(5)); 159 it.preceding(6);
|
/cts/tests/tests/text/src/android/text/method/cts/ |
WordIteratorTest.java | 55 assertEquals(BreakIterator.DONE, wi.preceding(0));
|
/external/icu4c/i18n/unicode/ |
search.h | 353 * @return The character index of the first match preceding 359 int32_t preceding(int32_t position, UErrorCode &status);
|
/external/libxslt/libxslt/ |
numbers.c | 594 /* Skip to next preceding or ancestor */ 636 xmlNodePtr preceding; local 664 /* count(preceding-sibling::*) */ 666 for (preceding = ancestor; 667 preceding != NULL; 668 preceding = 669 xmlXPathNextPrecedingSibling(parser, preceding)) { 671 if ((preceding->type == ancestor->type) && 672 xmlStrEqual(preceding->name, ancestor->name)){ 673 if ((preceding->ns == ancestor->ns) | [all...] |
/external/icu4c/common/unicode/ |
brkiter.h | 223 * Return the boundary preceding the current boundary. 256 * Return the first boundary preceding the specified offset. 263 virtual int32_t preceding(int32_t offset) = 0;
|
rbbi.h | 431 * Moves the iterator backwards, to the last boundary preceding this one. 432 * @return The position of the last boundary position preceding this one. 453 virtual int32_t preceding(int32_t offset);
|
/external/icu4c/i18n/ |
brktrans.cpp | 91 bi->preceding(offsets.start);
|
search.cpp | 226 int32_t SearchIterator::preceding(int32_t position, function in class:SearchIterator
|
/external/webkit/Source/WebCore/platform/text/brew/ |
TextBreakIteratorBrew.cpp | 67 int preceding(int position) function in class:WebCore::TextBreakIterator 311 return breakIterator->preceding(position);
|
/external/webkit/Source/WebCore/platform/text/wince/ |
TextBreakIteratorWinCE.cpp | 76 int preceding(int position) function in class:WebCore::TextBreakIterator 302 return breakIterator->preceding(position);
|
/external/jdiff/src/jdiff/ |
DiffMyers.java | 747 to be the "change". The only exception is if the preceding blank line 758 int preceding = -1; local 772 will count as the preceding batch of changes. */ 803 && !((preceding >= 0 && start == preceding) 819 preceding = i;
|
/libcore/luni/src/main/java/libcore/icu/ |
NativeBreakIterator.java | 130 public int preceding(int offset) { method in class:NativeBreakIterator
|
/external/webkit/LayoutTests/dom/html/level1/core/ |
hc_nodegetprevioussibling.js | 79 immediately preceding this node.
|
hc_nodegetprevioussiblingnull.js | 79 If there is not a node immediately preceding this node the
|
/external/webkit/LayoutTests/dom/xhtml/level1/core/ |
hc_nodegetprevioussibling.js | 79 immediately preceding this node.
|
hc_nodegetprevioussiblingnull.js | 79 If there is not a node immediately preceding this node the
|
/frameworks/base/core/java/android/text/ |
Selection.java | 366 public int preceding(int position); method in interface:Selection.PositionIterator 373 final int offset = iter.preceding(getSelectionEnd(text));
|
/external/oprofile/events/i386/nehalem/ |
unit_masks | 9 0x01 std Counts the number of loads blocked by a preceding store with unknown data 10 0x04 address_offset Counts the number of loads blocked by a preceding store address 18 0x01 not_sta This event counts the number of load operations delayed caused by preceding stores whose addresses are known but whose data is unknown, and preceding stores that conflict with the load but which incompletely overlap the load 19 0x02 sta This event counts load operations delayed caused by preceding stores whose addresses are unknown (STA block)
|
/external/icu4c/test/intltest/ |
rbbiapts.cpp | 298 TEST_ASSERT(rb->preceding(2) == 0); 300 //if(rb->preceding(2) != 3) { 509 // Preceding 511 i = bi->preceding(4); 513 errln("Incorrect value from bi->preceding() at line %d. Expected 3, got %d", __LINE__, i); 516 i = bi->preceding(10); 518 errln("Incorrect value from bi->preceding() at line %d. Expected 9, got %d", __LINE__, i); 521 i = bi->preceding(1); 523 errln("Incorrect value from bi->preceding() at line %d. Expected 0, got %d", __LINE__, i); 526 i = bi->preceding(0) [all...] |
/external/webkit/LayoutTests/dom/xhtml/level3/core/ |
nodecomparedocumentposition05.js | 79 are disconnected, implementation-specific and preceding/following.
|
/external/icu4c/common/ |
ubrk.cpp | 232 return ((RuleBasedBreakIterator*)bi)->RuleBasedBreakIterator::preceding(offset);
|