Searched refs:iterator (Results 101 - 125 of 421) sorted by relevance

1234567891011>>

/haiku/src/apps/patchbay/
H A DPatchView.h63 typedef list<EndpointInfo>::iterator endpoint_itor;
65 typedef list<PatchRow*>::iterator row_itor;
/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/
H A DDirectory.h49 DirectoryIterator* iterator);
51 DirectoryIterator* iterator);
/haiku/src/servers/media/
H A DBufferManager.cpp152 BufferInfoMap::Iterator iterator = fBufferInfoMap.GetIterator(); local
153 while (iterator.HasNext()) {
154 BufferInfoMap::Entry entry = iterator.Next();
162 fBufferInfoMap.Remove(iterator);
176 BufferInfoMap::Iterator iterator = fBufferInfoMap.GetIterator(); local
177 while (iterator.HasNext()) {
178 buffer_info info = iterator.Next().value;
184 std::set<team_id>::iterator teamIterator = info.teams.begin();
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DEntry.h45 // entry iterator management
46 void AttachEntryIterator(EntryIterator *iterator);
47 void DetachEntryIterator(EntryIterator *iterator);
60 // iterator management
H A DAttribute.h47 // iterator management
48 void AttachAttributeIterator(AttributeIterator *iterator);
49 void DetachAttributeIterator(AttributeIterator *iterator);
63 // iterator management
/haiku/src/servers/registrar/
H A DRecentEntries.cpp116 std::list<recent_entry*>::iterator item;
178 std::list<recent_entry*>::iterator item;
207 for (std::list<recent_entry*>::iterator dupItem = duplicateList.begin();
239 std::list<recent_entry*>::iterator i;
253 std::list<recent_entry*>::iterator item;
287 for (std::list<recent_entry*>::iterator item = fEntryList.begin();
303 for (std::map<entry_ref, std::list<recent_entry*> >::iterator mapItem = map.begin();
316 for (std::list<recent_entry*>::iterator item = list.begin();
/haiku/headers/private/kernel/util/
H A DVector.h49 status_t Insert(const Value &value, const Iterator &iterator);
53 Iterator Erase(const Iterator &iterator);
86 inline int32 _IteratorIndex(const Iterator &iterator) const;
87 inline int32 _IteratorIndex(const ConstIterator &iterator) const;
322 \param iterator An iterator specifying the position at which to insert
326 - \c B_BAD_VALUE: \a iterator is is invalid.
331 _VECTOR_CLASS_NAME::Insert(const Value &value, const Iterator &iterator) argument
333 int32 index = _IteratorIndex(iterator);
361 \return An iterator referrin
388 Erase(const Iterator &iterator) argument
[all...]
/haiku/headers/private/userlandfs/shared/
H A DVector.h45 status_t Insert(const Value &value, const Iterator &iterator);
49 Iterator Erase(const Iterator &iterator);
82 inline int32 _IteratorIndex(const Iterator &iterator) const;
83 inline int32 _IteratorIndex(const ConstIterator &iterator) const;
318 \param iterator An iterator specifying the position at which to insert
322 - \c B_BAD_VALUE: \a iterator is is invalid.
327 _VECTOR_CLASS_NAME::Insert(const Value &value, const Iterator &iterator) argument
329 int32 index = _IteratorIndex(iterator);
357 \return An iterator referrin
384 Erase(const Iterator &iterator) argument
[all...]
/haiku/headers/cpp/
H A Dstl_tree.h156 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 Dstl_rope.h79 // 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 Dalgobase.h33 #include <iterator.h>
/haiku/src/kits/media/
H A DDormantNodeManager.cpp84 AddOnMap::iterator iterator = fAddOnMap.begin(); local
85 for (; iterator != fAddOnMap.end(); iterator++) {
86 loaded_add_on_info& info = iterator->second;
161 AddOnMap::iterator found = fAddOnMap.find(id);
266 AddOnMap::iterator found = fAddOnMap.find(id);
/haiku/src/system/kernel/
H A Dkernel_daemon.cpp113 DaemonList::Iterator iterator = fDaemons.GetIterator(); local
116 while (iterator.HasNext()) {
117 struct daemon* daemon = iterator.Next();
129 iterator.Remove();
142 DaemonList::Iterator iterator = fDaemons.GetIterator(); local
144 while (iterator.HasNext()) {
145 struct daemon* daemon = iterator.Next();
H A Dlow_resource_manager.cpp297 HandlerList::Iterator iterator = sLowResourceHandlers.GetIterator(); local
300 while (iterator.HasNext()) {
301 low_resource_handler *handler = iterator.Next();
445 HandlerList::Iterator iterator = sLowResourceHandlers.GetIterator(); local
447 while (iterator.HasNext()) {
448 low_resource_handler* handler = iterator.Next();
484 HandlerList::ReverseIterator iterator local
487 while (iterator.HasNext()) {
488 low_resource_handler *handler = iterator.Next();
/haiku/src/tools/cppunit/cppunit/
H A DTestFactoryRegistry.cpp52 Registries::iterator it = m_registries.begin();
127 for ( Factories::iterator it = m_factories.begin(); it != m_factories.end(); ++it )
182 for ( Factories::iterator it = m_factories.begin();
/haiku/headers/private/debug/
H A Ddebug_support.h87 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/src/tests/system/kernel/util/
H A DSinglyLinkedListTest.cpp68 for (typename List::Iterator iterator = list.GetIterator();
69 iterator.HasNext(); --preIndex) {
72 Element* element = iterator.Next();
/haiku/src/tests/kits/storage/
H A DStatableTest.h30 for (typename list<C*>::iterator it = entries.begin();
79 typename list<C*>::iterator entryIt;
80 typename list<string>::iterator entryNameIt;
/haiku/src/tools/cppunit/
H A DThreadedTestCase.cpp27 for (map<thread_id, ThreadSubTestInfo*>::iterator i = fNumberMap.begin();
44 map<thread_id, ThreadSubTestInfo*>::iterator i = fNumberMap.find(id);
101 map<thread_id, ThreadSubTestInfo*>::iterator i = fNumberMap.find(id);
/haiku/src/system/kernel/device_manager/
H A Did_generator.cpp130 GeneratorList::Iterator iterator = sGenerators.GetIterator(); local
131 while (iterator.HasNext()) {
132 id_generator* generator = iterator.Next();
/haiku/src/kits/network/libnetservices/
H A DUrlContext.cpp44 BHttpAuthenticationMap::Iterator iterator local
46 while (iterator.HasNext())
47 delete iterator.Next().value;
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A Dkernel_interface.cpp485 DirectoryCookie *iterator = new(nothrow) DirectoryCookie( local
487 if (iterator) {
488 error = iterator->Suspend();
490 *cookie = iterator;
492 delete iterator;
538 DirectoryCookie *iterator = (DirectoryCookie*)cookie; local
539 delete iterator;
553 DirectoryCookie *iterator = (DirectoryCookie*)cookie; local
554 status_t error = iterator->Resume();
562 && (error = iterator
652 DirectoryCookie *iterator = (DirectoryCookie*)cookie; local
[all...]
/haiku/src/add-ons/kernel/network/stack/
H A Droutes.cpp107 RouteList::Iterator iterator = domain->routes.GetIterator(); local
109 while (iterator.HasNext()) {
110 net_route_private* route = iterator.Next();
147 RouteList::Iterator iterator = domain->routes.GetIterator(); local
155 while (iterator.HasNext()) {
156 net_route_private* route = iterator.Next();
216 RouteList::Iterator iterator = domain->routes.GetIterator(); local
219 while (iterator.HasNext()) {
220 route = iterator.Next();
248 RouteInfoList::Iterator iterator local
299 RouteList::Iterator iterator = domain->routes.GetIterator(); local
325 RouteList::Iterator iterator = domain->routes.GetIterator(); local
496 RouteList::Iterator iterator = domain->routes.GetIterator(); local
592 RouteList::Iterator iterator = domain->routes.GetIterator(); local
612 RouteList::Iterator iterator = domain->routes.GetIterator(); local
[all...]
H A Ddomains.cpp53 DomainList::Iterator iterator = sDomains.GetIterator(); local
54 while (net_domain_private* domain = iterator.Next()) {
69 DomainList::Iterator iterator = sDomains.GetIterator(); local
70 while (net_domain_private* domain = iterator.Next()) {
/haiku/src/tools/fs_shell/
H A Dhash.h27 void hash_remove_current(struct hash_table *table, struct hash_iterator *iterator);

Completed in 116 milliseconds

1234567891011>>