/haiku/headers/cpp/ |
H A D | algobase.h | 33 #include <iterator.h>
|
H A D | iterator.h | 59 using __STD::iterator;
|
H A D | stl.h | 7 #include <iterator>
|
H A D | stl_bvector.h | 78 typedef _Bit_iterator iterator; typedef in struct:_Bit_iterator 99 iterator& operator++() { 103 iterator operator++(int) { 104 iterator __tmp = *this; 108 iterator& operator--() { 112 iterator operator--(int) { 113 iterator __tmp = *this; 117 iterator& operator+=(difference_type __i) { 128 iterator& operator-=(difference_type __i) { 132 iterator operato 388 typedef _Bit_iterator iterator; typedef in class:vector [all...] |
H A D | stl_deque.h | 35 * For any nonsingular iterator i: 42 * pointer, even if i is a past-the-end iterator. 100 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator; typedef in struct:_Deque_iterator 107 typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in struct:_Deque_iterator::_Deque_iterator 132 _Deque_iterator(const iterator& __x) 344 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator; typedef in class:_Deque_iterator::_Deque_base 361 iterator _M_start; 362 iterator _M_finish; 371 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator; typedef in class:_Deque_iterator::_Deque_base 374 typedef _Deque_iterator<_Tp,_Tp&,_Tp*> iterator; 495 typedef typename _Base::iterator iterator; typedef in class:_Deque_iterator::deque [all...] |
H A D | stl_hash_map.h | 72 typedef typename _Ht::iterator iterator; typedef in class:hash_map 154 iterator begin() { return _M_ht.begin(); } 155 iterator end() { return _M_ht.end(); } 160 pair<iterator,bool> insert(const value_type& __obj) 173 pair<iterator,bool> insert_noresize(const value_type& __obj) 176 iterator find(const key_type& __key) { return _M_ht.find(__key); } 186 pair<iterator, iterator> equal_range(const key_type& __key) 193 void erase(iterator __i 255 typedef typename _Ht::iterator iterator; typedef in class:hash_multimap [all...] |
H A D | stl_hash_set.h | 69 typedef typename _Ht::const_iterator iterator; typedef in class:hash_set 152 iterator begin() const { return _M_ht.begin(); } 153 iterator end() const { return _M_ht.end(); } 156 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); 179 iterator fin 248 typedef typename _Ht::const_iterator iterator; typedef in class:hash_multiset [all...] |
H A D | stl_hashtable.h | 75 iterator; typedef in struct:_Hashtable_iterator 98 iterator& operator++(); 99 iterator operator++(int); 100 bool operator==(const iterator& __it) const 102 bool operator!=(const iterator& __it) const 114 iterator; typedef in struct:_Hashtable_const_iterator 133 _Hashtable_const_iterator(const iterator& __it) 236 iterator; typedef in class:hashtable 316 iterator begin() 320 return iterator(_M_bucket [all...] |
H A D | stl_iterator.h | 44 // the C++ standard. (they have been replaced by struct iterator.) 91 struct iterator { struct 253 // we must keep the old iterator query functions around. 428 typename _Container::iterator iter; 437 insert_iterator(_Container& __x, typename _Container::iterator __i) 465 typedef typename _Container::iterator __iter;
|
H A D | stl_list.h | 51 typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator; typedef in struct:_List_iterator 67 _List_iterator(const iterator& __x) : _M_node(__x._M_node) {} 266 typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator; typedef in class:list 271 typedef reverse_iterator<iterator> reverse_iterator; 276 typedef reverse_bidirectional_iterator<iterator,value_type,reference, 312 iterator begin() { return (_Node*)(_M_node->_M_next); } 315 iterator end() { return _M_node; } 343 iterator insert(iterator __position, const _Tp& __x) { 351 iterator inser [all...] |
H A D | stl_map.h | 80 typedef typename _Rep_type::iterator iterator; typedef in class:map 139 iterator begin() { return _M_t.begin(); } 141 iterator end() { return _M_t.end(); } 151 iterator __i = lower_bound(__k); 161 pair<iterator,bool> insert(const value_type& __x) 163 iterator insert(iterator position, const value_type& __x) 179 void erase(iterator __position) { _M_t.erase(__position); } 181 void erase(iterator __firs [all...] |
H A D | stl_multimap.h | 79 typedef typename _Rep_type::iterator iterator; typedef in class:multimap 136 iterator begin() { return _M_t.begin(); } 138 iterator end() { return _M_t.end(); } 151 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } 152 iterator insert(iterator __position, const value_type& __x) { 168 void erase(iterator __position) { _M_t.erase(__position); } 170 void erase(iterator __first, iterator __las [all...] |
H A D | stl_multiset.h | 65 typedef typename _Rep_type::const_iterator iterator; typedef in class:multiset 128 iterator begin() const { return _M_t.begin(); } 129 iterator end() const { return _M_t.end(); } 138 iterator insert(const value_type& __x) { 141 iterator insert(iterator __position, const value_type& __x) { 142 typedef typename _Rep_type::iterator _Rep_iterator; 159 void erase(iterator __position) { 160 typedef typename _Rep_type::iterator _Rep_iterator; 166 void erase(iterator __firs [all...] |
H A D | stl_rope.h | 79 // Buffer should really be an arbitrary output iterator. 81 // This is thoroughly impossible, since iterator types don't 746 // Dereferencing a nonconst iterator has to return something 848 // When we run out of cache, we have to reconstruct the iterator 1000 // Perhaps we should instead copy the iterator 1270 typedef _Rope_iterator<_CharT,_Alloc> iterator; typedef in class:rope 1386 // Should really take an arbitrary iterator. 1518 // should take an arbitrary iterator 1624 // Should perhaps be templatized with respect to the iterator type 1638 rope(const iterator [all...] |
H A D | stl_set.h | 65 typedef typename _Rep_type::const_iterator iterator; typedef in class:set 122 iterator begin() const { return _M_t.begin(); } 123 iterator end() const { return _M_t.end(); } 132 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); 136 iterator insert(iterator __position, const value_type& __x) { 137 typedef typename _Rep_type::iterator _Rep_iterator; 153 void erase(iterator __positio [all...] |
H A D | stl_slist.h | 125 typedef _Slist_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in struct:_Slist_iterator 136 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 313 typedef _Slist_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in class:slist 414 iterator begin() { return iterator((_Node*)_M_head._M_next); } 418 iterator end() { return iterator(0); } 449 iterator previous(const_iterator __pos) { 450 return iterator((_Node*) __slist_previous(&_M_head, __pos._M_node)); 473 // Check whether it's an integral type. If so, it's not an iterator [all...] |
H A D | stl_tree.h | 156 iterator; typedef in struct:_Rb_tree_iterator 165 _Rb_tree_iterator(const iterator& __it) { _M_node = __it._M_node; } 621 typedef _Rb_tree_iterator<value_type, reference, pointer> iterator; typedef in class:_Rb_tree 627 typedef reverse_iterator<iterator> reverse_iterator; 629 typedef reverse_bidirectional_iterator<iterator, value_type, reference, 638 iterator _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v); 677 // __root, in iterator.operator++ 686 iterator begin() { return _M_leftmost(); } 688 iterator end() { return _M_header; } 710 pair<iterator,boo [all...] |
H A D | stl_vector.h | 163 typedef value_type* iterator; typedef in class:vector 175 typedef reverse_iterator<iterator> reverse_iterator; 179 typedef reverse_iterator<iterator, value_type, reference, difference_type> 193 void _M_insert_aux(iterator __position, const _Tp& __x); 194 void _M_insert_aux(iterator __position); 197 iterator begin() { return _M_start; } 199 iterator end() { return _M_finish; } 252 // Check whether it's an integral type. If so, it's not an iterator. 286 iterator __tmp = _M_allocate_and_copy(__n, _M_start, _M_finish); 355 iterator inser [all...] |
/haiku/headers/libs/agg/ |
H A D | agg_scanline_p.h | 57 typedef span* iterator; typedef in class:agg::scanline_p8
|
H A D | agg_scanline_u.h | 51 // Scanline provides an iterator class that allows you to extract 54 // Use scanline_u8::iterator to render spans: 124 typedef span* iterator; typedef in class:agg::scanline_u8 222 iterator begin() { return &m_spans[1]; } 263 typename base_type::iterator span = base_type::begin(); 326 class iterator class in class:agg::scanline32_u8 329 iterator(span_array_type& spans) : function in class:agg::scanline32_u8::iterator 435 iterator begin() { return iterator(m_spans); } 476 typename base_type::iterator spa [all...] |
/haiku/headers/libs/print/libprint/ |
H A D | PrintProcess.h | 59 PageDataList::iterator fIt;
|
/haiku/headers/private/app/ |
H A D | LooperList.h | 55 typedef std::vector<BLooperList::LooperData>::iterator LooperDataIterator;
|
/haiku/headers/private/debug/ |
H A D | debug_support.h | 87 void debug_delete_symbol_iterator(debug_symbol_iterator* iterator); 89 status_t debug_next_image_symbol(debug_symbol_iterator* iterator, 92 status_t debug_get_symbol_iterator_image_info(debug_symbol_iterator* iterator,
|
/haiku/headers/private/kernel/util/ |
H A D | AVLTreeMap.h | 81 Iterator* iterator); 375 Iterator* iterator) 390 if (iterator) 391 *iterator = Iterator(this, fTree.GetIterator(node)); 374 Insert(const Key& key, const Value& value, Iterator* iterator) argument
|
/haiku/headers/private/storage/ |
H A D | AddOnMonitorHandler.h | 91 EntryList::iterator& it) const; 94 EntryList::iterator& it) const; 102 DirectoryList::iterator& it) const; 105 DirectoryList::iterator& it) const; 107 DirectoryList::iterator& it, 112 DirectoryList::iterator& it,
|