/external/v8/include/ |
H A D | v8.h | 2 // Use of this source code is governed by a BSD-style license that can be 32 build configuration to ensure that at most one of these is set 177 * collector so that it knows that the objects are still alive. Also, 215 template <class S> V8_INLINE Handle(Handle<S> that) argument 216 : val_(reinterpret_cast<T*>(*that)) { 245 template <class S> V8_INLINE bool operator==(const Handle<S>& that) const { 247 internal::Object** b = reinterpret_cast<internal::Object**>(that.val_); 254 const PersistentBase<S>& that) const { 256 internal::Object** b = reinterpret_cast<internal::Object**>(that 277 Cast(Handle<S> that) argument 290 New(Isolate* isolate, Handle<T> that) argument 293 New(Isolate* isolate, const PersistentBase<T>& that) argument 337 Local(Local<S> that) argument 348 Cast(Local<S> that) argument 356 Local(Handle<S> that) argument 392 Local(S* that) argument 638 Persistent(Isolate* isolate, Handle<S> that) argument 648 Persistent(Isolate* isolate, const Persistent<S, M2>& that) argument 658 Persistent(const Persistent& that) argument 662 Persistent(const Persistent<S, M2>& that) argument 665 operator =(const Persistent& that) argument 670 operator =(const Persistent<S, M2>& that) argument 685 Cast(Persistent<S>& that) argument 710 Persistent(S* that) argument 740 UniquePersistent(Isolate* isolate, Handle<S> that) argument 750 UniquePersistent(Isolate* isolate, const PersistentBase<S>& that) argument 2596 ReturnValue(const ReturnValue<S>& that) argument 5963 New(Isolate* isolate, Handle<T> that) argument 5968 New(Isolate* isolate, const PersistentBase<T>& that) argument 5973 New(Isolate* isolate, T* that) argument 5983 New(Isolate* isolate, T* that) argument 6007 New(Isolate* isolate, T* that) argument 6018 Copy(const Persistent<S, M2>& that) argument [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | fmtable.cpp | 49 // NOTE: These inlines assume that all fObjects are in fact instances 275 Formattable::operator==(const Formattable& that) const 279 if (this == &that) return TRUE; 282 if (fType != that.fType) return FALSE; 288 equal = (fValue.fDate == that.fValue.fDate); 291 equal = (fValue.fDouble == that.fValue.fDouble); 295 equal = (fValue.fInt64 == that.fValue.fInt64); 298 equal = (*(fValue.fString) == *(that.fValue.fString)); 301 if (fValue.fArrayAndCount.fCount != that.fValue.fArrayAndCount.fCount) { 307 if (fValue.fArrayAndCount.fArray[i] != that [all...] |
H A D | msgfmt.cpp | 93 0 /* empty string, used for default so that null can mark end of list */ 295 MessageFormat::MessageFormat(const MessageFormat& that) argument 297 Format(that), 298 fLocale(that.fLocale), 299 msgPattern(that.msgPattern), 305 hasArgTypeConflicts(that.hasArgTypeConflicts), 315 copyObjects(that, ec); 369 MessageFormat::operator=(const MessageFormat& that) argument 371 if (this != &that) { 373 Format::operator=(that); 1304 copyObjects(const MessageFormat& that, UErrorCode& ec) argument [all...] |
/external/iproute2/doc/ |
H A D | ip-tunnels.tex | 55 A: Yes, in 2.2 the rule that {\em normal} gateway must reside on directly 56 connected network has not any exceptions. You may tell kernel, that 62 Note keyword \verb|onlink|, it is the magic key that orders kernel 74 that between \verb|route add| and \verb|route del| host 193.233.7.65 is 89 inner packet to outer one. It means that path traversed by tunneled 91 are going to use some routing protocol expecting that packets 184 say that they are zero or wildcard. Two tunnels of one mode cannot 186 that base device or fallback tunnel cannot be replicated.\footnote{ 199 some features related to the fact that they work over existing Internet 201 which changes this infrastructure. The danger that no [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | token.rb | 11 modification, are permitted provided that the following conditions 39 At a minimum, tokens are data structures that bind together a chunk of text and 46 categorization that groups things on a larger scale. Parsers will usually ignore 47 tokens that have channel value 99 (the HIDDEN_CHANNEL), so you can keep things 60 you may write your own token class as long as you provide methods that give 297 TokenSource is a simple mixin module that demands an 340 that need to create token objects This module serves as a mixin that provides 346 that can be called without any parameters and the token objects are expected to 377 dynamically defined modules that ma [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/ |
H A D | rule-tracer.rb | 8 RuleTracer is simple debug event listener that writes the names of rule methods
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/lexer/ |
H A D | filter-mode.rb | 73 example "skipping tokens that aren't important with filter mode" do
|
/external/bison/build-aux/ |
H A D | do-release-commit-and-tag | 17 # This program is distributed in the hope that it will be useful, 38 recorded. Commit that result with a log entry marking the release, 121 # Verify that $ver looks like a version number, and... 127 # Verify that $ver is sensible (> .prev-version). 153 # Check that line 3 of NEWS is the stub line about to be replaced.
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | RegularContiguousSet.java | 30 * An implementation of {@link ContiguousSet} that contains one or more elements. 164 RegularContiguousSet<?> that = (RegularContiguousSet<?>) object; 165 if (this.domain.equals(that.domain)) { 166 return this.first().equals(that.first()) 167 && this.last().equals(that.last());
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | Bytes.java | 35 * Static utility methods pertaining to {@code byte} primitives, that are not 111 * <p>More formally, returns the lowest index {@code i} such that {@code 222 * that method. 347 ByteArrayAsList that = (ByteArrayAsList) object; 349 if (that.size() != size) { 353 if (array[start + i] != that.array[that.start + i]) {
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ImmutableEnumMapTest.java | 58 ASSERT.that(map.entrySet()).has().exactly(
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | MultimapKeysTester.java | 53 ASSERT.that(keys).has().allOf(sampleKeys().e0, sampleKeys().e1); 54 ASSERT.that(keys.entrySet()).has().allOf( 75 ASSERT.that(keys).has().allOf(null, sampleKeys().e1); 76 ASSERT.that(keys.entrySet()).has().allOf(
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ArrayListMultimapTest.java | 80 * Confirm that get() returns a List implementing RandomAccess. 91 * Confirm that removeAll() returns a List implementing RandomAccess. 102 * Confirm that replaceValues() returns a List implementing RandomAccess. 122 ASSERT.that(multimap.get("foo")).has().exactly(1, 2, 3, 4, 5).inOrder(); 124 ASSERT.that(sublist).has().exactly(1, 2, 3, 4, 5).inOrder(); 193 ASSERT.that(multimap.get("foo")).has().exactly(1, 2).inOrder(); 194 ASSERT.that(multimap.get("bar")).has().item(3);
|
/external/libunwind/doc/ |
H A D | unw_backtrace.tex | 27 Note that many (but not all) systems provide practically identical function 38 \Var{buffer}. The return value may be zero to indicate that no addresses were
|
H A D | unw_get_accessors.tex | 21 routines that were specified when address space \Var{as} was created 26 Note that \Func{unw\_get\_accessors}() can be used to retrieve the
|
/external/libvpx/libvpx/vp8/common/ppc/ |
H A D | copy_altivec.asm | 5 ; that can be found in the LICENSE file in the root of the source 19 ;# Make the assumption that input will not be aligned,
|
/external/llvm/lib/Support/Windows/ |
H A D | DynamicLibrary.inc | 61 // Dummy library that represents "search all handles". 62 // This is mostly to ensure that the return value still shows up as "valid".
|
/external/llvm/test/MC/ARM/ |
H A D | ldr-pseudo-obj-errors.s | 6 @These tests look for errors that should be reported for invalid object layout
|
H A D | macho-relocs-with-addend.s | 4 @ MachO relocations that end up expressed as internal
|
/external/llvm/test/MC/Mips/ |
H A D | mips-noat.s | 3 # Check that using the assembler temporary when .set noat is in effect is an error.
|
/external/llvm/test/MC/X86/AlignedBundling/ |
H A D | relax-in-bundle-group.s | 6 # Test that instructions inside bundle-locked groups are relaxed even if their
|
/external/skia/src/core/ |
H A D | SkPixelRef.cpp | 4 * Use of this source code is governed by a BSD-style license that can be 129 void SkPixelRef::cloneGenID(const SkPixelRef& that) { argument 130 // This is subtle. We must call that.getGenerationID() to make sure its genID isn't 0. 131 uint32_t genID = that.getGenerationID(); 134 // (These & ~1u are actually redundant. that.getGenerationID() just did it for us.) 136 that. fTaggedGenID.store(genID & ~1u); 140 SkASSERT(!that. genIDIsUnique());
|
/external/skia/src/gpu/ |
H A D | GrAARectRenderer.cpp | 4 * Use of this source code is governed by a BSD-style license that can be 181 AAFillRectBatch* that = t->cast<AAFillRectBatch>(); variable 183 SkASSERT(this->usesLocalCoords() == that->usesLocalCoords()); 186 // using vertex attributes in these cases, but haven't investigated that 187 if (this->usesLocalCoords() && !this->viewMatrix().cheapEqualTo(that->viewMatrix())) { 191 if (this->color() != that->color()) { 197 if (this->canTweakAlphaForCoverage() != that->canTweakAlphaForCoverage()) { 201 fGeoData.push_back_n(that->geoData()->count(), that->geoData()->begin()); 202 this->joinBounds(that 631 AAStrokeRectBatch* that = t->cast<AAStrokeRectBatch>(); variable [all...] |
H A D | GrGeometryProcessor.h | 4 * Use of this source code is governed by a BSD-style license that can be 31 const GrPrimitiveProcessor& that, 49 * GrColor_ILLEGAL) then we must always emit that color(currently overrides are only supported
|
/external/v8/src/compiler/ |
H A D | operator.h | 2 // Use of this source code is governed by a BSD-style license that can be 33 // transformations for nodes that have this operator. 105 // An implementation of Operator that has no static parameters. Such operators 114 virtual bool Equals(const Operator* that) const FINAL { 115 return opcode() == that->opcode(); 211 // A templatized implementation of Operator that has one static parameter of 228 const Operator1<T>* that = static_cast<const Operator1<T>*>(other); variable 229 return StaticParameterTraits<T>::Equals(this->parameter_, that->parameter_);
|