/haiku/src/apps/cortex/addons/LoggingConsumer/ |
H A D | LogWriter.cpp | 163 else mFilters.insert(what); 178 // mFilters.insert(LOG_QUIT); // don't disable our quit messages 179 mFilters.insert(LOG_SET_RUN_MODE); 180 mFilters.insert(LOG_PREROLL); 181 mFilters.insert(LOG_SET_TIME_SOURCE); 182 mFilters.insert(LOG_REQUEST_COMPLETED); 183 mFilters.insert(LOG_GET_PARAM_VALUE); 184 mFilters.insert(LOG_SET_PARAM_VALUE); 185 mFilters.insert(LOG_FORMAT_SUGG_REQ); 186 mFilters.insert(LOG_FORMAT_PROPOSA [all...] |
/haiku/src/servers/power/ |
H A D | lid_monitor.cpp | 23 fFDs.insert(fd);
|
H A D | power_button_monitor.cpp | 41 fFDs.insert(fd);
|
/haiku/src/tools/cppunit/cppunit/ |
H A D | TestFactoryRegistry.cpp | 78 m_registries.insert( 87 m_registries.insert( std::make_pair( name, factory ) ); 89 m_factoriesToDestroy.insert( factory ); 100 m_destroyedFactories.insert( factory );
|
/haiku/src/bin/multiuser/ |
H A D | groupmod.cpp | 74 usersToAdd.insert(optarg); 82 usersToRemove.insert(optarg); 128 usersToAdd.insert(user); 137 // If the group doesn't have any more members, insert an empty string as an 140 usersToAdd.insert("");
|
/haiku/headers/cpp/ |
H A D | stl_list.h | 343 iterator insert(iterator __position, const _Tp& __x) { function in class:list 351 iterator insert(iterator __position) { return insert(__position, _Tp()); } function in class:list 358 insert(__pos, (size_type) __n, (_Tp) __x); 367 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:list 373 void insert(iterator __position, const _Tp* __first, const _Tp* __last); 374 void insert(iterator __position, 377 void insert(iterator __pos, size_type __n, const _Tp& __x); 379 void push_front(const _Tp& __x) { insert(begin(), __x); } 380 void push_front() {insert(begi 566 list<_Tp, _Alloc>::insert(iterator __position, function in class:list 575 list<_Tp, _Alloc>::insert(iterator __position, function in class:list 586 list<_Tp, _Alloc>::insert(iterator __position, size_type __n, const _Tp& __x) function in class:list [all...] |
H A D | stl_multiset.h | 137 // insert/erase 138 iterator insert(const value_type& __x) { function in class:multiset 141 iterator insert(iterator __position, const value_type& __x) { function in class:multiset 148 void insert(_InputIterator __first, _InputIterator __last) { function in class:multiset 152 void insert(const value_type* __first, const value_type* __last) { function in class:multiset 155 void insert(const_iterator __first, const_iterator __last) { function in class:multiset
|
H A D | stl_set.h | 131 // insert/erase 132 pair<iterator,bool> insert(const value_type& __x) { function in class:set 136 iterator insert(iterator __position, const value_type& __x) { function in class:set 142 void insert(_InputIterator __first, _InputIterator __last) { function in class:set 146 void insert(const_iterator __first, const_iterator __last) { function in class:set 149 void insert(const value_type* __first, const value_type* __last) { function in class:set
|
H A D | stl_map.h | 154 __i = insert(__i, value_type(__k, _Tp())); 159 // insert/erase 161 pair<iterator,bool> insert(const value_type& __x) function in class:map 163 iterator insert(iterator position, const value_type& __x) function in class:map 167 void insert(_InputIterator __first, _InputIterator __last) { function in class:map 171 void insert(const value_type* __first, const value_type* __last) { function in class:map 174 void insert(const_iterator __first, const_iterator __last) { function in class:map
|
H A D | stl_multimap.h | 149 // insert/erase 151 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } function in class:multimap 152 iterator insert(iterator __position, const value_type& __x) { function in class:multimap 157 void insert(_InputIterator __first, _InputIterator __last) { function in class:multimap 161 void insert(const value_type* __first, const value_type* __last) { function in class:multimap 164 void insert(const_iterator __first, const_iterator __last) { function in class:multimap
|
H A D | stl_rope.h | 1974 void insert(size_t __p, const rope& __r) { function in class:rope 1984 void insert(size_t __p, size_t __n, _CharT __c) { function in class:rope 1986 insert(__p, __r); 1989 void insert(size_t __p, const _CharT* __i, size_t __n) { function in class:rope 1999 void insert(size_t __p, const _CharT* __c_string) { function in class:rope 2000 insert(__p, __c_string, _S_char_ptr_len(__c_string)); 2003 void insert(size_t __p, _CharT __c) { function in class:rope 2004 insert(__p, &__c, 1); 2007 void insert(size_t __p) { function in class:rope 2009 insert(__ 2012 void insert(size_t __p, const _CharT* __i, const _CharT* __j) { function in class:rope 2017 void insert(size_t __p, const const_iterator& __i, function in class:rope 2023 void insert(size_t __p, const iterator& __i, function in class:rope 2117 iterator insert(const iterator& __p, const rope& __r) function in class:rope 2119 iterator insert(const iterator& __p, size_t __n, _CharT __c) function in class:rope 2121 iterator insert(const iterator& __p, _CharT __c) function in class:rope 2123 iterator insert(const iterator& __p ) function in class:rope 2125 iterator insert(const iterator& __p, const _CharT* c_string) function in class:rope 2127 iterator insert(const iterator& __p, const _CharT* __i, size_t __n) function in class:rope 2129 iterator insert(const iterator& __p, const _CharT* __i, function in class:rope 2132 iterator insert(const iterator& __p, function in class:rope 2135 iterator insert(const iterator& __p, function in class:rope [all...] |
H A D | stl_hash_map.h | 160 pair<iterator,bool> insert(const value_type& __obj) function in class:hash_map 164 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_map 167 void insert(const value_type* __f, const value_type* __l) { function in class:hash_map 170 void insert(const_iterator __f, const_iterator __l) function in class:hash_map 344 iterator insert(const value_type& __obj) function in class:hash_multimap 348 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multimap 351 void insert(const value_type* __f, const value_type* __l) { function in class:hash_multimap 354 void insert(const_iterator __f, const_iterator __l) function in class:hash_multimap
|
H A D | stl_hash_set.h | 156 pair<iterator, bool> insert(const value_type& __obj) function in class:hash_set 163 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_set 166 void insert(const value_type* __f, const value_type* __l) { function in class:hash_set 169 void insert(const_iterator __f, const_iterator __l) function in class:hash_set 335 iterator insert(const value_type& __obj) function in class:hash_multiset 339 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multiset 342 void insert(const value_type* __f, const value_type* __l) { function in class:hash_multiset 345 void insert(const_iterator __f, const_iterator __l) function in class:hash_multiset
|
/haiku/src/tests/kits/storage/ |
H A D | BasicTest.h | 96 fUntestedNames.insert(name); 115 fUntestedNames.insert(fTestedNames.begin(), fTestedNames.end()); 124 fTestedNames.insert(name);
|
/haiku/src/tests/ |
H A D | UnitTester.cpp | 49 fLibDirs.insert(defaultLibDir);
|
/haiku/src/kits/media/ |
H A D | PortPool.cpp | 65 fPool.insert(port);
|
H A D | TimeSourceObjectManager.cpp | 82 fMap.insert(std::make_pair(node.node, timeSource));
|
/haiku/src/libs/alm/ |
H A D | SharedSolver.cpp | 238 autoConstraints.insert(row->fPrefSizeConstraint); 244 autoConstraints.insert(column->fPrefSizeConstraint); 255 autoConstraints.insert(min); 257 autoConstraints.insert(max); 299 constraints.insert(area->fMinContentWidth); 301 constraints.insert(area->fMaxContentWidth); 303 constraints.insert(area->fMinContentHeight); 305 constraints.insert(area->fMaxContentHeight); 307 constraints.insert(area->fContentAspectRatioC);
|
/haiku/src/libs/print/libprint/ |
H A D | PrintProcess.cpp | 121 fPages.insert(fIt, new PageData(file, reverse)); 127 fPages.insert(fIt, new PageData);
|
/haiku/src/kits/storage/mime/ |
H A D | SupportingApps.cpp | 186 newTypes.insert(type.String()); 199 strandedTypes.insert(*i); 245 fSupportingApps[type].insert(app); 316 supportedTypes.insert(type.String());
|
/haiku/src/servers/package/ |
H A D | PackageManager.cpp | 79 fPackagesRemovedByUser.insert(solverPackage); 103 fPackagesRemovedByUser.insert(solverPackage); 116 fPackagesAddedByUser.insert(solverPackage); 233 packagesAlreadyAdded.insert(package); 244 packagesAlreadyRemoved.insert(package);
|
/haiku/src/kits/support/ |
H A D | JobQueue.cpp | 91 if (!fQueuedJobs->insert(job).second) 257 // Only insert a job if it was in our queue before 259 fQueuedJobs->insert(dependantJob);
|
/haiku/src/system/libroot/posix/malloc_debug/ |
H A D | heap.cpp | 712 // insert this area in the all_areas list so it stays ordered by base 717 heap_area *insert = heap->all_areas; local 718 while (insert->all_next && insert->all_next->base > area->base) 719 insert = insert->all_next; 721 area->all_next = insert->all_next; 722 insert->all_next = area; 845 heap_area *insert = area->next; local 846 while (insert 894 heap_area *insert = area->prev; local 1292 heap_page *insert = page->next; local [all...] |
/haiku/src/system/kernel/ |
H A D | heap.cpp | 1078 // insert this area in the all_areas list so it stays ordered by base 1083 heap_area *insert = heap->all_areas; local 1084 while (insert->all_next && insert->all_next->base > area->base) 1085 insert = insert->all_next; 1087 area->all_next = insert->all_next; 1088 insert->all_next = area; 1234 heap_area *insert = area->next; local 1235 while (insert 1283 heap_area *insert = area->prev; local 1689 heap_page *insert = page->next; local [all...] |
/haiku/src/apps/diskprobe/ |
H A D | FindWindow.cpp | 112 char* insert = (char*)malloc(textLength * 2); local 113 if (insert == NULL) 128 insert[out++] = c; 131 insert[out++] = '\n'; 133 insert[out++] = ' '; 135 insert[out] = '\0'; 142 // BTextView::InsertText(insert, out, 0, NULL); 144 Insert(0, insert, out); 147 free(insert);
|