/external/chromium_org/third_party/cython/src/Cython/Includes/libcpp/ |
H A D | deque.pxd | 1 from pair cimport pair namespace
|
H A D | map.pxd | 1 from utility cimport pair namespace 6 pair[T, U]& operator*() nogil 12 pair[T, U]& operator*() nogil 40 pair[iterator, iterator] equal_range(T&) nogil 41 #pair[const_iterator, const_iterator] equal_range(key_type&) 47 pair[iterator, bint] insert(pair[T, U]) nogil # XXX pair[T,U]& 48 iterator insert(iterator, pair[T, U]) nogil # XXX pair[ [all...] |
H A D | pair.pxd | 1 from utility cimport pair namespace
|
H A D | set.pxd | 1 from pair cimport pair namespace 38 pair[iterator, iterator] equal_range(T&) nogil 39 #pair[const_iterator, const_iterator] equal_range(T&) 45 pair[iterator, bint] insert(T&) nogil
|
H A D | unordered_map.pxd | 1 from utility cimport pair namespace 6 pair[T, U]& operator*() nogil 12 pair[T, U]& operator*() nogil 40 pair[iterator, iterator] equal_range(T&) nogil 41 #pair[const_iterator, const_iterator] equal_range(key_type&) 47 pair[iterator, bint] insert(pair[T, U]) nogil # XXX pair[T,U]& 48 iterator insert(iterator, pair[T, U]) nogil # XXX pair[ [all...] |
H A D | unordered_set.pxd | 1 from pair cimport pair namespace 38 pair[iterator, iterator] equal_range(T&) nogil 39 #pair[const_iterator, const_iterator] equal_range(T&) 45 pair[iterator, bint] insert(T&) nogil
|
/external/valgrind/main/none/tests/ |
H A D | allexec_prepare_prereq | 11 pair() function 31 pair x86 amd64 32 pair ppc32 ppc64 33 pair s390x_unexisting_in_32bits s390x 34 pair arm arm64 35 pair mips32 mips64
|
/external/clang/test/CodeGen/ |
H A D | tbaa-thread-sanitizer.cpp | 7 struct pair { struct 9 pair(const iterator &a) : first(a) {} function in struct:pair 13 (void)pair(iterator());
|
H A D | atomic-arm64.c | 60 void test3(pointer_pair_t pair) { argument 61 __c11_atomic_store(&a_pointer_pair, pair, memory_order_seq_cst);
|
/external/libcxx/test/utilities/meta/meta.unary/meta.unary.prop/ |
H A D | is_standard_layout.pass.cpp | 35 struct pair struct 45 test_is_standard_layout<pair<int, double> > ();
|
/external/lzma/CPP/7zip/UI/Common/ |
H A D | UpdateProduce.cpp | 19 const CUpdatePair &pair = updatePairs[i];
local 23 up2.DirIndex = pair.DirIndex;
24 up2.ArcIndex = pair.ArcIndex;
27 switch(actionSet.StateActions[pair.State])
31 if (pair.State != NPairState::kOnlyOnDisk)
32 IgnoreArchiveItem(m_ArchiveItems[pair.ArcIndex]);
36 callback->ShowDeleteFile(pair.ArcIndex);
40 if (pair.State == NPairState::kOnlyOnDisk)
46 if (pair.State == NPairState::kOnlyInArchive ||
47 pair [all...] |
/external/chromium_org/third_party/libevent/test/ |
H A D | test-eof.c | 65 int pair[2]; local 67 if (evutil_socketpair(AF_UNIX, SOCK_STREAM, 0, pair) == -1) 71 send(pair[0], test, strlen(test)+1, 0); 72 shutdown(pair[0], SHUT_WR); 78 event_set(&ev, pair[1], EV_READ, read_cb, &ev);
|
H A D | test-weof.c | 34 int pair[2]; variable 52 EVUTIL_CLOSESOCKET(pair[0]); 69 if (evutil_socketpair(AF_UNIX, SOCK_STREAM, 0, pair) == -1) 76 event_set(&ev, pair[1], EV_WRITE, write_cb, &ev);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkPtrRecorder.cpp | 31 Pair pair; local 32 pair.fPtr = ptr; 34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 47 Pair pair; local 48 pair.fPtr = ptr; 50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 54 pair.fIndex = count + 1; 55 *fList.insert(index) = pair; [all...] |
/external/chromium_org/tools/gn/ |
H A D | deps_iterator.h | 42 const LabelTargetPair& pair() const { function in class:DepsIterator 48 const Target* target() const { return pair().ptr; } 51 const Label& label() const { return pair().label; }
|
/external/clang/test/PCH/ |
H A D | crash-12631281.cpp | 15 template <class _T1, class _T2> struct pair { struct 19 pair(_U1&& , _U2&& ); // expected-note {{candidate}} 23 pair<_ForwardIterator, _ForwardIterator> __equal_range(_ForwardIterator) { 24 return pair<_ForwardIterator, _ForwardIterator>(0, 0); // expected-error {{no matching constructor}} 28 pair<_ForwardIterator, _ForwardIterator> equal_range( _ForwardIterator a) { 33 pair<int, int> range() {
|
/external/clang/test/Parser/ |
H A D | cxx0x-for-range.cpp | 4 struct pair {}; struct 8 typedef pair<T,U> *iterator; 14 pair<T,U> &tie(T &, U &); 20 for (pair<char*,int> x : m) {
|
/external/lldb/include/lldb/Target/ |
H A D | PathMappingList.h | 152 typedef std::pair <ConstString, ConstString> pair; typedef in class:lldb_private::PathMappingList 153 typedef std::vector <pair> collection;
|
/external/llvm/unittests/ADT/ |
H A D | PointerIntPairTest.cpp | 63 PointerIntPair<Fixnum31, 1, bool, FixnumPointerTraits> pair; local 64 EXPECT_EQ((uintptr_t)0, pair.getPointer().Value); 65 EXPECT_FALSE(pair.getInt()); 67 pair.setPointerAndInt({ 0x7FFFFFFF }, true ); 68 EXPECT_EQ((uintptr_t)0x7FFFFFFF, pair.getPointer().Value); 69 EXPECT_TRUE(pair.getInt()); 72 PointerLikeTypeTraits<decltype(pair)>::NumLowBitsAvailable);
|
/external/skia/src/core/ |
H A D | SkPtrRecorder.cpp | 31 Pair pair; local 32 pair.fPtr = ptr; 34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 47 Pair pair; local 48 pair.fPtr = ptr; 50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 54 pair.fIndex = count + 1; 55 *fList.insert(index) = pair; [all...] |
/external/smack/src/org/jivesoftware/smack/util/collections/ |
H A D | DefaultMapEntry.java | 48 * @param pair the pair to copy, must not be null 51 public DefaultMapEntry(final KeyValue<K, V> pair) { argument 52 super(pair.getKey(), pair.getValue());
|
/external/chromium_org/components/devtools_bridge/test/android/javatests/src/org/chromium/components/devtools_bridge/ |
H A D | DataPipe.java | 10 * Represents a pair of connected AbstractDataChannel's. Sends to one channel 57 public void setPair(final PairedDataChannel pair) { argument 61 mPair = pair;
|
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/ |
H A D | hash.h | 203 struct hash<pair<First, Second> > { 204 inline size_t operator()(const pair<First, Second>& key) const { argument 215 inline size_t operator()(const pair<First, Second>& a, argument 216 const pair<First, Second>& b) const {
|
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkPorterDuff.cpp | 62 const Pair& pair = gPairs[mode]; local 63 SkASSERT(pair.fPD == mode); 64 return pair.fXF; 68 const Pair& pair = gPairs[mode]; local 69 SkASSERT(pair.fPD == mode); 70 return SkXfermode::Create(pair.fXF);
|
/external/protobuf/src/google/protobuf/stubs/ |
H A D | hash.h | 191 struct hash<pair<First, Second> > { 192 inline size_t operator()(const pair<First, Second>& key) const { argument 203 inline size_t operator()(const pair<First, Second>& a, argument 204 const pair<First, Second>& b) const {
|