| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/utility/pairs/pairs.pair/ |
| assign_pair_cxx03.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // pair& operator=(pair const& p);
35 // Since we don't have access control SFINAE having pair evaluate SFINAE
37 typedef std::pair<int, NonAssignable> P;
41 typedef std::pair<int, Incomplete&> P;
|
| assign_rv_pair_U_V.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // template<class U, class V> pair& operator=(pair<U, V>&& p);
35 typedef std::pair<std::unique_ptr<Derived>, short> P1;
36 typedef std::pair<std::unique_ptr<Base>, long> P2;
|
| const_first_const_second_cxx03.pass.cpp | 12 // template <class T1, class T2> struct pair
14 // pair(const T1& x, const T2& y);
31 typedef std::pair<float, short*> P;
37 typedef std::pair<A, int> P;
|
| copy_ctor.pass.cpp | 12 // template <class T1, class T2> struct pair
14 // pair(const pair&) = default;
24 typedef std::pair<int, short> P1;
32 typedef std::pair<int, short> P1;
|
| /external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.helper/ |
| tuple.include.utility.pass.cpp | 44 test<std::pair<int, int>, 2, int, 0>();
45 test<std::pair<int, int>, 2, int, 1>();
46 test<std::pair<const int, int>, 2, int, 1>();
47 test<std::pair<int, volatile int>, 2, volatile int, 1>();
48 test<std::pair<char *, int>, 2, char *, 0>();
49 test<std::pair<char *, int>, 2, int, 1>();
|
| /frameworks/native/cmds/lshal/ |
| DebugCommand.cpp | 60 auto pair = splitFirst(mInterfaceName, '/'); local
62 FQName fqName(pair.first);
64 mLshal.err() << "Invalid fully-qualified name '" << pair.first << "'\n\n";
69 pair.first, pair.second.empty() ? "default" : pair.second, mOptions,
|
| /frameworks/support/collection/ktx/src/main/java/androidx/collection/ |
| ArrayMap.kt | 31 fun <K, V> arrayMapOf(vararg pairs: Pair<K, V>): ArrayMap<K, V> {
33 for (pair in pairs) {
34 map[pair.first] = pair.second
|
| /frameworks/support/core/ktx/src/main/java/androidx/core/util/ |
| ArrayMap.kt | 23 import kotlin.Pair
37 fun <K, V> arrayMapOf(vararg pairs: Pair<K, V>): ArrayMap<K, V> {
39 for (pair in pairs) {
40 map[pair.first] = pair.second
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/tuple/tuple.tuple/tuple.helper/ |
| tuple.include.utility.pass.cpp | 44 test<std::pair<int, int>, 2, int, 0>();
45 test<std::pair<int, int>, 2, int, 1>();
46 test<std::pair<const int, int>, 2, int, 1>();
47 test<std::pair<int, volatile int>, 2, volatile int, 1>();
48 test<std::pair<char *, int>, 2, char *, 0>();
49 test<std::pair<char *, int>, 2, int, 1>();
|
| /prebuilts/misc/common/swig/include/2.0.11/guile/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
24 template<class T, class U> struct pair {
25 %typemap(in) pair<T,U> %{
40 %typemap(in) const pair<T,U>& (std::pair<T,U> *temp = 0),
41 const pair<T,U>* (std::pair<T,U> *temp = 0) %{
50 temp = new std::pair< T, U >(*x,*y);
57 %typemap(freearg) const pair<T,U>&, const pair<T,U>* %{ delete temp$argnum; %
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/mzscheme/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
12 // std::pair
25 template<class T, class U> struct pair {
26 %typemap(in) pair<T,U> (std::pair<T,U>* m) {
41 %typemap(in) const pair<T,U>& (std::pair<T,U> temp,
42 std::pair<T,U>* m),
43 const pair<T,U>* (std::pair<T,U> temp
[all...] |
| /frameworks/base/core/jni/android/graphics/ |
| PathMeasure.cpp | 24 /* We declare an explicit pair, so that we don't have to rely on the java
59 PathMeasurePair* pair; local
61 pair = new PathMeasurePair(*path, forceClosed);
63 pair = new PathMeasurePair;
64 return reinterpret_cast<jlong>(pair);
69 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
74 pair->fPath.reset();
76 pair->fPath = *path;
78 pair->fMeasure.setPath(&pair->fPath, forceClosed)
82 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
94 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
114 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
122 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
129 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
135 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
141 PathMeasurePair* pair = reinterpret_cast<PathMeasurePair*>(pairHandle); local
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/python/ |
| std_pair.i | 12 struct traits_asval<std::pair<T,U> > {
13 typedef std::pair<T,U> value_type;
16 std::pair<T,U> *val)
37 static int asval(PyObject *obj, std::pair<T,U> *val) {
60 struct traits_asptr<std::pair<T,U> > {
61 typedef std::pair<T,U> value_type;
64 std::pair<T,U> **val)
67 value_type *vp = %new_instance(std::pair<T,U>);
87 static int asptr(PyObject *obj, std::pair<T,U> **val) {
110 struct traits_from<std::pair<T,U> >
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_multimap.i | 12 std::pair<iterator,iterator> equal_range(const key_type& x);
13 std::pair<const_iterator,const_iterator> equal_range(const key_type& x) const;
45 class _Alloc = allocator<std::pair<const _Key, _Tp > > >
52 typedef std::pair<const _Key, _Tp> value_type;
63 %fragment(SWIG_Traits_frag(std::pair< _Key, _Tp >), "header",
68 template <> struct traits<std::pair< _Key, _Tp > > {
71 return "std::pair<" #_Key "," #_Tp " >";
78 fragment=SWIG_Traits_frag(std::pair<_Key, _Tp >),
|
| /frameworks/base/tools/aapt/tests/ |
| FileFinder_test.cpp | 17 using std::pair;
33 Vector< pair<String8,time_t> > data;
34 data.push( pair<String8,time_t>(String8("hello.png"),3) );
35 data.push( pair<String8,time_t>(String8("world.PNG"),3) );
36 data.push( pair<String8,time_t>(String8("foo.pNg"),3) );
38 data.push( pair<String8,time_t>(String8("hello.jpg"),3) );
39 data.push( pair<String8,time_t>(String8(".hidden.png"),3));
|
| /external/libmicrohttpd/src/microspdy/ |
| structures.c | 44 struct SPDY_NameValue *pair; local
46 if(NULL == (pair = malloc(sizeof(struct SPDY_NameValue))))
49 memset (pair, 0, sizeof (struct SPDY_NameValue));
51 return pair;
62 struct SPDY_NameValue *pair; local
102 pair = container;
103 while(NULL != pair)
105 if(0 == strcmp(pair->name, name))
107 //the value will be added to this pair
110 pair = pair->next
[all...] |
| /external/fio/ |
| json.c | 21 struct json_pair *pair = malloc(sizeof(struct json_pair)); local
22 if (pair) {
23 pair->name = strdup(name);
24 pair->value = value;
27 value->parent_pair = pair;
29 return pair;
122 static void json_free_pair(struct json_pair *pair);
145 static void json_free_pair(struct json_pair *pair)
147 json_free_value(pair->value);
148 free(pair->name)
201 struct json_pair *pair; local
[all...] |
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/net/http2/hpack/ |
| hpack_test.go | 29 if got, want := at(2), (pair(":method", "GET")); got != want {
32 d.dynTab.add(pair("foo", "bar"))
33 d.dynTab.add(pair("blake", "miz"))
34 if got, want := at(staticTable.len()+1), (pair("blake", "miz")); got != want {
37 if got, want := at(staticTable.len()+2), (pair("foo", "bar")); got != want {
40 if got, want := at(3), (pair(":method", "POST")); got != want {
51 add(pair("blake", "eats pizza"))
55 add(pair("foo", "bar"))
63 if got, want := d.mustAt(staticTable.len()+1), (pair("foo", "bar")); got != want {
66 add(pair("long", strings.Repeat("x", 500))
651 func pair(name, value string) HeaderField { func
[all...] |
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/net/http2/hpack/ |
| hpack_test.go | 29 if got, want := at(2), (pair(":method", "GET")); got != want {
32 d.dynTab.add(pair("foo", "bar"))
33 d.dynTab.add(pair("blake", "miz"))
34 if got, want := at(staticTable.len()+1), (pair("blake", "miz")); got != want {
37 if got, want := at(staticTable.len()+2), (pair("foo", "bar")); got != want {
40 if got, want := at(3), (pair(":method", "POST")); got != want {
51 add(pair("blake", "eats pizza"))
55 add(pair("foo", "bar"))
63 if got, want := d.mustAt(staticTable.len()+1), (pair("foo", "bar")); got != want {
66 add(pair("long", strings.Repeat("x", 500))
651 func pair(name, value string) HeaderField { func
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| transpose_folding.cc | 73 std::pair<HloInstruction*, TransposeFolding::OperandIndices>;
79 bool FoldTransposeIntoDot(InstructionOperandsPair pair) {
80 auto* dot = pair.first;
82 for (const int64 operand_index : pair.second) {
100 bool FoldTransposeIntoConvolution(InstructionOperandsPair pair) {
101 auto& convolution = *pair.first;
102 auto& operand_indices = pair.second;
179 std::vector<std::pair<HloInstruction*, OperandIndices>> foldable_dots;
180 std::vector<std::pair<HloInstruction*, OperandIndices>> foldable_convolutions;
206 for (InstructionOperandsPair& pair : foldable_dots)
[all...] |
| /external/wpa_supplicant_8/wpa_supplicant/hidl/1.0/ |
| p2p_network.h | 65 std::pair<SupplicantStatus, uint32_t> getIdInternal();
66 std::pair<SupplicantStatus, std::string> getInterfaceNameInternal();
67 std::pair<SupplicantStatus, IfaceType> getTypeInternal();
70 std::pair<SupplicantStatus, std::vector<uint8_t>> getSsidInternal();
71 std::pair<SupplicantStatus, std::array<uint8_t, 6>> getBssidInternal();
72 std::pair<SupplicantStatus, bool> isCurrentInternal();
73 std::pair<SupplicantStatus, bool> isPersistentInternal();
74 std::pair<SupplicantStatus, bool> isGoInternal();
77 std::pair<SupplicantStatus, std::vector<hidl_array<uint8_t, 6>>>
|
| /external/wpa_supplicant_8/wpa_supplicant/hidl/1.1/ |
| p2p_network.h | 66 std::pair<SupplicantStatus, uint32_t> getIdInternal();
67 std::pair<SupplicantStatus, std::string> getInterfaceNameInternal();
68 std::pair<SupplicantStatus, IfaceType> getTypeInternal();
71 std::pair<SupplicantStatus, std::vector<uint8_t>> getSsidInternal();
72 std::pair<SupplicantStatus, std::array<uint8_t, 6>> getBssidInternal();
73 std::pair<SupplicantStatus, bool> isCurrentInternal();
74 std::pair<SupplicantStatus, bool> isPersistentInternal();
75 std::pair<SupplicantStatus, bool> isGoInternal();
78 std::pair<SupplicantStatus, std::vector<hidl_array<uint8_t, 6>>>
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/mismatch/ |
| mismatch_pred.pass.cpp | 15 // pair<Iter1, Iter2>
42 == (std::pair<II, II>(II(ia+3), II(ib+3))));
44 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
48 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
54 == (std::pair<II, II>(II(ia+3), II(ib+3))));
56 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
59 == (std::pair<II, II>(II(ia+3), II(ib+3))));
64 (std::pair<int*,int*>(ia+3,ib+3)));
68 (std::pair<int*,int*>(ia+3,ib+3)));
70 (std::pair<int*,int*>(ia+2,ib+2)))
[all...] |
| /external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
| not_constexpr_cxx11.fail.cpp | 34 using P = std::pair<int, int>;
42 using P = std::pair<ExplicitT, ExplicitT>;
43 constexpr std::pair<int, int> other;
50 using P = std::pair<ImplicitT, ImplicitT>;
51 constexpr std::pair<int, int> other;
|
| /external/libevent/test/ |
| test-closed.c | 78 evutil_socket_t pair[2]; local
92 /* Create a pair of sockets */
93 if (evutil_socketpair(AF_UNIX, SOCK_STREAM, 0, pair) == -1)
97 if (send(pair[0], test, (int)strlen(test)+1, 0) < 0)
99 shutdown(pair[0], EVUTIL_SHUT_WR);
102 ev = event_new(base, pair[1], EV_CLOSED | EV_TIMEOUT, closed_cb, event_self_cbarg());
|
