/external/valgrind/helgrind/tests/ |
H A D | tc06_two_races_xml.stderr.exp | 95 <text>This conflicts with a previous write of size 4 by thread #x</text> 140 <text>This conflicts with a previous write of size 4 by thread #x</text> 185 <text>This conflicts with a previous write of size 4 by thread #x</text> 230 <text>This conflicts with a previous write of size 4 by thread #x</text>
|
/external/icu/icu4c/source/common/unicode/ |
H A D | uchriter.h | 178 * This can be used to begin an iteration with previous(). 283 * Advances to the previous code unit in the iteration range (toward 286 * @return the previous code unit in the iteration range. 289 virtual UChar previous(void); 292 * Advances to the previous code point in the iteration range (toward 295 * @return the previous code point in the iteration range. 303 * This is used with previous() or previous32() in backward
|
/external/icu/icu4c/source/i18n/unicode/ |
H A D | search.h | 150 * <tt>first</tt>, <tt>next</tt>, <tt>previous</tt>, or <tt>last</tt>. 159 * @see #previous 168 * to <tt>first</tt>, <tt>next</tt>, <tt>previous</tt>, or <tt>last</tt>. 175 * @see #previous 183 * <tt>first</tt>, <tt>next</tt>, <tt>previous</tt>, or <tt>last</tt>. 191 * @see #previous 384 * Returns the index of the previous point at which the string text 391 * @return The index of the previous match before the current position, 396 int32_t previous(UErrorCode &status); 515 * finding the previous matc [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
H A D | DirectSearchOptimizer.java | 74 * previous and current simplex to the convergence checker, not the best ones.</p> 289 RealPointValuePair[] previous = new RealPointValuePair[simplex.length]; 295 converged &= checker.converged(iterations, previous[i], simplex[i]); 304 System.arraycopy(simplex, 0, previous, 0, simplex.length);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
H A D | NonLinearConjugateGradientOptimizer.java | 146 RealPointValuePair previous = current; 148 if (previous != null) { 149 if (checker.converged(getIterations(), previous, current)) {
|
/external/autotest/client/common_lib/ |
H A D | pxssh.py | 114 previous, current = current, [i]+[0]*n 116 add, delete = previous[j]+1, current[j-1]+1 117 change = previous[j-1]
|
/external/chromium-trace/catapult/third_party/closure_linter/closure_linter/ |
H A D | tokenutil_test.py | 187 existing_token2.previous = existing_token1 194 self.assertEquals(existing_token1, new_token.previous) 198 self.assertEquals(new_token, existing_token2.previous)
|
H A D | indentation.py | 371 if token.type == Type.START_PAREN and token.previous: 374 prev = token.previous 437 return (token.previous and token.previous.IsFirstInLine() and 438 token.previous.type == Type.WHITESPACE) 506 # override should still apply for all previous stack tokens that are 511 last_token = token_info.token.previous
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ |
H A D | utils.py | 680 self.previous = self.next = None 725 item.previous = None 728 self.head.previous = item 738 self.tail = self.tail.previous 747 previous = item.previous 748 previous.next = item.next 750 item.next.previous = previous 752 self.tail = previous [all...] |
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/ |
H A D | ConnectionPool.java | 140 Connection connection = i.previous(); 278 Connection connection = i.previous(); 292 Connection connection = i.previous();
|
/external/guava/guava/src/com/google/common/cache/ |
H A D | LocalCache.java | 805 * Returns the previous entry in the access queue. 810 * Sets the previous entry in the access queue. 812 void setPreviousInAccessQueue(ReferenceEntry<K, V> previous); argument 841 * Returns the previous entry in the write queue. 846 * Sets the previous entry in the write queue. 848 void setPreviousInWriteQueue(ReferenceEntry<K, V> previous); argument 899 public void setPreviousInAccessQueue(ReferenceEntry<Object, Object> previous) {} argument 923 public void setPreviousInWriteQueue(ReferenceEntry<Object, Object> previous) {} argument 978 public void setPreviousInAccessQueue(ReferenceEntry<K, V> previous) { argument 1008 public void setPreviousInWriteQueue(ReferenceEntry<K, V> previous) { argument 1146 setPreviousInAccessQueue(ReferenceEntry<K, V> previous) argument 1192 setPreviousInWriteQueue(ReferenceEntry<K, V> previous) argument 1238 setPreviousInAccessQueue(ReferenceEntry<K, V> previous) argument 1278 setPreviousInWriteQueue(ReferenceEntry<K, V> previous) argument 1331 setPreviousInAccessQueue(ReferenceEntry<K, V> previous) argument 1363 setPreviousInWriteQueue(ReferenceEntry<K, V> previous) argument 1436 setPreviousInAccessQueue(ReferenceEntry<K, V> previous) argument 1483 setPreviousInWriteQueue(ReferenceEntry<K, V> previous) argument 1530 setPreviousInAccessQueue(ReferenceEntry<K, V> previous) argument 1570 setPreviousInWriteQueue(ReferenceEntry<K, V> previous) argument 1922 connectAccessOrder(ReferenceEntry<K, V> previous, ReferenceEntry<K, V> next) argument 1935 connectWriteOrder(ReferenceEntry<K, V> previous, ReferenceEntry<K, V> next) argument [all...] |
/external/guice/core/src/com/google/inject/spi/ |
H A D | InjectionPoint.java | 434 InjectableMember previous; field in class:InjectionPoint.InjectableMember 507 member.previous = tail; 514 if (member.previous != null) { 515 member.previous.next = member.next; 518 member.next.previous = member.previous; 524 tail = member.previous;
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/httplib2/python2/ |
H A D | httplib2test.py | 261 self.assertEqual(response.previous, None) 310 self.assertEqual(response.previous.status, 300) 311 self.assertEqual(response.previous.fromcache, False) 317 self.assertEqual(response.previous.status, 300) 318 self.assertEqual(response.previous.fromcache, False) 334 self.assertEqual(response.previous, None) 346 self.assertEqual(response.previous.status, 301) 347 self.assertEqual(response.previous.fromcache, False) 353 self.assertEqual(response.previous.status, 301) 354 self.assertEqual(response.previous [all...] |
/external/chromium-trace/catapult/third_party/gsutil/third_party/httplib2/python3/ |
H A D | httplib2test.py | 241 self.assertEqual(response.previous, None)
290 self.assertEqual(response.previous.status, 300)
291 self.assertEqual(response.previous.fromcache, False)
297 self.assertEqual(response.previous.status, 300)
298 self.assertEqual(response.previous.fromcache, False)
314 self.assertEqual(response.previous, None)
326 self.assertEqual(response.previous.status, 301)
327 self.assertEqual(response.previous.fromcache, False)
333 self.assertEqual(response.previous.status, 301)
334 self.assertEqual(response.previous [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | RuleBasedBreakIterator.java | 352 // so a loop like for(p=it.last(); p!=DONE; p=it.previous()) ... 363 * equivalent to repeatedly calling next() or previous(). 376 result = previous(); 574 public int previous() { method in class:RuleBasedBreakIterator 740 // previous will give result 0 or 1 boundary away from offset, 743 int oldresult = previous(); 745 result = previous(); 770 result = previous(); 825 // position specified by the caller, we can just use previous() 838 result = previous(); [all...] |
/external/icu/icu4c/source/common/ |
H A D | rbbi.cpp | 439 // previous call to this function, delete it now. 556 * equivalent to repeatedly calling next() or previous(). 569 result = previous(); 607 int32_t RuleBasedBreakIterator::previous(void) { function in class:RuleBasedBreakIterator 769 // previous will give result 0 or 1 boundary away from offset, 772 int32_t oldresult = previous(); 774 int32_t result = previous(); 800 result = previous(); 857 // position specified by the caller, we can just use previous() 883 result = previous(); [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | RuleBasedBreakIterator.java | 360 // so a loop like for(p=it.last(); p!=DONE; p=it.previous()) ... 371 * equivalent to repeatedly calling next() or previous(). 385 result = previous(); 585 public int previous() { method in class:RuleBasedBreakIterator 752 // previous will give result 0 or 1 boundary away from offset, 755 int oldresult = previous(); 757 result = previous(); 782 result = previous(); 838 // position specified by the caller, we can just use previous() 851 result = previous(); [all...] |
/external/sfntly/cpp/src/test/tinyxml/ |
H A D | tinyxml.h | 558 IterateChildren takes the previous child as input and finds 559 the next one. If the previous child is null, it returns the 562 const TiXmlNode* IterateChildren( const TiXmlNode* previous ) const; 563 TiXmlNode* IterateChildren( const TiXmlNode* previous ) { 564 return const_cast< TiXmlNode* >( (const_cast< const TiXmlNode* >(this))->IterateChildren( previous ) ); 568 const TiXmlNode* IterateChildren( const char * value, const TiXmlNode* previous ) const; 569 TiXmlNode* IterateChildren( const char * _value, const TiXmlNode* previous ) { 570 return const_cast< TiXmlNode* >( (const_cast< const TiXmlNode* >(this))->IterateChildren( _value, previous ) ); 574 const TiXmlNode* IterateChildren( const std::string& _value, const TiXmlNode* previous ) const { return IterateChildren (_value.c_str (), previous); } ///< ST [all...] |
/external/v8/src/compiler/ |
H A D | greedy-allocator.cc | 499 // instruction is the previous one. 606 LifetimePosition previous = range->Start(); local 607 for (UsePosition *pos = range->NextRegisterPosition(previous); pos != nullptr; 608 previous = previous.NextFullStart(), 609 pos = range->NextRegisterPosition(previous)) { 610 LifetimePosition optimal = FindOptimalSplitPos(previous, pos->pos());
|
/external/caliper/caliper/src/main/java/com/google/caliper/runner/ |
H A D | ExperimentingCaliperRun.java | 218 ListenableFuture<?> previous = Futures.successfulAsList(pendingTrials); 224 previous, 232 previous = Futures.withFallback(current, FALLBACK_TO_NULL);
|
/external/v8/src/regexp/ |
H A D | regexp-ast.cc | 312 static int IncreaseBy(int previous, int increase) { argument 313 if (RegExpTree::kInfinity - previous < increase) { 316 return previous + increase;
|
/external/libhevc/common/arm/ |
H A D | ihevc_intra_pred_chroma_mode_3_to_9.s | 369 vst1.8 d22, [r5], r3 @(from previous loop)st (row 5) 370 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6) 383 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6) 384 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7) 395 vst1.8 d18, [r5], r3 @(from previous loop)st (row 7) 480 vst1.8 d24, [r5], r3 @(from previous loop)st (row 5) 481 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6) 483 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6) 484 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7)
|
H A D | ihevc_intra_pred_luma_mode_3_to_9.s | 361 vst1.8 d22, [r5], r3 @(from previous loop)st (row 5) 362 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6) 376 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6) 377 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7) 388 vst1.8 d18, [r5], r3 @(from previous loop)st (row 7) 470 vst1.8 d24, [r5], r3 @(from previous loop)st (row 5) 471 vrshrn.i16 d20, q10, #5 @(from previous loop)round shft (row 6) 473 vst1.8 d20, [r5], r3 @(from previous loop)st (row 6) 474 vrshrn.i16 d18, q9, #5 @(from previous loop)round shft (row 7)
|
/external/aac/libSBRdec/src/ |
H A D | sbrdec_freq_sca.cpp | 532 int previous; local 537 previous = stop; /* Start with highest QMF channel */ 552 diff[i] = previous - current; 553 previous = current;
|
/external/aac/libSBRenc/src/ |
H A D | sbrenc_freq_sca.cpp | 562 INT previous; local 566 previous=start; 575 diff[i-1] = current-previous; 576 previous = current;
|