| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
33 typedef std::unordered_set<int> C;
52 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
59 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| load_factor.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
27 typedef std::unordered_set<int> C;
44 typedef std::unordered_set<int> C;
51 typedef std::unordered_set<int, std::hash<int>,
69 typedef std::unordered_set<int, std::hash<int>,
|
| clear.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
43 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| erase_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| max_bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
32 typedef std::unordered_set<int, std::hash<int>,
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| clear.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
43 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| erase_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| max_bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
32 typedef std::unordered_set<int, std::hash<int>,
|
| bucket.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
22 #include <unordered_set>
30 typedef std::unordered_set<int> C;
49 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
69 typedef std::unordered_set<int> C;
|
| bucket_size.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
22 #include <unordered_set>
30 typedef std::unordered_set<int> C;
51 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
73 typedef std::unordered_set<int> C;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ |
| unordered_set | 0 // <unordered_set> -*- C++ -*-
25 /** @file include/unordered_set
48 #include <bits/unordered_set.h>
52 # include <debug/unordered_set>
56 # include <profile/unordered_set>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ |
| unordered_set | 0 // <unordered_set> -*- C++ -*-
25 /** @file include/unordered_set
48 #include <bits/unordered_set.h>
52 # include <debug/unordered_set>
56 # include <profile/unordered_set>
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ |
| unordered_set | 0 // <unordered_set> -*- C++ -*-
25 /** @file include/unordered_set
48 #include <bits/unordered_set.h>
52 # include <debug/unordered_set>
56 # include <profile/unordered_set>
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ |
| unordered_set | 0 // <unordered_set> -*- C++ -*-
25 /** @file include/unordered_set
48 #include <bits/unordered_set.h>
52 # include <debug/unordered_set>
56 # include <profile/unordered_set>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/ |
| unordered_set | 1 // Profiling unordered_set/unordered_multiset implementation -*- C++ -*-
24 /** @file profile/unordered_set
34 # include <unordered_set>
39 #define _GLIBCXX_BASE unordered_set<_Key, _Hash, _Pred, _Alloc>
46 /** @brief Unordered_set wrapper with performance instrumentation. */
51 class unordered_set
53 public _Unordered_profile<unordered_set<_Key, _Hash, _Pred, _Alloc>,
79 unordered_set(size_type __n = 10,
87 unordered_set(_InputIterator __f, _InputIterator __l,
95 unordered_set(const unordered_set&) = default
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/ |
| unordered_set | 1 // Profiling unordered_set/unordered_multiset implementation -*- C++ -*-
24 /** @file profile/unordered_set
34 # include <unordered_set>
39 #define _GLIBCXX_BASE unordered_set<_Key, _Hash, _Pred, _Alloc>
46 /** @brief Unordered_set wrapper with performance instrumentation. */
51 class unordered_set
53 public _Unordered_profile<unordered_set<_Key, _Hash, _Pred, _Alloc>,
79 unordered_set(size_type __n = 10,
87 unordered_set(_InputIterator __f, _InputIterator __l,
95 unordered_set(const unordered_set&) = default
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/ |
| unordered_set | 1 // Profiling unordered_set/unordered_multiset implementation -*- C++ -*-
24 /** @file profile/unordered_set
34 # include <unordered_set>
39 #define _GLIBCXX_BASE unordered_set<_Key, _Hash, _Pred, _Alloc>
46 /** @brief Unordered_set wrapper with performance instrumentation. */
51 class unordered_set
53 public _Unordered_profile<unordered_set<_Key, _Hash, _Pred, _Alloc>,
79 unordered_set(size_type __n = 10,
87 unordered_set(_InputIterator __f, _InputIterator __l,
95 unordered_set(const unordered_set&) = default
[all...] |
| /system/extras/simpleperf/ |
| sample_tree.h | 25 #include <unordered_set>
88 void SetFilters(const std::unordered_set<int>& pid_filter,
89 const std::unordered_set<int>& tid_filter,
90 const std::unordered_set<std::string>& comm_filter,
91 const std::unordered_set<std::string>& dso_filter);
153 std::unordered_set<int> pid_filter_;
154 std::unordered_set<int> tid_filter_;
155 std::unordered_set<std::string> comm_filter_;
156 std::unordered_set<std::string> dso_filter_;
|
| /external/google-breakpad/src/common/ |
| unordered.h | 30 // Include this file to use unordered_map and unordered_set. If tr1
47 struct unordered_set : public hash_set<T, H> {}; struct in inherits:hash_set
51 #include <unordered_set>
53 using std::unordered_set;
57 #include <tr1/unordered_set>
59 using std::tr1::unordered_set;
|
