/external/llvm/unittests/ADT/ |
H A D | PointerIntPairTest.cpp | 22 PointerIntPair<PointerIntPairTest *, 2> Pair(this, 1U); 23 EXPECT_EQ(this, Pair.getPointer()); 24 EXPECT_EQ(1U, Pair.getInt()); 26 Pair.setInt(2); 27 EXPECT_EQ(this, Pair.getPointer()); 28 EXPECT_EQ(2U, Pair.getInt()); 30 Pair.setPointer(nullptr); 31 EXPECT_EQ(nullptr, Pair.getPointer()); 32 EXPECT_EQ(2U, Pair.getInt()); 34 Pair 40 PointerIntPair<PointerIntPairTest *, 2> Pair; local [all...] |
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowPair.java | 7 import android.util.Pair; 12 * Shadow of {@code Pair} 15 @Implements(Pair.class) 17 @RealObject private Pair realPair; 24 public static <F, S> Pair<F, S> create(F f, S s) { 25 return new Pair<F, S>(f, s); 36 if (!(o instanceof Pair)) return false; 37 final Pair other = (Pair) o; 41 private static void setFields(Pair [all...] |
H A D | ShadowWifiManager.java | 7 import android.util.Pair; 29 private Pair<Integer, Boolean> lastEnabledNetwork; 99 lastEnabledNetwork = new Pair<Integer, Boolean>(netId, disableOthers); 141 public Pair<Integer, Boolean> getLastEnabledNetwork() {
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | Pair.java | 15 public class Pair<F, S> { class 19 protected Pair(F first, S second) { method in class:Pair 30 public static <F, S> Pair<F, S> of(F first, S second) { 32 throw new IllegalArgumentException("Pair.of requires non null values."); 34 return new Pair<F, S>(first, second); 42 if (!(other instanceof Pair)) { 45 Pair<?, ?> rhs = (Pair<?, ?>) other;
|
/external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
H A D | PairTest.java | 10 import android.util.Pair; 17 Pair<String, Integer> pair = new Pair<String, Integer>("a", 1); 24 Pair<String, String> p = Pair.create("Foo", "Bar"); 31 assertThat(Pair.create("1", 2), equalTo(Pair.create("1", 2))); 36 assertThat(Pair.create("1", 2).hashCode(), equalTo(Pair.create("1", 2).hashCode()));
|
/external/skia/src/core/ |
H A D | SkPtrRecorder.cpp | 12 Pair* p = fList.begin(); 13 Pair* stop = fList.end(); 21 bool SkPtrSet::Less(const Pair& a, const Pair& b) { 31 Pair pair; 34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 47 Pair pair; 50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 66 const Pair* p = fList.begin();
|
H A D | SkPtrRecorder.h | 87 struct Pair { struct in class:SkPtrSet 96 SkTDArray<Pair> fList; 98 static bool Less(const Pair& a, const Pair& b);
|
H A D | SkTHash.h | 207 Pair in = { key, val }; 208 Pair* out = fTable.set(in); 215 if (Pair* p = fTable.find(key)) { 230 fTable.foreach([&fn](Pair* p){ fn(p->key, &p->val); }); 236 fTable.foreach([&fn](const Pair& p){ fn(p.key, p.val); }); 240 struct Pair { struct in class:SkTHashMap 243 static const K& GetKey(const Pair& p) { return p.key; } 247 SkTHashTable<Pair, K> fTable;
|
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/ |
H A D | XYSeries.java | 19 import android.util.Pair; 25 public interface XYSeries extends Series<Pair<Number, Number>> {
|
H A D | LineAndPointRenderer.java | 20 import android.util.Pair;
87 ArrayList<Pair<PointF, Integer>> points = new ArrayList<Pair<PointF, Integer>>(series.size());
101 points.add(new Pair<PointF, Integer>(thisPoint, i));
139 for (Pair<PointF, Integer> p : points) {
|
H A D | SimpleXYSeries.java | 21 import android.util.Pair;
215 * @return Pair<Number, Number> with first equal to x-val and second equal to y-val.
217 public Pair<Number, Number> removeFirst() {
223 return new Pair<Number, Number>(xVals != null ? xVals.removeFirst() : 0, yVals.removeFirst());
243 * @return Pair<Number, Number> with first equal to x-val and second equal to y-val.
245 public Pair<Number, Number> removeLast() {
251 return new Pair<Number, Number>(xVals != null ? xVals.removeLast() : yVals.size() - 1, yVals.removeLast());
|
/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/skia/include/core/ |
H A D | SkTDict.h | 39 Pair* pair = fArray.insert(~index); 74 const Pair* end = fArray.end(); 75 for (const Pair* pair = fArray.begin(); pair < end; pair++) { 86 struct Pair { struct in class:SkTDict 90 friend int operator<(const Pair& a, const Pair& b) { 94 friend int operator!=(const Pair& a, const Pair& b) { 120 const Pair* fIter; 121 const Pair* fSto [all...] |
/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/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> { }; 189 // 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] 190 // 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/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/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 50 std::pair<typename MapTy::iterator, bool> Pair = local 52 if (Pair.second) { 54 Pair.first->second = Num; 58 return Vector[Pair.first->second].second; 62 std::pair<typename MapTy::iterator, bool> Pair = local 64 if (Pair.second) { 66 Pair.first->second = Num; 70 return std::make_pair(Vector.begin() + Pair.first->second, false);
|
/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/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/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
H A D | AbstractSampleEncryptionBox.java | 70 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...] |
/external/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 782 void DependenceAnalysis::unifySubscriptType(Subscript *Pair) { argument 783 const SCEV *Src = Pair->Src; 784 const SCEV *Dst = Pair->Dst; 795 Pair->Dst = SE->getSignExtendExpr(Dst, SrcTy); 798 Pair->Src = SE->getSignExtendExpr(Src, DstTy); 806 void DependenceAnalysis::removeMatchingExtensions(Subscript *Pair) { argument 807 const SCEV *Src = Pair->Src; 808 const SCEV *Dst = Pair->Dst; 816 Pair->Src = SrcCastOp; 817 Pair 3197 tryDelinearize(const SCEV *SrcSCEV, const SCEV *DstSCEV, SmallVectorImpl<Subscript> &Pair, const SCEV *ElementSize) argument [all...] |
/external/llvm/lib/IR/ |
H A D | LLVMContextImpl.cpp | 86 for (auto &Pair : ValuesAsMetadata) 87 Pair.second->dropUsers(); 88 for (auto &Pair : MetadataAsValues) 89 Pair.second->dropUse(); 149 for (auto &Pair : MetadataAsValues) 150 MDVs.push_back(Pair.second); 157 for (auto &Pair : ValuesAsMetadata) 158 delete Pair.second;
|
/external/llvm/lib/AsmParser/ |
H A D | LLLexer.cpp | 79 uint64_t Pair[2]) { 80 Pair[0] = 0; 84 Pair[0] *= 16; 85 Pair[0] += hexDigitValue(*Buffer); 88 Pair[1] = 0; 90 Pair[1] *= 16; 91 Pair[1] += hexDigitValue(*Buffer); 100 uint64_t Pair[2]) { 101 Pair[1] = 0; 104 Pair[ 78 HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]) argument 99 FP80HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]) argument 837 uint64_t Pair[2]; local [all...] |
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/editor/presentation/ |
H A D | ButtonPropertyEditorPresentationImpl.java | 23 import org.eclipse.wb.internal.core.utils.Pair; 210 private final Map<Pair<PropertyTable, Property>, Control> m_map = Maps.newHashMap(); 213 m_map.put(Pair.create(propertyTable, property), control); 217 return m_map.remove(Pair.create(propertyTable, property)); 221 return m_map.get(Pair.create(propertyTable, property));
|