Searched refs:pair (Results 1 - 25 of 60) sorted by path

123

/haiku/headers/cpp/
H A Dalgobase.h30 #include <pair.h>
H A Dpair.h42 using __STD::pair;
H A Dstl_algo.h1847 pair<_ForwardIter, _ForwardIter>
1871 return pair<_ForwardIter, _ForwardIter>(__left, __right);
1874 return pair<_ForwardIter, _ForwardIter>(__first, __first);
1878 inline pair<_ForwardIter, _ForwardIter>
1885 pair<_ForwardIter, _ForwardIter>
1909 return pair<_ForwardIter, _ForwardIter>(__left, __right);
1912 return pair<_ForwardIter, _ForwardIter>(__first, __first);
1916 inline pair<_ForwardIter, _ForwardIter>
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_hashtable.h354 pair<iterator, bool> insert_unique(const value_type& __obj)
366 pair<iterator, bool> insert_unique_noresize(const value_type& __obj);
491 pair<iterator, iterator>
494 pair<const_iterator, const_iterator>
698 pair<typename hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>::iterator, bool>
707 return pair<iterator, bool>(iterator(__cur, this), false);
713 return pair<iterator, bool>(iterator(__tmp, this), true);
761 pair<typename hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>::iterator,
765 typedef pair<iterator, iterator> _Pii;
783 pair<typenam
[all...]
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 {
H A Dstl_multimap.h56 typedef pair<const _Key, _Tp> value_type;
187 pair<iterator,iterator> equal_range(const key_type& __x) {
190 pair<const_iterator,const_iterator> equal_range(const key_type& __x) const {
H A Dstl_multiset.h182 pair<iterator,iterator> equal_range(const key_type& __x) const {
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 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_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 Dstl_tree.h710 pair<iterator,bool> insert_unique(const value_type& __x);
751 pair<iterator,iterator> equal_range(const key_type& __x);
752 pair<const_iterator, const_iterator> equal_range(const key_type& __x) const;
874 pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,
890 return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
894 return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
895 return pair<iterator,bool>(__j, false);
1042 pair<iterator,iterator> __p = equal_range(__x);
1156 pair<const_iterator, const_iterator> __p = equal_range(__k);
1237 pair<typenam
[all...]
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 Dtempbuf.h31 #include <pair.h>
/haiku/headers/tools/cppunit/cppunit/
H A DXmlOutputter.h74 typedef std::pair<std::string,std::string> Attribute;
/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/add-ons/locale/catalogs/plaintext/
H A DCatalog.cpp37 using std::pair;
/haiku/src/apps/cortex/Persistence/
H A DImportContext.h101 typedef std::pair<const char*, IPersistent*> object_entry;
H A DXML.cpp73 pair<const BString, XML::DocumentType*>(type->rootElement, type));
296 pair<mapping_set::iterator, bool> ret = m_mappingSet.insert(mapping);
/haiku/src/apps/cortex/RouteApp/
H A DNodeSetIOContext.h101 typedef std::pair<BString,media_node_id> node_entry;
/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...]
H A DTipManagerImpl.h178 std::pair<BView*, const tip_entry*> match(
242 std::pair<BView*, const tip_entry*> match(
/haiku/src/apps/diskusage/
H A DInfoWindow.cpp31 using std::pair;
70 typedef pair<string, string> Item;

Completed in 186 milliseconds

123