HelenOS sources
find 42 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return table.find(key) == table.end() ? 0 : 1;
find 119 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto it = table.find(key);
find 129 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto it = table.find(key);
find 374 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto first = table.find(key);
find 393 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto first = table.find(key);
find 300 uspace/lib/cpp/include/__bits/adt/map.hpp auto it = find(key);
find 308 uspace/lib/cpp/include/__bits/adt/map.hpp auto it = find(key);
find 518 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 523 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 532 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 541 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 1037 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 1042 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 1051 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 1060 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.find(key);
find 42 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return tree.find(key) == tree.end() ? 0 : 1;
find 50 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto it = tree.find(key);
find 255 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto it = tree.find(key);
find 274 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp auto it = tree.find(key);
find 335 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 340 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 349 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 358 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 816 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 821 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 830 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 839 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.find(key);
find 527 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.find(key);
find 532 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.find(key);
find 608 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto it = find(key);
find 616 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto it = find(key);
find 1031 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.find(key);
find 1036 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.find(key);
find 340 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.find(key);
find 345 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.find(key);
find 756 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.find(key);
find 761 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.find(key);
find 1207 uspace/lib/cpp/include/__bits/string/string.hpp return find(str.c_str(), pos, str.size());
find 1229 uspace/lib/cpp/include/__bits/string/string.hpp return find(str, pos, traits_type::length(str));
find 1316 uspace/lib/cpp/include/__bits/string/string.hpp return find(c, pos);
find 150 uspace/lib/cpp/include/__bits/test/test.hpp if (cont.find(*first++) == cont.end())
find 107 uspace/lib/cpp/src/__bits/test/algorithm.cpp auto res7 = std::find(data2.begin(), data2.end(), 40);
find 203 uspace/lib/cpp/src/__bits/test/map.cpp auto res10 = map2.erase(map2.find(7));
find 204 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase", map2.find(7), map2.end());
find 321 uspace/lib/cpp/src/__bits/test/map.cpp auto res7 = mmap.erase(mmap.find(7));
find 149 uspace/lib/cpp/src/__bits/test/set.cpp auto res10 = set1.erase(set1.find(2));
find 150 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase", set1.find(2), set1.end());
find 244 uspace/lib/cpp/src/__bits/test/set.cpp auto res7 = mset.erase(mset.find(7));
find 403 uspace/lib/cpp/src/__bits/test/string.cpp auto idx = str1.find(target, 0);
find 409 uspace/lib/cpp/src/__bits/test/string.cpp idx = str1.find(target, 3);
find 427 uspace/lib/cpp/src/__bits/test/string.cpp idx = str1.find('B', 2);
find 441 uspace/lib/cpp/src/__bits/test/string.cpp idx = str2.find(target, 0);
find 447 uspace/lib/cpp/src/__bits/test/string.cpp idx = str2.find(target, 5);
find 185 uspace/lib/cpp/src/__bits/test/unordered_map.cpp map2.erase(map2.find(7));
find 186 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("erase", map2.find(7), map2.end());
find 260 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi erase keeps bucket intact", (mmap.find(8) != mmap.end()), true);
find 262 uspace/lib/cpp/src/__bits/test/unordered_map.cpp auto res7 = mmap.erase(mmap.find(7));
find 139 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res10 = set1.erase(set1.find(2));
find 140 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase", set1.find(2), set1.end());
find 170 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res16 = set3.find(15);
find 210 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res7 = mset.erase(mset.find(7));
find 113 uspace/srv/net/inetsrv/addrobj.c inet_addrobj_t *inet_addrobj_find(inet_addr_t *addr, inet_addrobj_find_t find)
find 118 uspace/srv/net/inetsrv/addrobj.c switch (find) {
HelenOS homepage, sources at GitHub