/haiku/src/kits/network/libnetservices2/ |
H A D | HttpPrivate.h | 25 \returns \c true if the string is valid, or \c false if it is not. 30 for (auto it = string.cbegin(); it < string.cend(); it++) { 31 if (*it <= 31 || *it == 127 || *it == '(' || *it == ')' || *it == '<' || *it [all...] |
/haiku/src/servers/registrar/ |
H A D | WatchingService.cpp | 44 supplied, only to those watchers it selects. 79 for (watcher_map::iterator it = fWatchers.begin(); 80 it != fWatchers.end(); 81 ++it) { 82 delete it->second; 90 is the caller must not delete it after the method returns. 134 deletes it. 137 to the caller, otherwise it is deleted. 148 watcher_map::iterator it = fWatchers.find(watcher->Target()); local 149 bool result = (it ! 177 watcher_map::iterator it = fWatchers.find(target); local [all...] |
H A D | AppInfoList.h | 83 inline Iterator(const Iterator &it) argument 84 : fList(it.fList), 85 fIndex(it.fIndex), 86 fCount(it.fCount) 105 inline Iterator &operator=(const Iterator &it) argument 107 fList = it.fList; 108 fIndex = it.fIndex; 109 fCount = it.fCount; 135 inline bool operator==(const Iterator &it) const 137 return (fList == it [all...] |
/haiku/src/apps/cortex/RouteApp/ |
H A D | NodeSetIOContext.cpp | 65 for(node_set::const_iterator it = m_nodes.begin(); 66 it != m_nodes.end(); ++it) { 68 if((*it).second == node) { 71 (*it).first.Length() && 72 strcmp(key, (*it).first.String()) != 0) { 76 node, key, (*it).first.String())); 96 for(node_set::iterator it = m_nodes.begin(); 97 it != m_nodes.end(); ++it) { [all...] |
/haiku/src/servers/power/ |
H A D | lid_monitor.cpp | 29 for (std::set<int>::iterator it = fFDs.begin(); it != fFDs.end(); ++it) 30 close(*it);
|
H A D | power_button_monitor.cpp | 49 for (std::set<int>::iterator it = fFDs.begin(); it != fFDs.end(); ++it) 50 close(*it);
|
/haiku/src/tools/cppunit/ |
H A D | BTestSuite.cpp | 26 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin(); 27 it != fTests.end(); 28 ++it) 29 delete it->second; 38 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin(); 39 it != fTests.end(); 40 ++it ) 45 Test *test = it->second; 57 for ( map<string, CppUnit::Test *>::const_iterator it = fTests.begin(); 58 it ! [all...] |
/haiku/src/tools/cppunit/cppunit/ |
H A D | TestSuite.cpp | 24 for ( vector<Test *>::iterator it = m_tests.begin(); 25 it != m_tests.end(); 26 ++it) 27 delete *it; 36 for ( vector<Test *>::iterator it = m_tests.begin(); 37 it != m_tests.end(); 38 ++it ) 43 Test *test = *it; 55 for ( vector<Test *>::const_iterator it = m_tests.begin(); 56 it ! [all...] |
H A D | TestResult.cpp | 62 for ( TestListeners::iterator it = m_listeners.begin(); 63 it != m_listeners.end(); 64 ++it ) 65 (*it)->addFailure( failure ); 74 for ( TestListeners::iterator it = m_listeners.begin(); 75 it != m_listeners.end(); 76 ++it ) 77 (*it)->startTest( test ); 86 for ( TestListeners::iterator it = m_listeners.begin(); 87 it ! [all...] |
H A D | TestFactoryRegistry.cpp | 52 Registries::iterator it = m_registries.begin(); local 53 while ( it != m_registries.end() ) 55 TestFactoryRegistry *registry = (it++)->second; 127 for ( Factories::iterator it = m_factories.begin(); it != m_factories.end(); ++it ) 129 TestFactory *factory = it->second; 182 for ( Factories::iterator it = m_factories.begin(); 183 it != m_factories.end(); 184 ++it ) [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/shared/ |
H A D | AbstractConnection.cpp | 30 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 31 it != fDownStreamChannels.End(); 32 it++) { 33 delete *it; 37 for (ChannelVector::Iterator it = fUpStreamChannels.Begin(); 38 it != fUpStreamChannels.End(); 39 it++) { 40 delete *it; 62 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 63 it ! [all...] |
/haiku/src/apps/cortex/TipManager/ |
H A D | TipManagerImpl.cpp | 70 for(list<_ViewEntry*>::iterator it = m_childViews.begin(); 71 it != m_childViews.end(); ++it) { 72 delete *it; 74 for(tip_entry_set::iterator it = m_tips.begin(); 75 it != m_tips.end(); ++it) { 76 delete *it; 126 // found a home; can it hold the tip? 184 // it' 195 tip_entry_set::iterator it = viewEntry->m_tips.lower_bound(&matchEntry); local 238 list<_ViewEntry*>::iterator it = local [all...] |
/haiku/src/servers/package/ |
H A D | VolumeState.cpp | 72 for (PackageSet::iterator it = activatedPackage.begin(); 73 it != activatedPackage.end(); ++it) { 74 (*it)->SetActive(true); 77 for (PackageSet::iterator it = deactivatePackages.begin(); 78 it != deactivatePackages.end(); ++it) { 79 Package* package = *it; 94 for (PackageFileNameHashTable::Iterator it 96 Package* package = it [all...] |
H A D | PackageManager.cpp | 71 for (PackageSet::const_iterator it = packagesToDeactivate.begin(); 72 it != packagesToDeactivate.end(); ++it) { 73 BSolverPackage* solverPackage = _SolverPackageFor(*it); 94 for (PackageSet::const_iterator it = packagesToDeactivate.begin(); 95 it != packagesToDeactivate.end(); ++it) { 96 BSolverPackage* solverPackage = _SolverPackageFor(*it); 108 for (PackageSet::const_iterator it = packagesToActivate.begin(); 109 it ! 399 SolverPackageMap::const_iterator it = fSolverPackages.find(package); local [all...] |
/haiku/src/servers/app/drawing/ |
H A D | AlphaMaskCache.cpp | 64 for (ShapeMaskSet::iterator it = fShapeMasks.begin(); 65 it != fShapeMasks.end();) { 67 if (atomic_get(&it->fMask->fNextMaskCount) > 0) { 68 it++; 72 size_t removedMaskStackSize = it->fMask->BitmapSize(); 73 removedMaskStackSize += _FindUncachedPreviousMasks(it->fMask, 77 it->fMask->fInCache = false; 78 it->fMask->ReleaseReference(); 80 fShapeMasks.erase(it++); 118 ShapeMaskSet::iterator it local [all...] |
/haiku/src/kits/network/libnetservices/ |
H A D | NetworkCookieJarPrivate.h | 24 BNetworkCookieHashMap::Iterator it) 26 fCookieMapIterator(it) 23 PrivateIterator( BNetworkCookieHashMap::Iterator it) argument
|
/haiku/src/apps/debugger/user_interface/gui/value/ |
H A D | TableCellValueEditor.cpp | 55 for (ListenerList::Iterator it = fListeners.GetIterator(); 56 Listener* listener = it.Next();) { 65 for (ListenerList::Iterator it = fListeners.GetIterator(); 66 Listener* listener = it.Next();) { 75 for (ListenerList::Iterator it = fListeners.GetIterator(); 76 Listener* listener = it.Next();) {
|
/haiku/src/apps/haikudepot/server/ |
H A D | LocalPkgDataLoadProcess.cpp | 189 PackageInfoMap::iterator it = foundPackages.find( local 191 if (it != foundPackages.end()) 192 modelInfo.SetTo(it->second); 207 // because then it will be possible to perform a rating on it later. 223 std::vector<DepotInfoRef>::iterator it; local 225 for (it = depots.begin(); it != depots.end(); it++) { 226 if ((*it) 290 std::vector<DepotInfoRef>::iterator it; local 356 PackageInfoMap::iterator it = systemInstalledPackages.find( local [all...] |
/haiku/src/apps/cortex/support/ |
H A D | ProfileTarget.cpp | 94 for(block_entry_map::const_iterator it = m_blockEntryMap.begin(); 95 it != m_blockEntryMap.end(); 96 it++) { 97 if((*it).first.Length() > nameLength) 98 nameLength = (*it).first.Length(); 100 sorted.back() = (*it).second; 101 sorted.back().name = (*it).first.String();
|
/haiku/src/kits/debugger/debug_info/ |
H A D | Function.cpp | 49 for (FunctionInstanceList::Iterator it = fInstances.GetIterator(); 50 FunctionInstance* instance = it.Next();) { 104 for (ListenerList::Iterator it = fListeners.GetIterator(); 105 Listener* listener = it.Next();) { 119 for (FunctionInstanceList::Iterator it = fInstances.GetIterator(); 120 FunctionInstance* instance = it.Next();) {
|
/haiku/headers/private/kernel/ |
H A D | listeners.h | 46 SchedulerListenerList::Iterator it = gSchedulerListeners.GetIterator(); local 47 while (SchedulerListener* listener = it.Next()) 60 SchedulerListenerList::Iterator it = gSchedulerListeners.GetIterator(); local 61 while (SchedulerListener* listener = it.Next()) 93 WaitObjectListenerList::Iterator it local 95 while (WaitObjectListener* listener = it.Next()) 109 WaitObjectListenerList::Iterator it local 111 while (WaitObjectListener* listener = it.Next())
|
/haiku/src/apps/haikudepot/packagemodel/ |
H A D | DepotInfo.cpp | 132 std::vector<PackageInfoRef>::const_iterator it local 138 if (it != fPackages.end()) { 139 PackageInfoRef candidate = *it; 150 std::vector<PackageInfoRef>::const_iterator it local 157 if (it != fPackages.end()) { 158 PackageInfoRef candidate = *it; 199 std::vector<PackageInfoRef>::const_iterator it; local 200 for (it = fPackages.begin(); it != fPackages.end(); it [all...] |
/haiku/src/bin/ |
H A D | top.cpp | 148 ThreadTimeList::iterator it; local 152 for (it = newList->begin(); it != newList->end(); it++) { 156 if (itOld->thid != it->thid) { 161 newtime = it->total_time(); 166 entry.thid = it->thid; 167 entry.user_time = (it->user_time - itOld->user_time); 168 entry.kernel_time = (it->kernel_time - itOld->kernel_time); 171 entry.thid = it [all...] |
/haiku/src/apps/cortex/NodeManager/ |
H A D | NodeManager.cpp | 294 // do it 328 for(node_ref_map::const_iterator it = m_nodeRefMap.begin(); 329 it != m_nodeRefMap.end(); ++it) { 330 deadNodes.push_back((*it).second); 344 for(node_group_set::iterator it = m_nodeGroupSet.begin(); 345 it != m_nodeGroupSet.end(); ++it) { 346 _clearGroup(*it); 369 for(con_map::iterator it 479 node_ref_map::const_iterator it = m_nodeRefMap.find(id); local 504 con_map::const_iterator it = m_conSourceMap.lower_bound(node); local 527 con_map::const_iterator it = m_conDestinationMap.lower_bound(node); local 554 con_map::const_iterator it = m_conSourceMap.lower_bound(sourceNode); local 790 node_group_set::const_iterator it; local 811 node_group_set::const_iterator it; local 1336 con_map::iterator it = m_conSourceMap.lower_bound(connection.sourceNode()); local 1712 node_ref_map::iterator it = m_nodeRefMap.find(id); local 1860 node_group_set::iterator it = find( local [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/resolvables/ |
H A D | ResolvableFamily.cpp | 22 for (FamilyResolvableList::Iterator it = fResolvables.GetIterator(); 23 (otherResolvable = it.Next()) != NULL;) { 55 for (FamilyResolvableList::Iterator it = fResolvables.GetIterator(); 56 Resolvable* resolvable = it.Next();) {
|