Searched refs:previous (Results 126 - 150 of 356) sorted by relevance

1234567891011>>

/external/apache-http/src/org/apache/http/impl/conn/tsccm/
H A DRouteSpecificPool.java153 BasicPoolEntry entry = it.previous();
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/common/
H A Dtokenizer.py172 # Store the first token, or point the previous token to this one.
179 token.previous = self.__last_token
H A Dtokens_test.py40 neighbor_tokens[i].previous = neighbor_tokens[prev_index]
50 # First token in file (has no previous).
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/db/
H A DConfigResults.java210 // Return null if no previous builds are expected
213 // Add numbers for each previous build
497 BuildResults previous = (BuildResults) this.children.get(idx--);
498 while (idx >= 0 && previous.isBaseline()) {
499 previous = (BuildResults) this.children.get(idx--);
501 this.current = previous;
/external/guava/guava/src/com/google/common/collect/
H A DEmptyImmutableList.java58 @Override public Object previous() {
H A DSingletonImmutableList.java88 @Override public E previous() {
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DAbstractIteratorTester.java187 * The elements to be returned by future calls to {@code previous()}, with
193 * {@code previous}, {@link #previousElements} if the reverse is true, or --
239 public E previous() { method in class:AbstractIteratorTester.MultiExceptionListIterator
541 return ((ListIterator<?>) iterator).previous();
642 Stimulus<E, ListIterator<E>> previous = field in class:AbstractIteratorTester
643 new Stimulus<E, ListIterator<E>>("previous") {
665 hasPrevious, nextIndex, previousIndex, previous, add, set);
/external/icu4c/common/unicode/
H A Dchariter.h251 * for(c=it.last(); c!=CharacterIterator::DONE; c=it.previous()) {
266 * // get the previous code unit
267 * UChar u=it.previous();
306 * for(UChar c = iter.last(); c != CharacterIterator.DONE; c = iter.previous()) {
325 * c = iter.previous()) {}
426 * This can be used to begin an iteration with previous().
444 * iteration with previous() or previous32().
509 * Advances to the previous code unit in the iteration range
512 * @return the previous code unit.
515 virtual UChar previous(voi
[all...]
H A Duiter.h162 * Check if previous() can still return another code unit.
165 * @return boolean value for whether previous() can still return another code unit
205 * Function type declaration for UCharIterator.previous().
212 * @return the previous code unit (after pre-decrementing the current index)
326 * limit, and previous() only checks the current index against the start,
411 * (public) Check if previous() can still return another code unit.
445 UCharIteratorPrevious *previous; member in struct:UCharIterator
514 * Helper function for UCharIterator to get the previous code point.
521 * @return the previous code point (after pre-decrementing the current index)
/external/icu4c/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) != UCOL_NULLORDER) {
310 order = iter->previous(status);
314 order = iter->previous(status);
317 && iter->previous(status) != (int32_t)UCOL_NULLORDER)
/external/valgrind/main/coregrind/m_syswrap/
H A Dsyscall-amd64-linux.S206 .previous
H A Dsyscall-s390x-linux.S163 .previous
H A Dsyscall-x86-linux.S166 .previous
/external/webkit/Source/JavaScriptCore/icu/unicode/
H A Duiter.h162 * Check if previous() can still return another code unit.
165 * @return boolean value for whether previous() can still return another code unit
205 * Function type declaration for UCharIterator.previous().
212 * @return the previous code unit (after pre-decrementing the current index)
326 * limit, and previous() only checks the current index against the start,
411 * (public) Check if previous() can still return another code unit.
445 UCharIteratorPrevious *previous; member in struct:UCharIterator
514 * Helper function for UCharIterator to get the previous code point.
521 * @return the previous code point (after pre-decrementing the current index)
/external/webkit/Source/JavaScriptGlue/icu/unicode/
H A Duiter.h162 * Check if previous() can still return another code unit.
165 * @return boolean value for whether previous() can still return another code unit
205 * Function type declaration for UCharIterator.previous().
212 * @return the previous code unit (after pre-decrementing the current index)
326 * limit, and previous() only checks the current index against the start,
411 * (public) Check if previous() can still return another code unit.
445 UCharIteratorPrevious *previous; member in struct:UCharIterator
514 * Helper function for UCharIterator to get the previous code point.
521 * @return the previous code point (after pre-decrementing the current index)
/external/webkit/Source/WebCore/icu/unicode/
H A Duiter.h162 * Check if previous() can still return another code unit.
165 * @return boolean value for whether previous() can still return another code unit
205 * Function type declaration for UCharIterator.previous().
212 * @return the previous code unit (after pre-decrementing the current index)
326 * limit, and previous() only checks the current index against the start,
411 * (public) Check if previous() can still return another code unit.
445 UCharIteratorPrevious *previous; member in struct:UCharIterator
514 * Helper function for UCharIterator to get the previous code point.
521 * @return the previous code point (after pre-decrementing the current index)
/external/webkit/Source/WebKit/mac/icu/unicode/
H A Duiter.h162 * Check if previous() can still return another code unit.
165 * @return boolean value for whether previous() can still return another code unit
205 * Function type declaration for UCharIterator.previous().
212 * @return the previous code unit (after pre-decrementing the current index)
326 * limit, and previous() only checks the current index against the start,
411 * (public) Check if previous() can still return another code unit.
445 UCharIteratorPrevious *previous; member in struct:UCharIterator
514 * Helper function for UCharIterator to get the previous code point.
521 * @return the previous code point (after pre-decrementing the current index)
/external/icu4c/test/cintltst/
H A Dcustrtst.c1240 c1=iter1->previous(iter1);
1241 c2=iter2->previous(iter2);
1243 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
1335 c1=iter1->previous(iter1);
1336 c2=iter2->previous(iter2);
1338 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
1400 c=iter2->previous(iter2);
1402 log_err("%s->previous(a
[all...]
/external/webkit/Source/WebCore/editing/
H A DCompositeEditCommand.cpp500 VisiblePosition previousVisiblePos(visiblePos.previous());
501 Position previous(previousVisiblePos.deepEquivalent());
503 if (isCollapsibleWhitespace(previousVisiblePos.characterAfter()) && previous.deprecatedNode()->isTextNode() && !previous.deprecatedNode()->hasTagName(brTag))
504 replaceTextInNode(static_cast<Text*>(previous.deprecatedNode()), previous.deprecatedEditingOffset(), 1, nonBreakingSpaceString());
872 VisiblePosition beforeParagraph = startOfParagraphToMove.previous();
950 VisiblePosition beforeParagraph = startOfParagraphToMove.previous(CannotCrossEditingBoundary);
1116 VisiblePosition previous(caret.previous(CannotCrossEditingBoundar
[all...]
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
H A DCollationElementIteratorTest.java71 order = iterator.previous();
75 order = iterator.previous();
/external/stlport/src/
H A Dios.cpp124 locale previous = _M_locale; local
127 return previous;
/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/v8/src/
H A Dcontexts.cc40 current = current->previous();
228 // 3. Prepare to continue with the previous (next outermost) context.
232 context = Handle<Context>(context->previous(), isolate);
H A Dunicode.h154 static inline uchar Length(uchar chr, int previous);
156 char* out, uchar c, int previous);
/external/webkit/Source/WebCore/accessibility/
H A DAccessibilityObject.cpp223 tempPosition = startPosition.previous();
250 VisiblePosition prevVisiblePos = visiblePos.previous();
262 prevVisiblePos = prevVisiblePos.previous();
515 VisiblePosition prevVisiblePos = visiblePos.previous();
550 VisiblePosition prevVisiblePos = visiblePos.previous();
560 prevVisiblePos = prevVisiblePos.previous();
602 VisiblePosition previousVisiblePos = visiblePos.previous();
637 VisiblePosition previousPos = visiblePos.previous();

Completed in 632 milliseconds

1234567891011>>