/haiku/3rdparty/proj2make/ |
H A D | proj2make.cpp | 254 if (str.find("SRCS") == 0) 256 else if (str.find("LIBS") == 0) 258 else if (str.find("SYSTEM_INCLUDE_PATHS") == 0) 260 else if (str.find("LOCAL_INCLUDE_PATHS") == 0) 262 else if (str.find("TYPE") == 0) 264 else if (str.find("NAME") == 0) 266 else if (str.find("RSRCS") == 0)
|
/haiku/3rdparty/qtcreator/ |
H A D | create_project_file.sh | 33 find $rootdir -type f | sed "s@^@../../@" >>$DIR/$NAME.files 34 find $rootdir -type d | sed "s@^@../../@" >>$DIR/$NAME.includes 36 find headers -type d | sed "s@^@../../@" >>$DIR/$NAME.includes
|
/haiku/build/scripts/ |
H A D | bootstrap_client.py | 22 portIndex = address.find(':')
|
/haiku/headers/cpp/ |
H A D | algo.h | 39 using __STD::find;
|
H A D | ropeimpl.h | 949 rope<_CharT,_Alloc>::find(_CharT __pattern, size_t __start) const function in class:rope
|
H A D | stl_algo.h | 87 // find and find_if. 90 inline _InputIter find(_InputIter __first, _InputIter __last, function 112 _RandomAccessIter find(_RandomAccessIter __first, _RandomAccessIter __last, function 190 inline _InputIter find(_InputIter __first, _InputIter __last, function 193 return find(__first, __last, __val, __ITERATOR_CATEGORY(__first)); 292 return find(__first1, __last1, *__first2); 303 __first1 = find(__first1, __last1, *__first2); 337 return find(__first1, __last1, *__first2); 382 __first = find(__first, __last, __val); 394 __first = find(__ [all...] |
H A D | stl_hash_map.h | 176 iterator find(const key_type& __key) { return _M_ht.find(__key); } function in class:hash_map 177 const_iterator find(const key_type& __key) const function in class:hash_map 178 { return _M_ht.find(__key); } 360 iterator find(const key_type& __key) { return _M_ht.find(__key); } function in class:hash_multimap 361 const_iterator find(const key_type& __key) const function in class:hash_multimap 362 { return _M_ht.find(__key); }
|
H A D | stl_hash_set.h | 179 iterator find(const key_type& __key) const { return _M_ht.find(__key); } function in class:hash_set 351 iterator find(const key_type& __key) const { return _M_ht.find(__key); } function in class:hash_multiset
|
H A D | stl_hashtable.h | 458 iterator find(const key_type& __key) function in class:hashtable 469 const_iterator find(const key_type& __key) const function in class:hashtable
|
H A D | stl_map.h | 187 iterator find(const key_type& __x) { return _M_t.find(__x); } function in class:map 188 const_iterator find(const key_type& __x) const { return _M_t.find(__x); } function in class:map
|
H A D | stl_multimap.h | 176 iterator find(const key_type& __x) { return _M_t.find(__x); } function in class:multimap 177 const_iterator find(const key_type& __x) const { return _M_t.find(__x); } function in class:multimap
|
H A D | stl_multiset.h | 174 iterator find(const key_type& __x) const { return _M_t.find(__x); } function in class:multiset
|
H A D | stl_rope.h | 2221 size_type find(_CharT __c, size_type __pos = 0) const; 2222 size_type find(_CharT* __s, size_type __pos = 0) const { function in class:rope
|
H A D | stl_set.h | 168 iterator find(const key_type& __x) const { return _M_t.find(__x); } function in class:set
|
H A D | stl_tree.h | 744 iterator find(const key_type& __x); 745 const_iterator find(const key_type& __x) const; 1115 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) function in class:_Rb_tree 1134 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) const function in class:_Rb_tree
|
/haiku/headers/cpp/std/ |
H A D | bastring.cc | 245 find (const charT* s, size_type pos, size_type n) const function in class:basic_string 269 find (charT c, size_type pos) const function in class:basic_string
|
/haiku/headers/tools/cppunit/ |
H A D | ThreadedTestCaller.h | 91 if (fThreads.find(threadName) == fThreads.end()) {
|
/haiku/src/add-ons/kernel/file_systems/cdda/ |
H A D | cdda.cpp | 150 //! Finds the first occurrence of \a find in \a string, ignores case. 152 find_string(const char *string, const char *find) argument 154 if (string == NULL || find == NULL) 157 char first = tolower(find[0]); 161 int32 findLength = strlen(find) - 1; 162 find++; 167 if (strncasecmp(string + 1, find, findLength) == 0)
|
/haiku/src/add-ons/mail_daemon/inbound_protocols/imap/ |
H A D | IMAPMailbox.cpp | 65 MessageEntryMap::const_iterator found = fMessageEntries.find(uid); 76 MessageEntryMap::const_iterator found = fMessageEntries.find(uid);
|
/haiku/src/add-ons/mail_daemon/inbound_protocols/imap/imap_lib/ |
H A D | Protocol.cpp | 345 = fOngoingCommands.find(response.Tag());
|
/haiku/src/add-ons/print/drivers/gutenprint/ |
H A D | GPBinding.cpp | 63 if (manufacturerSet.find(manufacturer) != manufacturerSet.end())
|
H A D | GPCapabilities.cpp | 119 fDriverSpecificCapabilities.find(category);
|
/haiku/src/add-ons/translators/jpeg/ |
H A D | exif_parser.cpp | 241 if (visited.find(offset) != visited.end()) { 282 if (visited.find(nextOffset) != visited.end())
|
/haiku/src/apps/cortex/Persistence/ |
H A D | Importer.cpp | 288 XML::doc_type_map::iterator it = XML::s_docTypeMap.find(
|
H A D | XML.cpp | 308 mapping_set::iterator it = m_mappingSet.find(&m);
|