Searched refs:previous (Results 226 - 250 of 550) sorted by relevance

1234567891011>>

/external/icu/android_icu4j/src/main/java/android/icu/text/
H A DThaiBreakEngine.java232 if (!fSuffixSet.contains(fIter.previous())) {
233 // Skip over previous end and PAIYANNOI
244 if (fIter.previous() != THAI_MAIYAMOK) {
245 // Skip over previous end and MAIYAMOK
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DBreakIterator.java61 * and previous() that update the current position. All BreakIterators uphold the
70 * previous().
133 * for (int start = boundary.previous();
135 * end = start, start = boundary.previous()) {
158 * int start = boundary.previous();
169 * int start = boundary.previous();
245 * DONE is returned by previous() and next() after all valid
280 * previous() n times.
314 public abstract int previous(); method in class:BreakIterator
350 pos = previous();
[all...]
H A DThaiBreakEngine.java231 if (!fSuffixSet.contains(fIter.previous())) {
232 // Skip over previous end and PAIYANNOI
243 if (fIter.previous() != THAI_MAIYAMOK) {
244 // Skip over previous end and MAIYAMOK
/external/llvm/test/MC/Mips/
H A Dset-push-pop-directives.s4 # .set pop restores the previous environment.
/external/skia/tests/
H A DGrTRecorderTest.cpp111 REPORTER_ASSERT(reporter, reverseIter.previous() == !!i);
283 REPORTER_ASSERT(reporter, reverseIter.previous() == !!i);
/external/tinyxml/
H A Dtinyxml.h515 IterateChildren takes the previous child as input and finds
516 the next one. If the previous child is null, it returns the
519 const TiXmlNode* IterateChildren( const TiXmlNode* previous ) const;
520 TiXmlNode* IterateChildren( TiXmlNode* previous );
523 const TiXmlNode* IterateChildren( const char * value, const TiXmlNode* previous ) const;
524 TiXmlNode* IterateChildren( const char * value, TiXmlNode* previous );
527 const TiXmlNode* IterateChildren( const std::string& _value, const TiXmlNode* previous ) const { return IterateChildren (_value.c_str (), previous); } ///< STL std::string form.
528 TiXmlNode* IterateChildren( const std::string& _value, TiXmlNode* previous ) { return IterateChildren (_value.c_str (), previous); } ///< ST
[all...]
/external/valgrind/helgrind/tests/
H A Dlocked_vs_unlocked2.stderr.exp38 This conflicts with a previous write of size 4 by thread #x
H A Dpth_cond_destroy_busy.stderr.exp22 This conflicts with a previous write of size 4 by thread #x
/external/apache-xml/src/main/java/org/apache/xpath/
H A DXPathContext.java1286 * Complicating factor: We need to handle the case of popping back to a previous
1288 * Basically: If pop says this DTM is now empty, then return to the previous
1294 int previous=m_last_pushed_rtfdtm.pop();
1298 if(m_which_rtfdtm==previous)
1300 if(previous>=0) // guard against none-active
1302 boolean isEmpty=((SAX2RTFDTM)(m_rtfdtm_stack.elementAt(previous))).popRewindMark();
1305 else while(m_which_rtfdtm!=previous)
1308 // _DON'T_ pop the previous, since it's still open (which is why we
/external/glide/library/src/main/java/com/bumptech/glide/
H A DGenericRequestBuilder.java603 Request previous = target.getRequest();
605 if (previous != null) {
606 previous.clear();
607 requestTracker.removeRequest(previous);
608 previous.recycle();
625 * @param view The view to cancel previous loads for and load the new resource into.
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DListsTest.java486 assertEquals("4", iterator.previous());
487 assertEquals("3", iterator.previous());
488 assertEquals("2", iterator.previous());
490 assertEquals("1", iterator.previous());
494 iterator.previous();
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
H A DMathUtils.java2080 double previous = val[0];
2088 if (val[i] <= previous) {
2092 if (val[i] < previous) {
2099 if (val[i] >= previous) {
2103 if (val[i] > previous) {
2114 throw new NonMonotonousSequenceException(val[i], previous, i, dir, strict);
2116 previous = val[i];
/external/libhevc/common/arm/
H A Dihevc_intra_pred_filters_chroma_mode_11_to_17.s487 vst1.8 d24, [r5], r3 @(from previous loop)st (row 5)
488 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6)
503 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6)
504 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7)
515 vst1.8 d18, [r5], r3 @(from previous loop)st (row 7)
600 vst1.8 d24, [r5], r3 @(from previous loop)st (row 5)
601 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6)
603 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6)
604 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7)
H A Dihevc_intra_pred_filters_luma_mode_11_to_17.s470 vst1.8 d24, [r5], r3 @(from previous loop)st (row 5)
471 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6)
485 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6)
486 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7)
497 vst1.8 d18, [r5], r3 @(from previous loop)st (row 7)
579 vst1.8 d24, [r5], r3 @(from previous loop)st (row 5)
580 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6)
582 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6)
583 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7)
/external/mockito/src/org/mockito/exceptions/
H A DReporter.java338 public void wantedButNotInvokedInOrder(DescribedInvocation wanted, DescribedInvocation previous) { argument
345 previous.toString(),
346 previous.getLocation(),
/external/chromium-trace/catapult/telemetry/third_party/png/
H A Dpng.py118 three values for one pixel simply follow the three values for the previous
992 scanline as a sequence of bytes; `prev` specifies the previous
1443 def undo_filter(self, filter_type, scanline, previous):
1446 `previous` is decoded previous scanline (for straightlaced
1447 images this is the previous pixel row, but for interlaced
1448 images, it is the previous scanline in the reduced image, which
1449 in general is not the previous pixel row in the final image).
1450 When there is no previous scanline (the first row of a
1472 # byte from the previous previou
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DLists.java868 forwardIterator.previous();
885 return forwardIterator.previous();
892 @Override public T previous() {
990 if (Objects.equal(element, listIterator.previous())) {
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DLists.java834 forwardIterator.previous();
851 return forwardIterator.previous();
858 @Override public T previous() {
956 if (Objects.equal(element, listIterator.previous())) {
/external/icu/icu4c/source/common/
H A Dfilteredbrk.cpp191 virtual int32_t previous(void);
385 n = fDelegate->previous(); // skip this one. Find the next lowerlevel break.
413 SimpleFilteredSentenceBreakIterator::previous(void) { function in class:SimpleFilteredSentenceBreakIterator
414 return internalPrev(fDelegate->previous());
/external/icu/icu4c/source/common/unicode/
H A Dbrkiter.h187 * encoded text, the break positions returned by next(), previous(), etc.
208 * DONE is returned by previous() and next() after all valid
231 * @return The character index of the previous text boundary or DONE if all
235 virtual int32_t previous(void) = 0;
285 * does nothing. Negative values move to previous boundaries
551 * @param key the registry key returned by a previous call to registerInstance
587 * The new and previous text strings must have the same content.
H A Dnormlzr.h63 * and previous() could not be used after setIndex(), next(), first(), and current().
71 * previous() returns the previous normalized code point (UChar32),
96 * previous() returns a code point from at or after the getIndex()
97 * from after the previous() call.
122 * underlying Unicode input text, the next() and previous() methods
125 * between characters returned by next() and previous() and the indices
478 * This is equivalent to setIndexOnly(endIndex()) followed by previous().
503 * Return the previous character in the normalized text and decrement.
513 * @return the previous normalize
[all...]
H A Drbbi.h442 * equivalent to repeatedly calling next() or previous().
463 virtual int32_t previous(void);
517 * position from <code>next()</code>, <code>previous()</code>, or
639 * The new and previous text strings must have the same content.
/external/icu/icu4c/source/samples/citer/
H A Dciter.cpp159 c = iter.previous();
/external/icu/icu4c/source/test/intltest/
H A Ditercoll.cpp45 * Test for CollationElementIterator previous and next for the whole set of
79 * Test for CollationElementIterator.previous()
179 if (U_FAILURE(status) || iter->previous(status) != CollationElementIterator::NULLORDER) {
365 order = iter->previous(status);
369 order = iter->previous(status);
372 && iter->previous(status) != (int32_t)CollationElementIterator::NULLORDER)
/external/iptables/iptables/
H A Diptables-apply47 previous ruleset.

Completed in 894 milliseconds

1234567891011>>