| /external/chromium_org/v8/test/mjsunit/ |
| indexed-accessors.js | 44 function Pair(x, y) {
48 Pair.prototype.__defineGetter__('0', function() { return this.x; });
49 Pair.prototype.__defineGetter__('1', function() { return this.y; });
50 Pair.prototype.__defineSetter__('0', function(x) { this.x = x; });
51 Pair.prototype.__defineSetter__('1', function(y) { this.y = y; });
53 var p = new Pair(2, 3);
|
| /external/v8/test/mjsunit/ |
| indexed-accessors.js | 44 function Pair(x, y) {
48 Pair.prototype.__defineGetter__('0', function() { return this.x; });
49 Pair.prototype.__defineGetter__('1', function() { return this.y; });
50 Pair.prototype.__defineSetter__('0', function(x) { this.x = x; });
51 Pair.prototype.__defineSetter__('1', function(y) { this.y = y; });
53 var p = new Pair(2, 3);
|
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
| Pair.java | 31 public class Pair<A, B> {
35 public Pair(A first, B second) {
|
| /frameworks/base/core/java/android/util/ |
| Pair.java | 26 public class Pair<F, S> {
31 * Constructor for a Pair.
33 * @param first the first object in the Pair
34 * @param second the second object in the pair
36 public Pair(F first, S second) {
45 * @param o the {@link Pair} to which this one is to be checked for equality
46 * @return true if the underlying objects of the Pair are both considered
51 if (!(o instanceof Pair)) {
54 Pair<?, ?> p = (Pair<?, ?>) o
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| Pair.h | 31 // A primitive value representing a pair. This is useful for properties like border-radius, background-size/position,
35 class Pair : public RefCounted<Pair> {
37 static PassRefPtr<Pair> create()
39 return adoptRef(new Pair);
41 static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second)
43 return adoptRef(new Pair(first, second));
45 virtual ~Pair() { }
59 bool equals(const Pair& other) const { return compareCSSValuePtr(m_first, other.m_first) && compareCSSValuePtr(m_second, other.m_second); }
70 Pair() : m_first(0), m_second(0) {
[all...] |
| /external/chromium_org/chrome/browser/chromeos/cros/ |
| enum_mapper.h | 28 // const EnumMapper<EnumFoo>::Pair index_table[] = {
39 struct Pair {
44 EnumMapper(const Pair* list, size_t num_entries, EnumType unknown)
|
| /external/chromium_org/third_party/skia/src/effects/ |
| SkPorterDuff.cpp | 21 static const struct Pair {
48 const Pair* pairs = gPairs;
62 const Pair& pair = gPairs[mode]; local
63 SkASSERT(pair.fPD == mode);
64 return pair.fXF;
68 const Pair& pair = gPairs[mode]; local
69 SkASSERT(pair.fPD == mode);
70 return SkXfermode::Create(pair.fXF)
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DenseMapInfo.h | 134 struct DenseMapInfo<std::pair<T, U> > {
135 typedef std::pair<T, U> Pair;
139 static inline Pair getEmptyKey() {
143 static inline Pair getTombstoneKey() {
147 static unsigned getHashValue(const Pair& PairVal) {
160 static bool isEqual(const Pair &LHS, const Pair &RHS) {
|
| MapVector.h | 32 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
67 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
68 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
69 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
70 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
78 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
79 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
93 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.cpp | 169 std::pair<CachedResultsTy::iterator, bool> Pair =
171 if (!Pair.second)
172 return Pair.first->second;
|
| DependencyAnalysis.cpp | 213 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist;
216 std::pair<BasicBlock *, BasicBlock::iterator> Pair =
218 BasicBlock *LocalStartBB = Pair.first;
219 BasicBlock::iterator LocalStartPos = Pair.second;
|
| /external/skia/src/effects/ |
| SkPorterDuff.cpp | 21 static const struct Pair {
48 const Pair* pairs = gPairs;
62 const Pair& pair = gPairs[mode]; local
63 SkASSERT(pair.fPD == mode);
64 return pair.fXF;
68 const Pair& pair = gPairs[mode]; local
69 SkASSERT(pair.fPD == mode);
70 return SkXfermode::Create(pair.fXF)
[all...] |
| /frameworks/base/libs/hwui/utils/ |
| Pair.h | 24 struct Pair {
28 Pair() { }
29 Pair(const Pair& o) : first(o.first), second(o.second) { }
30 Pair(const F& f, const S& s) : first(f), second(s) { }
44 struct trait_trivial_ctor< uirenderer::Pair<F, S> >
47 struct trait_trivial_dtor< uirenderer::Pair<F, S> >
50 struct trait_trivial_copy< uirenderer::Pair<F, S> >
53 struct trait_trivial_move< uirenderer::Pair<F, S> >
|
| /frameworks/wilhelm/src/ut/ |
| OpenSLESUT.c | 34 } Pair;
43 static Pair pairs[] = {
105 Pair *p;
106 const Pair *end = &pairs[sizeof(pairs)/sizeof(pairs[0])];
|
| /bionic/libc/bionic/ |
| strerror_r.cpp | 12 struct Pair {
17 static const char* __code_string_lookup(const Pair* strings, int code) {
26 static const Pair _sys_error_strings[] = {
36 static const Pair _sys_signal_strings[] = {
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkDataSet.h | 30 struct Pair {
36 SkDataSet(const Pair[], int count);
67 const SkDataSet::Pair* fPair;
68 const SkDataSet::Pair* fStop;
83 Pair* fPairs;
|
| SkTDict.h | 47 Pair* pair = fArray.insert(~index); local
51 pair->fName = copy;
52 pair->fValue = value;
87 const Pair* end = fArray.end();
88 for (const Pair* pair = fArray.begin(); pair < end; pair++) {
89 if (pair->fValue != value
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkPtrRecorder.h | 66 struct Pair {
75 SkTDArray<Pair> fList;
77 static bool Less(const Pair& a, const Pair& b);
|
| SkFlattenable.cpp | 68 struct Pair {
74 static Pair gPairs[MAX_PAIR_COUNT];
107 const Pair* pairs = gPairs;
120 const Pair* pairs = gPairs;
|
| /external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/ |
| Pair.java | 16 * Pair of two objects.
21 public final class Pair<L, R> {
30 public Pair(L left, R right) {
45 if (!(o instanceof Pair<?, ?>)) {
48 Pair<?, ?> other = (Pair<?, ?>) o;
78 public static <L, R> Pair<L, R> create(L left, R right) {
79 return new Pair<L, R>(left, right);
|
| /external/javassist/src/main/javassist/compiler/ast/ |
| Pair.java | 24 public class Pair extends ASTree {
27 public Pair(ASTree _left, ASTree _right) {
36 sbuf.append("(<Pair> ");
|
| /external/skia/include/core/ |
| SkDataSet.h | 30 struct Pair {
36 SkDataSet(const Pair[], int count);
67 const SkDataSet::Pair* fPair;
68 const SkDataSet::Pair* fStop;
83 Pair* fPairs;
|
| /external/skia/src/core/ |
| SkPtrRecorder.h | 66 struct Pair {
75 SkTDArray<Pair> fList;
77 static bool Less(const Pair& a, const Pair& b);
|
| /external/clang/lib/CodeGen/ |
| CGVTT.cpp | 163 std::pair<const CXXRecordDecl *, BaseSubobject> Pair =
166 SecondaryVirtualPointerIndices.insert(std::make_pair(Pair, I->second));
|
| /external/clang/test/Index/ |
| index-templates.cpp | 76 struct Pair {
85 Pair<T, U> p = { t, second_type(u) };
92 typename Comparison = compare<Pair<Key, Value> >,
93 typename Allocator = allocator<Pair<Key, Value> > >
96 void f(map<Z4, Pair<int, Z4> >);
98 template class Pair<int, int>;
101 struct SuperPair : Pair<int, int>, Pair<T, U> { };
179 // CHECK-LOAD: index-templates.cpp:101:20: C++ base class specifier=Pair<int, int>:98:16 [access=public isVirtual=false] Extent=[101:20 - 101:34]
180 // CHECK-LOAD: index-templates.cpp:101:36: C++ base class specifier=Pair<T, U>:76:8 [access=public isVirtual=false] Extent=[101:36 - 101:46
[all...] |
