/external/v8/test/mjsunit/ |
H A D | indexed-accessors.js | 44 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 D | Pair.java | 31 public class Pair<A, B> { class 35 public Pair(A first, B second) { method in class:Pair
|
/external/webkit/Source/WebCore/css/ |
H A D | Pair.h | 34 class Pair : public RefCounted<Pair> { class in namespace:WebCore 36 static PassRefPtr<Pair> create() 38 return adoptRef(new Pair); 40 static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) 42 return adoptRef(new Pair(first, second)); 44 virtual ~Pair() { } 53 Pair() : m_first(0), m_second(0) { } function in class:WebCore::Pair 54 Pair(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) function in class:WebCore::Pair
|
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/ |
H A D | Pair.java | 16 * 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 D | Pair.java | 24 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/skia/include/core/ |
H A D | SkPtrRecorder.h | 63 struct Pair { struct in class:SkPtrSet 72 SkTDArray<Pair> fList; 74 static int Cmp(const Pair& a, const Pair& b);
|
H A D | SkTDict.h | 47 Pair* pair = fArray.insert(~index); 87 Pair* end = fArray.end(); 88 for (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 Pair* fIter; 135 Pair* fSto [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | DenseMapInfo.h | 135 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) {
|
/external/skia/src/effects/ |
H A D | SkPorterDuff.cpp | 21 static const struct Pair { struct 48 const Pair* pairs = gPairs; 62 const Pair& pair = gPairs[mode]; 68 const Pair& pair = gPairs[mode];
|
/external/clang/test/Index/ |
H A D | index-templates.cpp | 76 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 D | load-stmts.cpp | 73 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 D | Annotation.java | 48 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/clang/lib/CodeGen/ |
H A D | CGVTT.cpp | 181 std::pair<const CXXRecordDecl *, BaseSubobject> Pair = local 184 SecondaryVirtualPointerIndices.insert(std::make_pair(Pair, I->second));
|
/external/stlport/test/unit/ |
H A D | alg_test.cpp | 335 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 D | event_sys_unittest.cc | 20 class Pair; 23 Pair* source; 37 class Pair { class in namespace:__anon2258 40 explicit Pair(const std::string& name) : name_(name), a_(0), b_(0) { function in class:__anon2258::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 D | LLLexer.cpp | 84 uint64_t Pair[2]) { 85 Pair[0] = 0; 88 Pair[0] *= 16; 89 Pair[0] += parseHexChar(*Buffer); 91 Pair[1] = 0; 93 Pair[1] *= 16; 94 Pair[1] += parseHexChar(*Buffer); 103 uint64_t Pair[2]) { 104 Pair[1] = 0; 107 Pair[ 83 HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]) argument 102 FP80HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]) argument 703 uint64_t Pair[2]; local [all...] |
/external/openfst/src/include/fst/ |
H A D | shortest-path.h | 212 typedef pair<StateId, Weight> Pair; typedef in class:fst::ShortestPathCompare 214 ShortestPathCompare(const vector<Pair>& pairs, 220 const Pair &px = pairs_[x]; 221 const Pair &py = pairs_[y]; 241 const vector<Pair> &pairs_; 285 typedef pair<StateId, Weight> Pair; 304 vector<Pair> pairs; 329 pairs.push_back(Pair(kNoStateId, Weight::Zero())); 330 pairs[final] = Pair(ifst.Start(), Weight::One()); 337 Pair [all...] |
H A D | sparse-tuple-weight.h | 62 typedef pair<K, W> Pair; typedef in class:fst::SparseTupleWeight 190 inline void Push(const Pair &p, bool default_value_check = true) { 218 Pair first_; 219 list<Pair> rest_; 228 typedef typename SparseTupleWeight<W, K>::Pair Pair; typedef in class:fst::SparseTupleWeightIterator 229 typedef typename list<Pair>::const_iterator const_iterator; 230 typedef typename list<Pair>::iterator iterator; 243 const Pair& Value() const { return init_ ? first_ : *iter_; } 258 const Pair [all...] |
/external/skia/src/core/ |
H A D | SkPixelRef.cpp | 160 struct Pair { struct 166 static Pair gPairs[MAX_PAIR_COUNT]; 199 const Pair* pairs = gPairs; 212 const Pair* pairs = gPairs;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | shortest-path.h | 171 typedef pair<StateId, Weight> Pair; typedef in class:fst::ShortestPathCompare 173 ShortestPathCompare(const vector<Pair>& pairs, 179 const Pair &px = pairs_[x]; 180 const Pair &py = pairs_[y]; 196 const vector<Pair> &pairs_; 233 typedef pair<StateId, Weight> Pair; typedef 273 vector<Pair> pairs; 289 pairs.push_back(Pair(kNoStateId, Weight::Zero())); 290 pairs[final] = Pair(rfst.Start(), Weight::One()); 296 Pair [all...] |
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | p5.cpp | 380 template<typename T1, typename T2> struct Pair {}; struct in namespace:WorkingPaperExample 384 typedef Tuple<Pair<Args1, Args2> ... > type; // expected-error{{pack expansion contains parameter packs 'Args1' and 'Args2' that have different lengths (1 vs. 2)}} 388 typedef zip<short, int>::with<unsigned short, unsigned>::type T1; // T1 is Tuple<Pair<short, unsigned short>, Pair<int, unsigned>> 389 typedef Tuple<Pair<short, unsigned short>, Pair<int, unsigned>> T1;
|
/external/llvm/include/llvm/Analysis/ |
H A D | MemoryDependenceAnalysis.h | 278 /// Pair - The pair of the block and the skip-first-block flag. 279 BBSkipFirstBlockPair Pair; member in struct:llvm::MemoryDependenceAnalysis::NonLocalPointerInfo
|
/external/llvm/lib/CodeGen/ |
H A D | ShadowStackGC.cpp | 335 std::pair<CallInst*, AllocaInst*> Pair = std::make_pair( local 338 Roots.push_back(Pair); 340 MetaRoots.push_back(Pair);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 682 std::pair<DenseMap<uintptr_t, PHINode *>::iterator, bool> Pair = local 684 if (Pair.second) continue; 686 for (PHINode *OtherPN = Pair.first->second; ; ) { 698 PHINode *Old = Pair.first->second; 699 Pair.first->second = PN;
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 189 BlockPair Pair = Queue.remove_min(); local 190 diff(Pair.first, Pair.second);
|