Searched defs:Pair (Results 1 - 25 of 72) sorted by relevance

123

/external/chromium_org/v8/test/mjsunit/
H A Dindexed-accessors.js44 function Pair(x, y) { class
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/
H A Dindexed-accessors.js44 function Pair(x, y) { class
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/
H A DPair.java31 public class Pair<A, B> { class
35 public Pair(A first, B second) { method in class:Pair
/external/chromium_org/third_party/WebKit/Source/core/css/
H A DPair.h35 class Pair : public RefCounted<Pair> { class in namespace:WebCore
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) { } function in class:WebCore::Pair
71 Pair(PassRefPt function in class:WebCore::Pair
[all...]
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/
H A DPair.java16 * Pair of two objects.
21 public final class Pair<L, R> { class
30 public Pair(L left, R right) { method in class:Pair
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/
H A DPair.java24 public class Pair extends ASTree { class in inherits:ASTree
27 public Pair(ASTree _left, ASTree _right) { method in class:Pair
36 sbuf.append("(<Pair> ");
/external/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp169 std::pair<CachedResultsTy::iterator, bool> Pair = local
171 if (!Pair.second)
172 return Pair.first->second;
H A DDependencyAnalysis.cpp216 std::pair<BasicBlock *, BasicBlock::iterator> Pair = local
218 BasicBlock *LocalStartBB = Pair.first;
219 BasicBlock::iterator LocalStartPos = Pair.second;
/external/chromium_org/chrome/browser/chromeos/cros/
H A Denum_mapper.h28 // const EnumMapper<EnumFoo>::Pair index_table[] = {
39 struct Pair { struct in class:chromeos::EnumMapper
44 EnumMapper(const Pair* list, size_t num_entries, EnumType unknown)
/external/chromium_org/third_party/skia/src/effects/
H A DSkPorterDuff.cpp21 static const struct Pair { struct
48 const Pair* pairs = gPairs;
62 const Pair& pair = gPairs[mode];
68 const Pair& pair = gPairs[mode];
/external/llvm/include/llvm/ADT/
H A DDenseMapInfo.h135 typedef std::pair<T, U> Pair; typedef in struct:llvm::DenseMapInfo
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) {
H A DMapVector.h78 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0); local
79 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
94 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0); local
95 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
/external/skia/src/effects/
H A DSkPorterDuff.cpp21 static const struct Pair { struct
48 const Pair* pairs = gPairs;
62 const Pair& pair = gPairs[mode];
68 const Pair& pair = gPairs[mode];
/external/chromium_org/third_party/skia/include/core/
H A DSkDataSet.h30 struct Pair { struct in class:SkDataSet
36 SkDataSet(const Pair[], int count);
67 const SkDataSet::Pair* fPair;
68 const SkDataSet::Pair* fStop;
83 Pair* fPairs;
H A DSkTDict.h47 Pair* pair = fArray.insert(~index);
87 const Pair* end = fArray.end();
88 for (const Pair* pair = fArray.begin(); pair < end; pair++) {
98 struct Pair { struct in class:SkTDict
102 friend int operator<(const Pair& a, const Pair& b)
106 friend int operator!=(const Pair& a, const Pair& b)
134 const Pair* fIter;
135 const Pair* fSto
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkFlattenable.cpp68 struct Pair { struct
74 static Pair gPairs[MAX_PAIR_COUNT];
107 const Pair* pairs = gPairs;
120 const Pair* pairs = gPairs;
H A DSkPtrRecorder.h66 struct Pair { struct in class:SkPtrSet
75 SkTDArray<Pair> fList;
77 static bool Less(const Pair& a, const Pair& b);
/external/clang/lib/CodeGen/
H A DCGVTT.cpp163 std::pair<const CXXRecordDecl *, BaseSubobject> Pair = local
166 SecondaryVirtualPointerIndices.insert(std::make_pair(Pair, I->second));
/external/clang/test/Index/
H A Dindex-templates.cpp76 struct Pair { struct
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<
[all...]
H A Dload-stmts.cpp73 struct Pair { struct
74 Pair(int, int);
80 new (mem) Pair(i, j);
200 // CHECK: load-stmts.cpp:80:13: TypeRef=struct Pair:73:8 Extent=[80:13 - 80:17]
/external/javassist/src/main/javassist/bytecode/annotation/
H A DAnnotation.java48 static class Pair { class in class:Annotation
181 Pair p = new Pair();
194 Pair p = new Pair();
203 private void addMemberValue(Pair pair) {
272 Pair p = (Pair)members.get(name);
315 Pair pair = (Pair)i
[all...]
/external/skia/include/core/
H A DSkDataSet.h30 struct Pair { struct in class:SkDataSet
36 SkDataSet(const Pair[], int count);
67 const SkDataSet::Pair* fPair;
68 const SkDataSet::Pair* fStop;
83 Pair* fPairs;
H A DSkTDict.h47 Pair* pair = fArray.insert(~index);
87 const Pair* end = fArray.end();
88 for (const Pair* pair = fArray.begin(); pair < end; pair++) {
98 struct Pair { struct in class:SkTDict
102 friend int operator<(const Pair& a, const Pair& b)
106 friend int operator!=(const Pair& a, const Pair& b)
134 const Pair* fIter;
135 const Pair* fSto
[all...]
/external/skia/src/core/
H A DSkFlattenable.cpp68 struct Pair { struct
74 static Pair gPairs[MAX_PAIR_COUNT];
107 const Pair* pairs = gPairs;
120 const Pair* pairs = gPairs;
H A DSkPtrRecorder.h66 struct Pair { struct in class:SkPtrSet
75 SkTDArray<Pair> fList;
77 static bool Less(const Pair& a, const Pair& b);

Completed in 624 milliseconds

123