HomeSort by relevance Sort by last modified time
    Searched refs:pair (Results 201 - 225 of 8413) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/skia/src/core/
SkMetaData.cpp 50 PtrPair* pair = (PtrPair*)rec->data(); local
51 if (pair->fProc && pair->fPtr) {
52 pair->fPtr = pair->fProc(pair->fPtr, false);
99 PtrPair pair = { ptr, proc }; local
100 (void)this->set(name, &pair, sizeof(PtrPair), kPtr_Type, 1);
135 PtrPair* pair = (PtrPair*)rec->data(); local
136 if (pair->fProc && pair->fPtr)
190 const PtrPair* pair = (const PtrPair*)rec->data(); local
259 PtrPair* pair = (PtrPair*)rec->data(); local
    [all...]
  /external/skqp/src/core/
SkMetaData.cpp 50 PtrPair* pair = (PtrPair*)rec->data(); local
51 if (pair->fProc && pair->fPtr) {
52 pair->fPtr = pair->fProc(pair->fPtr, false);
99 PtrPair pair = { ptr, proc }; local
100 (void)this->set(name, &pair, sizeof(PtrPair), kPtr_Type, 1);
135 PtrPair* pair = (PtrPair*)rec->data(); local
136 if (pair->fProc && pair->fPtr)
190 const PtrPair* pair = (const PtrPair*)rec->data(); local
259 PtrPair* pair = (PtrPair*)rec->data(); local
    [all...]
  /hardware/interfaces/wifi/1.2/default/
wifi_chip.h 151 std::pair<WifiStatus, ChipId> getIdInternal();
154 std::pair<WifiStatus, uint32_t> getCapabilitiesInternal();
155 std::pair<WifiStatus, std::vector<ChipMode>> getAvailableModesInternal();
158 std::pair<WifiStatus, uint32_t> getModeInternal();
159 std::pair<WifiStatus, IWifiChip::ChipDebugInfo>
161 std::pair<WifiStatus, std::vector<uint8_t>>
163 std::pair<WifiStatus, std::vector<uint8_t>>
165 std::pair<WifiStatus, sp<IWifiApIface>> createApIfaceInternal();
166 std::pair<WifiStatus, std::vector<hidl_string>> getApIfaceNamesInternal();
167 std::pair<WifiStatus, sp<IWifiApIface>> getApIfaceInternal
    [all...]
  /art/tools/ahat/src/main/com/android/ahat/heapdump/
Diff.java 201 InstanceListPair pair = byKey.get(key); local
202 if (pair == null) {
203 pair = new InstanceListPair();
204 byKey.put(key, pair);
206 pair.a.add(inst);
210 InstanceListPair pair = byKey.get(key); local
211 if (pair == null) {
212 pair = new InstanceListPair();
213 byKey.put(key, pair);
215 pair.b.add(inst)
    [all...]
  /art/libartbase/base/
tracking_safe_map.h 27 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>> {
  /art/runtime/
dex_reference_collection.h 36 using MapAllocator = Allocator<std::pair<const DexFile*, IndexVector>>;
41 Allocator<std::pair<const DexFile* const, IndexVector>>>;
58 for (auto&& pair : map_) {
59 ret += pair.second.size();
type_lookup_table_test.cc 28 using DescriptorClassDefIdxPair = std::pair<const char*, uint32_t>;
45 auto pair = GetParam(); local
46 const char* descriptor = pair.first;
49 ASSERT_EQ(pair.second, class_def_idx);
  /external/deqp/modules/egl/
teglChooseConfigReference.hpp 39 void chooseConfigReference (const eglw::Library& egl, eglw::EGLDisplay display, std::vector<eglw::EGLConfig>& dst, const std::vector<std::pair<eglw::EGLenum, eglw::EGLint> >& attributes);
  /external/guava/guava-gwt/test-super/com/google/common/collect/testing/google/super/com/google/common/collect/testing/google/
BiMapInverseTester.java 45 BiMapPair<K, V> pair = new BiMapPair<K, V>(getMap()); local
46 BiMapPair<K, V> copy = SerializableTester.reserialize(pair);
47 assertEquals(pair.forward, copy.forward);
48 assertEquals(pair.backward, copy.backward);
  /external/libcxx/test/std/containers/unord/unord.map/
bucket_count.pass.cpp 13 // class Alloc = allocator<pair<const Key, T>>>
34 typedef std::pair<int, std::string> P;
52 min_allocator<std::pair<const int, std::string>>> C;
58 min_allocator<std::pair<const int, std::string>>> C;
59 typedef std::pair<int, std::string> P;
load_factor.pass.cpp 13 // class Alloc = allocator<pair<const Key, T>>>
31 typedef std::pair<int, std::string> P;
54 min_allocator<std::pair<const int, std::string>>> C;
55 typedef std::pair<int, std::string> P;
72 min_allocator<std::pair<const int, std::string>>> C;
  /external/libcxx/test/std/containers/unord/unord.multimap/
load_factor.pass.cpp 13 // class Alloc = allocator<pair<const Key, T>>>
30 typedef std::pair<int, std::string> P;
53 min_allocator<std::pair<const int, std::string>>> C;
54 typedef std::pair<int, std::string> P;
71 min_allocator<std::pair<const int, std::string>>> C;
  /external/libcxx/test/std/utilities/memory/temporary.buffer/
overaligned.pass.cpp 15 // pair<T*, ptrdiff_t>
31 std::pair<A*, std::ptrdiff_t> ip = std::get_temporary_buffer<A>(5);
  /external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.assign/
const_pair.pass.cpp 15 // tuple& operator=(const pair<U1, U2>& u);
26 typedef std::pair<long, char> T0;
  /external/libcxx/test/std/utilities/utility/pairs/pair.astuple/
get_rv.pass.cpp 14 // template <class T1, class T2> struct pair
17 // typename tuple_element<I, std::pair<T1, T2> >::type&&
18 // get(pair<T1, T2>&&);
27 typedef std::pair<std::unique_ptr<int>, short> P;
tuple_element.pass.cpp 12 // template <class T1, class T2> struct pair
14 // tuple_element<I, pair<T1, T2> >::type
24 typedef std::pair<T1, T2> P;
31 typedef std::pair<T1, T2> const P;
38 typedef std::pair<T1, T2> volatile P;
45 typedef std::pair<T1, T2> const volatile P;
  /external/libcxx/test/std/utilities/utility/pairs/pairs.spec/
non_member_swap.pass.cpp 12 // template <class T1, class T2> struct pair
14 // template <class T1, class T2> void swap(pair<T1, T2>& x, pair<T1, T2>& y);
22 typedef std::pair<int, short> P1;
  /external/libevent/test/
test-weof.c 55 evutil_socket_t pair[2]; variable
73 evutil_closesocket(pair[0]);
99 if (evutil_socketpair(AF_UNIX, SOCK_STREAM, 0, pair) == -1)
106 event_set(&ev, pair[1], EV_WRITE, write_cb, &ev);
  /external/perf_data_converter/src/quipper/
dso_test_utils.h 20 const std::vector<std::pair<string, string>> section_buildids);
  /frameworks/base/tools/aapt2/filter/
ConfigFilter.h 54 std::set<std::pair<ConfigDescription, uint32_t>> configs_;
  /frameworks/base/tools/incident_report/
generic_message.cpp 33 mNodes.insert(pair<int32_t,Node>(fieldId, node));
42 mNodes.insert(pair<int32_t,Node>(fieldId, node));
52 mNodes.insert(pair<int32_t,Node>(fieldId, node));
62 mNodes.insert(pair<int32_t,Node>(fieldId, node));
  /packages/apps/Email/tests/src/com/android/email/mail/transport/
MockTransport.java 127 Transaction pair = new Transaction(pattern, responses); local
128 mPairs.add(pair);
156 private void sendResponse(Transaction pair) {
157 switch (pair.mAction) {
159 for (String s : pair.mResponses) {
167 Assert.fail("Invalid action for sendResponse: " + pair.mAction);
260 Transaction pair = mPairs.get(0); local
261 if (pair.mPattern == null) {
263 sendResponse(pair);
318 Transaction pair = mPairs.remove(0) local
    [all...]
  /packages/services/Car/tests/vehiclehal_test/src/com/android/car/vehiclehal/test/
VhalEventVerifier.java 88 for (MismatchedEventPair pair : mMismatchedEvents) {
89 resultBuilder.append("Index " + pair.idx + ": Expected "
90 + Utils.vehiclePropValueToString(pair.expectedEvent) + ", Received "
91 + Utils.vehiclePropValueToString(pair.mismatchedEvent) + "\n");
  /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-4053586/prebuilt_include/llvm/include/llvm/Object/
SymbolSize.h 28 std::vector<std::pair<SymbolRef, uint64_t>>

Completed in 438 milliseconds

1 2 3 4 5 6 7 891011>>