Searched defs:Pair (Results 1 - 25 of 69) 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/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/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/WebKit/Source/core/css/
H A DPair.h35 class Pair FINAL : public RefCounted<Pair> {
39 static PassRefPtr<Pair> create()
41 return adoptRef(new Pair);
43 static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second, IdenticalValuesPolicy identicalValuesPolicy)
45 return adoptRef(new Pair(first, second, identicalValuesPolicy));
61 bool equals(const Pair& other) const
79 Pair() function in class:WebCore::FINAL
84 Pair(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second, IdenticalValuesPolicy identicalValuesPolicy) function in class:WebCore::FINAL
/external/chromium_org/third_party/skia/src/core/
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/src/core/
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/chromium_org/third_party/skia/include/core/
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/include/core/
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/tests/
H A DGpuBitmapCopyTest.cpp31 struct Pair { struct
120 static const Pair gPairs[] = {
/external/stlport/test/unit/
H A Dalg_test.cpp335 typedef pair<int, string> Pair; typedef
338 public binary_function<const Pair&, const string&, bool>
340 bool operator () ( const Pair &p, const string& value ) const
/external/chromium/chrome/common/deprecated/
H A Devent_sys_unittest.cc20 class Pair;
23 Pair* source;
37 class Pair { class in namespace:__anon2838
40 explicit Pair(const std::string& name) : name_(name), a_(0), b_(0) { function in class:__anon2838::Pair
44 ~Pair() {
77 void Hookup(const std::string name, Pair::Channel* channel) {
121 Pair sally("Sally"), sam("Sam");
145 explicit ThreadTester(Pair* pair)
227 Pair* pair_;
238 Pair sall
[all...]
/external/llvm/lib/AsmParser/
H A DLLLexer.cpp75 uint64_t Pair[2]) {
76 Pair[0] = 0;
79 Pair[0] *= 16;
80 Pair[0] += hexDigitValue(*Buffer);
82 Pair[1] = 0;
84 Pair[1] *= 16;
85 Pair[1] += hexDigitValue(*Buffer);
94 uint64_t Pair[2]) {
95 Pair[1] = 0;
98 Pair[
74 HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]) argument
93 FP80HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]) argument
753 uint64_t Pair[2]; local
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/
H A DAbstractSampleEncryptionBox.java70 e.pairs = new LinkedList<Entry.Pair>();
163 for (Entry.Pair pair : entry.pairs) {
196 public List<Pair> pairs = new LinkedList<Pair>();
209 for (Entry.Pair pair : pairs) {
216 public Pair createPair(int clear, long encrypted) {
217 return new Pair(clear, encrypted);
221 public class Pair { class in class:AbstractSampleEncryptionBox.Entry
225 public Pair(int clear, long encrypted) { method in class:AbstractSampleEncryptionBox.Entry.Pair
239 Pair pai
[all...]

Completed in 902 milliseconds

123