| /prebuilts/clang/host/linux-x86/clang-4479392/prebuilt_include/llvm/lib/Fuzzer/ |
| FuzzerTracePC.h | 33 struct Pair {
43 Pair Get(size_t I) { return Table[I % kSize]; }
45 Pair Table[kSize];
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/ |
| ManifestContentAssist.java | 29 import com.android.utils.Pair;
60 List<Pair<String, String>> choices = new ArrayList<Pair<String, String>>();
74 choices.add(Pair.of(version.getCodename(), version.getCodename()));
76 choices.add(Pair.of(Integer.toString(apiLevel), target.getFullName()));
82 choices.add(Pair.of(Integer.toString(api), name));
|
| /tools/test/connectivity/acts/framework/acts/controllers/relay_lib/ |
| i6s_headset.py | 35 Pair = "Pair"
54 self.relays[Buttons.Pair.value].set_no_for(PAIRING_MODE_WAIT_TIME)
68 self.relays[Buttons.Pair.value].set_no_for(PAIRING_MODE_WAIT_TIME)
|
| /art/test/903-hello-tagging/src/art/ |
| Test903.java | 123 Pair[] tmp = new Pair[l];
125 tmp[i] = new Pair(objects == null ? null : objects[i], tags == null ? 0 : tags[i]);
133 private static class Pair implements Comparable<Pair> {
136 public Pair(Object o, long t) {
141 public int compareTo(Pair p) {
|
| /external/clang/test/Index/ |
| load-stmts.cpp | 73 struct Pair {
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/ |
| Annotation.java | 48 static class Pair {
181 Pair p = new Pair();
194 Pair p = new Pair();
203 private void addMemberValue(Pair pair) {
204 String name = pool.getUtf8Info(pair.name);
208 members.put(name, pair);
272 Pair p = (Pair)members.get(name)
315 Pair pair = (Pair)it.next(); local
[all...] |
| /external/junit-params/src/test/java/junitparams/internal/ |
| TestMethodTest.java | 99 public void testVarargsCustomClass(Pair... pairs){
107 new Object[]{new Pair(0, 0), new Pair(1, 1), new Pair(2, 3)}
113 public void testVarargsMoreArgs(int sumOfX, int sumOfY, Pair... pairs){
116 for (Pair pair : pairs) {
117 sumOfXFromPairs += pair.x;
118 sumOfYFromPairs += pair.y;
125 return new Object[]{new Object[]{40, 50, new Pair(17, 21), new Pair(12, 18), new Pair(11, 11)}, new Object[]{10, 20, new Pair(3
[all...] |
| /external/llvm/include/llvm/ADT/ |
| MapVector.h | 31 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
60 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
61 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
62 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
63 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
76 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
77 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
91 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /external/skia/include/private/ |
| SkTHash.h | 240 Pair* out = fTable.set({std::move(key), std::move(val)});
247 if (Pair* p = fTable.find(key)) {
259 // Call fn on every key/value pair in the table. You may mutate the value but not the key.
262 fTable.foreach([&fn](Pair* p){ fn(p->key, &p->val); });
265 // Call fn on every key/value pair in the table. You may not mutate anything.
268 fTable.foreach([&fn](const Pair& p){ fn(p.key, p.val); });
272 struct Pair {
275 static const K& GetKey(const Pair& p) { return p.key; }
279 SkTHashTable<Pair, K> fTable;
|
| /external/skqp/include/private/ |
| SkTHash.h | 240 Pair* out = fTable.set({std::move(key), std::move(val)});
247 if (Pair* p = fTable.find(key)) {
259 // Call fn on every key/value pair in the table. You may mutate the value but not the key.
262 fTable.foreach([&fn](Pair* p){ fn(p->key, &p->val); });
265 // Call fn on every key/value pair in the table. You may not mutate anything.
268 fTable.foreach([&fn](const Pair& p){ fn(p.key, p.val); });
272 struct Pair {
275 static const K& GetKey(const Pair& p) { return p.key; }
279 SkTHashTable<Pair, K> fTable;
|
| /frameworks/base/packages/SettingsLib/tests/robotests/src/com/android/settingslib/core/instrumentation/ |
| MetricsFeatureProviderTest.java | 28 import android.util.Pair;
60 private ArgumentCaptor<Pair> mPairCaptor;
92 eq(Pair.create(MetricsEvent.FIELD_CONTEXT, MetricsEvent.SETTINGS_GESTURES)));
105 eq(Pair.create(MetricsEvent.FIELD_CONTEXT, MetricsEvent.SETTINGS_GESTURES)));
113 Pair value = mPairCaptor.getValue();
124 Pair value = mPairCaptor.getValue();
|
| /frameworks/rs/ |
| rsMap.h | 10 class Pair {
12 Pair() {}
13 Pair(T1 f1, T2 f2) : first(f1), second(f2) {}
20 Pair<T1, T2> make_pair(T1 first, T2 second) {
21 return Pair<T1, T2>(first, second);
31 typedef Pair<KeyType, ValueType> MapEntry;
|
| /packages/services/Car/service/src/com/android/car/systeminterface/ |
| SystemStateInterface.java | 38 import android.util.Pair;
77 private List<Pair<Runnable, Duration>> mActionsList = new ArrayList<>();
83 for (Pair<Runnable, Duration> action : mActionsList) {
129 mActionsList.add(Pair.create(action, delay));
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| MapVector.h | 31 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(); }
83 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
84 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
101 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| MapVector.h | 31 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(); }
83 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
84 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
101 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| MapVector.h | 37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
73 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
74 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
75 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
89 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/prebuilt_include/llvm/lib/Fuzzer/ |
| FuzzerTracePC.h | 33 struct Pair {
43 Pair Get(size_t I) { return Table[I % kSize]; }
45 Pair Table[kSize];
|
