Searched refs:pair (Results 1 - 25 of 61) sorted by relevance

123

/haiku/headers/cpp/
H A Dstl_pair.h37 struct pair { struct
43 pair() : first(_T1()), second(_T2()) {} function in struct:pair
44 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} function in struct:pair
48 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} argument
53 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
59 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
66 inline pair<_T
[all...]
H A Dpair.h42 using __STD::pair;
H A Dtempbuf.h31 #include <pair.h>
H A Dstl_tempbuf.h38 pair<_Tp*, ptrdiff_t>
47 return pair<_Tp*, ptrdiff_t>(__tmp, __len);
51 return pair<_Tp*, ptrdiff_t>((_Tp*)0, 0);
57 inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len) {
69 inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len, _Tp*) {
H A Dalgobase.h30 #include <pair.h>
H A Dstl_uninitialized.h100 pair<_InputIter, _ForwardIter>
109 return pair<_InputIter, _ForwardIter>(__first, __cur);
115 inline pair<_RandomAccessIter, _ForwardIter>
120 return pair<_RandomAccessIter, _ForwardIter>(
126 inline pair<_InputIter, _ForwardIter>
134 inline pair<_InputIter, _ForwardIter>
H A Dstl_set.h132 pair<iterator,bool> insert(const value_type& __x) {
133 pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x);
134 return pair<iterator, bool>(__p.first, __p.second);
176 pair<iterator,iterator> equal_range(const key_type& __x) const {
H A Dstl_algobase.h309 pair<_InputIter, _OutputIter> __copy_n(_InputIter __first, _Size __count,
317 return pair<_InputIter, _OutputIter>(__first, __result);
321 inline pair<_RAIter, _OutputIter>
326 return pair<_RAIter, _OutputIter>(__last, copy(__first, __last, __result));
330 inline pair<_InputIter, _OutputIter>
337 inline pair<_InputIter, _OutputIter>
363 pair<_InputIter1, _InputIter2> mismatch(_InputIter1 __first1,
370 return pair<_InputIter1, _InputIter2>(__first1, __first2);
374 pair<_InputIter1, _InputIter2> mismatch(_InputIter1 __first1,
382 return pair<_InputIter
[all...]
H A Dstl_hash_map.h53 typedef hashtable<pair<const _Key,_Tp>,_Key,_HashFcn,
54 _Select1st<pair<const _Key,_Tp> >,_EqualKey,_Alloc> _Ht;
160 pair<iterator,bool> insert(const value_type& __obj)
173 pair<iterator,bool> insert_noresize(const value_type& __obj)
186 pair<iterator, iterator> equal_range(const key_type& __key)
188 pair<const_iterator, const_iterator>
235 typedef hashtable<pair<const _Key, _Tp>, _Key, _HashFcn,
236 _Select1st<pair<const _Key, _Tp> >, _EqualKey, _Alloc>
366 pair<iterator, iterator> equal_range(const key_type& __key)
368 pair<const_iterato
[all...]
H A Dstl_hash_set.h156 pair<iterator, bool> insert(const value_type& __obj)
158 pair<typename _Ht::iterator, bool> __p = _M_ht.insert_unique(__obj);
159 return pair<iterator,bool>(__p.first, __p.second);
172 pair<iterator, bool> insert_noresize(const value_type& __obj)
174 pair<typename _Ht::iterator, bool> __p =
176 return pair<iterator, bool>(__p.first, __p.second);
183 pair<iterator, iterator> equal_range(const key_type& __key) const
355 pair<iterator, iterator> equal_range(const key_type& __key) const
H A Dstl_map.h56 typedef pair<const _Key, _Tp> value_type;
161 pair<iterator,bool> insert(const value_type& __x)
199 pair<iterator,iterator> equal_range(const key_type& __x) {
202 pair<const_iterator,const_iterator> equal_range(const key_type& __x) const {
/haiku/src/tests/system/network/
H A Dfirefox_crash.cpp43 tcp_pair(int pair[]) argument
45 pair[0] = pair[1] = -1;
67 pair[0] = open_tcp_socket();
68 if (pair[0] < 0)
73 if (connect(pair[0], (sockaddr*)&address, sizeof(sockaddr_in)) != 0
83 FD_SET(pair[0], &set);
84 if (select(pair[0] + 1, NULL, &set, NULL, &tv) < 0)
89 if (getsockname(pair[0], (sockaddr*)&address, &length) != 0)
93 pair[
130 int pair[2]; local
[all...]
/haiku/src/bin/filteredquery/
H A DFilteredQuery.cpp75 filter_pair *pair = fFilters.ItemAt(i); local
76 if (pair->filter == function) {
96 filter_pair *pair = fFilters.ItemAt(i); local
97 filter_function filter = pair->filter;
98 accepted = (*filter)(&tmpRef, pair->args);
/haiku/src/kits/debugger/source_language/c_family/
H A DCLanguageFamilySyntaxHighlightInfo.cpp147 SyntaxPair* pair = new(std::nothrow) SyntaxPair(column, type); local
148 if (pair == NULL)
151 ObjectDeleter<SyntaxPair> pairDeleter(pair);
152 if (!fPairs.AddItem(pair))
215 SyntaxPair* pair = info->PairAt(count); local
216 if (pair == NULL)
219 _columns[count] = pair->column;
220 _types[count] = pair->type;
/haiku/src/add-ons/kernel/console/vga_text/
H A Dvga_text.c97 uint16 pair = ((uint16)attr << 8) | (uint16)glyph; local
99 *p = pair;
106 uint16 pair = ((uint16)attr << 8) | (uint16)glyph; local
112 while (p < p_limit) *p++ = pair;
/haiku/src/apps/cortex/Persistence/
H A DImportContext.h101 typedef std::pair<const char*, IPersistent*> object_entry;
/haiku/src/apps/cortex/RouteApp/
H A DNodeSetIOContext.h101 typedef std::pair<BString,media_node_id> node_entry;
/haiku/headers/build/private/storage/mime/
H A DMimeUpdateThread.h51 std::list< std::pair<dev_t, bool> > fAttributeSupportList;
/haiku/src/servers/registrar/mime/
H A DMimeUpdateThread.h52 std::list< std::pair<dev_t, bool> > fAttributeSupportList;
H A DMimeUpdateThread.cpp155 std::list< std::pair<dev_t,bool> >::iterator i;
173 std::pair<dev_t,bool> p(device, result);
/haiku/src/apps/cortex/support/
H A Dset_tools.h73 bool operator()(const std::pair<key,value>& p, const value& v) const {
82 // public unary_function<pair<key,value>, bool> {
88 // bool operator()(const std::pair<key,value>& p) const {
/haiku/src/apps/cortex/TipManager/
H A DTipManagerImpl.cpp142 pair<tip_entry_set::iterator, bool> ret;
257 pair<BView*, const tip_entry*> _ViewEntry::match(
284 return pair<BView*, const tip_entry*>(m_target, entry);
298 pair<BView*, const tip_entry*> ret = entry->match(
307 return pair<BView*, const tip_entry*>(0, 0);
452 pair<BView*, const tip_entry*> _WindowEntry::match(
467 return pair<BView*,const tip_entry*>(0,0);
469 pair<BView*,const tip_entry*> ret = (*it)->match(
476 return pair<BView*,const tip_entry*>(0,0);
909 pair<BVie
[all...]
/haiku/src/kits/support/
H A DArchivingManagers.cpp168 typedef std::pair<BMessage*, const BArchivable*> ArchivePair;
184 const ArchivePair& pair = pairs[i]; local
185 fError = pair.second->AllArchived(pair.first);
189 pair.first);
/haiku/src/apps/showimage/
H A DImageCache.h77 typedef std::pair<entry_ref, int32> ImageSelector;
/haiku/src/apps/devices/
H A DDevice.h43 typedef std::pair<BString, BString> AttributePair;

Completed in 123 milliseconds

123