/external/chromium_org/tools/site_compare/ |
H A D | site_compare.py | 3 # Use of this source code is governed by a BSD-style license that can be 23 import operators # Functions that, given two bitmaps as input, produce namespace 25 import scrapers # Functions that know how to capture a render from namespace
|
/external/chromium_org/v8/src/ |
H A D | effects.h | 2 // Use of this source code is governed by a BSD-style license that can be 67 // NestedEffects is an incremental representation that supports persistence 76 // store typings. In that case, only definite effects are of interest. 104 void Seq(Effects that) { argument 106 that.ForEach(&merge); 118 void Alt(Effects that) { argument 119 AltWeakener<EffectsMixin> weaken = { *this, that }; 122 that.ForEach(&merge);
|
H A D | hydrogen-load-elimination.cc | 2 // Use of this source code is governed by a BSD-style license that can be 160 HLoadEliminationTable* Merge(HBasicBlock* succ, HLoadEliminationTable* that, argument 162 if (that->fields_.length() < fields_.length()) { 164 fields_.Rewind(that->fields_.length()); 172 HFieldApproximation* other = that->Find(approx->object_, i); 174 // Kill an entry that doesn't agree with the other value. 227 // the stored values are the same), return NULL indicating that this store 347 // Kill all entries for a given field that _may_ alias the given object 357 // Kill an aliasing entry that doesn't agree on the value. 380 // Remove the last approximation for a field so that i 476 Union(HLoadEliminationEffects* that, Zone* zone) argument [all...] |
H A D | hydrogen-check-elimination.cc | 2 // Use of this source code is governed by a BSD-style license that can be 33 // Same as CHECKED, but we also know that these maps are stable. 37 // but became UNCHECKED_STABLE because of an instruction that changes maps 310 HCheckTable* Merge(HBasicBlock* succ, HCheckTable* that, argument 312 if (that->size_ == 0) { 326 that_entry = that->Find(phi_operand); 329 that_entry = that->Find(this_entry->object_); 419 // Update map set and ensure that the check is alive. 630 // Can only learn more about an object that already has a known set of maps. 682 // Kill everything in the table that ma 850 Union(HCheckMapsEffects* that, Zone* zone) argument [all...] |
H A D | types.cc | 2 // Use of this source code is governed by a BSD-style license that can be 14 // NOTE: If code is marked as being a "shortcut", this means that removing 240 // because it means that the template isn't actually parametric. 395 bool TypeImpl<Config>::SimplyEquals(TypeImpl* that) { argument 398 return that->IsClass() 399 && *this->AsClass()->Map() == *that->AsClass()->Map(); 402 return that->IsConstant() 403 && *this->AsConstant()->Value() == *that->AsConstant()->Value(); 406 return that->IsContext() 407 && this->AsContext()->Outer()->Equals(that 434 SlowIs(TypeImpl* that) argument 473 NowIs(TypeImpl* that) argument 505 Maybe(TypeImpl* that) argument [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | choicfmt.cpp | 111 ChoiceFormat::ChoiceFormat(const ChoiceFormat& that) argument 112 : NumberFormat(that), 113 constructorErrorCode(that.constructorErrorCode), 114 msgPattern(that.msgPattern) 119 // Private constructor that creates a 134 ChoiceFormat::operator==(const Format& that) const 136 if (this == &that) return TRUE; 137 if (!NumberFormat::operator==(that)) return FALSE; 138 ChoiceFormat& thatAlias = (ChoiceFormat&)that; 146 ChoiceFormat::operator=(const ChoiceFormat& that) argument [all...] |
H A D | reldtfmt.cpp | 120 // Initialize the parent fCalendar, so that parse() works correctly. 144 RelativeDateFormat* that = (RelativeDateFormat*)&other; local 145 return (fDateStyle==that->fDateStyle && 146 fDatePattern==that->fDatePattern && 147 fTimePattern==that->fTimePattern && 148 fLocale==that->fLocale ); 233 // format() on DateFormat that this function correspond to, so we 324 // offset in the replaced text, set it to the beginning of that text
|
/external/icu/icu4c/source/layout/ |
H A D | GlyphIterator.cpp | 47 GlyphIterator::GlyphIterator(GlyphIterator &that) argument 48 : glyphStorage(that.glyphStorage) 50 direction = that.direction; 51 position = that.position; 52 nextLimit = that.nextLimit; 53 prevLimit = that.prevLimit; 55 glyphPositionAdjustments = that.glyphPositionAdjustments; 56 srcIndex = that.srcIndex; 57 destIndex = that.destIndex; 58 lookupFlags = that 66 GlyphIterator(GlyphIterator &that, FeatureMask newFeatureMask) argument 85 GlyphIterator(GlyphIterator &that, le_uint16 newLookupFlags) argument [all...] |
/external/llvm/lib/Support/ |
H A D | APInt.cpp | 49 /// A utility function that converts a character to a digit. 85 void APInt::initSlowCase(const APInt& that) { argument 87 memcpy(pVal, that.pVal, getNumWords() * APINT_WORD_SIZE); 324 /// the integer array dest. Note that dest's size must be >= xlen + ylen. 641 // the first few digits. But, I'm not sure how accurate that could be. 643 // Compute a sufficient number of bits that is always large enough but might 646 // bits in that case. 881 // we are using. Note that the sign bit is gone since we constructed the 1358 // (especially the properties numbered 3, 4 and 9) it can be proved that 1393 /// by a constant as a sequence of multiplies, adds and shifts. Requires that [all...] |
/external/oprofile/libpopt/ |
H A D | popthelp.c | 722 const void * that = done->opts[i]; local 724 if (that == NULL || that != opt->arg)
|
/external/skia/include/core/ |
H A D | SkTemplates.h | 5 * Use of this source code is governed by a BSD-style license that can be 25 * Note that this does *not* prevent the local variable from being optimized away. 62 // This relies on the fact that reinterpret_cast can add constness, but cannot remove it. 71 parameters, the object, and a function that is to be called in the destructor. 88 parameters, the object, and a function that is to be called in the destructor. 103 An SkAutoTDelete<T> is like a T*, except that the destructor of SkAutoTDelete<T> 105 owns the T object that it points to. Like a T*, an SkAutoTDelete<T> may hold 138 * pointer to NULL. Note that this differs from get(), which also returns 147 void swap(SkAutoTDelete* that) { argument 148 SkTSwap(fObj, that [all...] |
/external/skia/src/ports/ |
H A D | SkRemotableFontMgr_win_dw.cpp | 4 * Use of this source code is governed by a BSD-style license that can be 55 explicit DataId(DataId& that) argument 56 : fLoader(that.fLoader), fKey(that.fKey), fKeySize(that.fKeySize) 58 that.fLoader = NULL; 59 that.fKey = NULL; 60 SkDEBUGCODE(that.fKeySize = 0xFFFFFFFF;) 309 // It is possible that the font passed does not actually have the requested character, 311 // Check that th [all...] |
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | citrtest.cpp | 53 virtual UBool operator==(const ForwardCharacterIterator& /*that*/) const{ 130 SCharacterIterator& operator=(const SCharacterIterator& that){ argument 131 text = that.text; 1084 virtual UBool operator==(const ForwardCharacterIterator &that) const { 1086 this==&that || 1087 (typeid(*this)==typeid(that) && pos==((SubCharIter &)that).pos); 1162 // coverage - call functions that are not otherwise tested 1163 // first[32]PostInc() are default implementations that are overridden
|
H A D | srchtest.cpp | 1046 // test collator that thinks "o" and "p" are the same thing 1901 /* test collator that thinks "o" and "p" are the same thing */ 2284 UBool operator!=(const TestSearch &that) const; 2291 TestSearch & operator=(const TestSearch &that); 2347 UBool TestSearch::operator!=(const TestSearch &that) const 2349 if (SearchIterator::operator !=(that)) { 2352 return m_offset_ != that.m_offset_ || m_pattern_ != that.m_pattern_; 2393 TestSearch & TestSearch::operator=(const TestSearch &that) argument 2395 SearchIterator::operator=(that); [all...] |
/external/chromium_org/third_party/re2/re2/ |
H A D | regexp.cc | 3 // license that can be found in the LICENSE file. 30 // that could cause arbitrarily deep recursion, so 306 // Swaps this and that in place. 307 void Regexp::Swap(Regexp* that) { argument 311 memmove(this, that, sizeof tmp); 312 memmove(that, tmp, sizeof tmp); 548 // (The rule is that if you have the same name 615 // the regexp that remains after the prefix. The prefix might 690 // ranges as equal if they overlap at all, so that 751 // any that overla [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkClipStack.cpp | 4 * Use of this source code is governed by a BSD-style license that can be 20 SkClipStack::Element::Element(const Element& that) { argument 21 switch (that.getType()) { 28 fRRect = that.fRRect; 31 fPath.set(that.getPath()); 35 fSaveCount = that.fSaveCount; 36 fOp = that.fOp; 37 fType = that.fType; 38 fDoAA = that.fDoAA; 39 fFiniteBoundType = that [all...] |
/external/clang/test/Parser/ |
H A D | MicrosoftExtensions.cpp | 144 CtorCall& operator=(const CtorCall& that); 149 CtorCall& CtorCall::operator=(const CtorCall& that) argument 151 if (this != &that) { 153 this->CtorCall::CtorCall(that); // expected-warning {{explicit constructor calls are a Microsoft extension}}
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | OrderingTest.java | 143 ASSERT.that(list).hasContentsInOrder(8, 6, 7, 5, 3, 0, 9); 155 // A more limited test than the one that follows, but this one uses the 166 // Now we don't care what order it's put the list in, only that 190 // Now we don't care what order it's put the list in, only that 328 assertTrue(comparator.compare("that", "to") > 0); 346 assertTrue(comparator.compare("to", "that") > 0); 653 * Now we have monster tests that create hundreds of Orderings using different 705 * An aggregation of an ordering with a list (of size > 1) that should prove 706 * to be in strictly increasing order according to that ordering. 748 * responsible for creating the alternate Ordering, and providing a List that 863 compareTo(Composite<T> that) argument [all...] |
/external/icu/icu4c/source/test/intltest/ |
H A D | citrtest.cpp | 53 virtual UBool operator==(const ForwardCharacterIterator& /*that*/) const{ 130 SCharacterIterator& operator=(const SCharacterIterator& that){ argument 131 text = that.text; 1084 virtual UBool operator==(const ForwardCharacterIterator &that) const { 1086 this==&that || 1087 (typeid(*this)==typeid(that) && pos==((SubCharIter &)that).pos); 1162 // coverage - call functions that are not otherwise tested 1163 // first[32]PostInc() are default implementations that are overridden
|
H A D | srchtest.cpp | 1046 // test collator that thinks "o" and "p" are the same thing 1901 /* test collator that thinks "o" and "p" are the same thing */ 2284 UBool operator!=(const TestSearch &that) const; 2291 TestSearch & operator=(const TestSearch &that); 2347 UBool TestSearch::operator!=(const TestSearch &that) const 2349 if (SearchIterator::operator !=(that)) { 2352 return m_offset_ != that.m_offset_ || m_pattern_ != that.m_pattern_; 2393 TestSearch & TestSearch::operator=(const TestSearch &that) argument 2395 SearchIterator::operator=(that); [all...] |
/external/nist-sip/java/gov/nist/javax/sip/address/ |
H A D | SipUri.java | 137 * @param that the object to compare to. 152 public boolean equals(Object that) { argument 155 if (that==this) return true; 157 if (that instanceof SipURI) { 159 final SipURI b = (SipURI) that; 227 // Finally, we can conclude that they are indeed equal 346 * @return Get the query headers (that appear after the ? in 383 * provided that the user is a telephone subscriber. 435 * "telephone-subscriber" that are not either in the set 439 * various syntax elements that nee [all...] |
/external/regex-re2/re2/ |
H A D | regexp.cc | 3 // license that can be found in the LICENSE file. 30 // that could cause arbitrarily deep recursion, so 306 // Swaps this and that in place. 307 void Regexp::Swap(Regexp* that) { argument 311 memmove(this, that, sizeof tmp); 312 memmove(that, tmp, sizeof tmp); 548 // (The rule is that if you have the same name 615 // the regexp that remains after the prefix. The prefix might 690 // ranges as equal if they overlap at all, so that 751 // any that overla [all...] |
/external/skia/src/core/ |
H A D | SkClipStack.cpp | 4 * Use of this source code is governed by a BSD-style license that can be 20 SkClipStack::Element::Element(const Element& that) { argument 21 switch (that.getType()) { 28 fRRect = that.fRRect; 31 fPath.set(that.getPath()); 35 fSaveCount = that.fSaveCount; 36 fOp = that.fOp; 37 fType = that.fType; 38 fDoAA = that.fDoAA; 39 fFiniteBoundType = that [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.core.expressions_3.4.200.v20100505.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/chromium_org/base/files/ |
H A D | file_path.cc | 2 // Use of this source code is governed by a BSD-style license that can be 50 // This is dependent on an ASCII-based character set, but that's a 108 // Find the position of the '.' that separates the extension from the rest 177 FilePath::FilePath(const FilePath& that) : path_(that.path_) { argument 189 FilePath& FilePath::operator=(const FilePath& that) { argument 190 path_ = that.path_; 194 bool FilePath::operator==(const FilePath& that) const { 196 return EqualDriveLetterCaseInsensitive(this->path_, that.path_); 198 return path_ == that [all...] |