HomeSort by relevance Sort by last modified time
    Searched full:unordered_map (Results 26 - 50 of 686) sorted by null

12 3 4 5 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/
max_size.pass.cpp 10 // <unordered_map>
14 // class unordered_map
18 #include <unordered_map>
26 std::unordered_map<int, int> u;
31 std::unordered_map<int, int, std::hash<int>, std::equal_to<int>,
max_load_factor.pass.cpp 10 // <unordered_map>
14 // class unordered_map
23 #include <unordered_map>
32 typedef std::unordered_map<int, std::string> C;
38 typedef std::unordered_map<int, std::string> C;
47 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
54 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
65 typedef std::unordered_map<int, std::string> C;
db_iterators_8.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
30 typedef std::unordered_map<int, std::string> C;
39 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
db_local_iterators_7.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
30 typedef std::unordered_map<int, std::string> C;
39 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
db_local_iterators_8.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
30 typedef std::unordered_map<int, std::string> C;
38 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/
erase_iter_db2.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::const_iterator i = l2.begin();
erase_iter_iter_db1.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
erase_iter_iter_db2.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
erase_iter_iter_db3.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/
unordered_map 0 // <unordered_map> -*- C++ -*-
25 /** @file include/unordered_map
48 #include <bits/unordered_map.h>
52 # include <debug/unordered_map>
56 # include <profile/unordered_map>
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/
unordered_map 0 // <unordered_map> -*- C++ -*-
25 /** @file include/unordered_map
48 #include <bits/unordered_map.h>
52 # include <debug/unordered_map>
56 # include <profile/unordered_map>
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/
unordered_map 0 // <unordered_map> -*- C++ -*-
25 /** @file include/unordered_map
48 #include <bits/unordered_map.h>
52 # include <debug/unordered_map>
56 # include <profile/unordered_map>
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/
unordered_map 0 // <unordered_map> -*- C++ -*-
25 /** @file include/unordered_map
48 #include <bits/unordered_map.h>
52 # include <debug/unordered_map>
56 # include <profile/unordered_map>
  /external/libcxx/include/
unordered_map 2 //===-------------------------- unordered_map -----------------------------===//
16 unordered_map synopsis
25 class unordered_map
47 unordered_map()
52 explicit unordered_map(size_type n, const hasher& hf = hasher(),
56 unordered_map(InputIterator f, InputIterator l,
60 explicit unordered_map(const allocator_type&);
61 unordered_map(const unordered_map&);
62 unordered_map(const unordered_map&, const Allocator&)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
unordered_map 2 //===-------------------------- unordered_map -----------------------------===//
16 unordered_map synopsis
25 class unordered_map
47 unordered_map()
52 explicit unordered_map(size_type n, const hasher& hf = hasher(),
56 unordered_map(InputIterator f, InputIterator l,
60 explicit unordered_map(const allocator_type&);
61 unordered_map(const unordered_map&);
62 unordered_map(const unordered_map&, const Allocator&)
    [all...]
  /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/
unordered_map 2 //===-------------------------- unordered_map -----------------------------===//
16 unordered_map synopsis
25 class unordered_map
47 unordered_map()
52 explicit unordered_map(size_type n, const hasher& hf = hasher(),
56 unordered_map(InputIterator f, InputIterator l,
60 explicit unordered_map(const allocator_type&);
61 unordered_map(const unordered_map&);
62 unordered_map(const unordered_map&, const Allocator&)
    [all...]
  /external/google-breakpad/src/common/
unordered.h 30 // Include this file to use unordered_map and unordered_set. If tr1
45 struct unordered_map : public hash_map<T, U, H> {}; struct in inherits:hash_map
50 #include <unordered_map>
52 using std::unordered_map;
56 #include <tr1/unordered_map>
58 using std::tr1::unordered_map;
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
unordered_map 1 // Profiling unordered_map/unordered_multimap implementation -*- C++ -*-
24 /** @file profile/unordered_map
34 # include <unordered_map>
39 #define _GLIBCXX_BASE unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>
46 /// Class std::unordered_map wrapper with performance instrumentation.
51 class unordered_map
53 public _Unordered_profile<unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>,
80 unordered_map(size_type __n = 10,
88 unordered_map(_InputIterator __f, _InputIterator __l,
96 unordered_map(const unordered_map&) = default
    [all...]
  /external/libcxx/test/std/containers/unord/unord.map/
compare.pass.cpp 10 // <unordered_map>
14 // class unordered_map
19 #include <unordered_map>
39 typedef std::unordered_map<Key, int> MapT;
db_iterators_8.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
30 typedef std::unordered_map<int, std::string> C;
39 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
db_local_iterators_7.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
30 typedef std::unordered_map<int, std::string> C;
39 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
db_local_iterators_8.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
30 typedef std::unordered_map<int, std::string> C;
38 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
  /external/libcxx/test/std/containers/unord/unord.map/unord.map.elem/
index_tuple.pass.cpp 10 // <unordered_map>
14 // class unordered_map
20 #include <unordered_map>
38 unordered_map<tuple<int,int>, size_t, my_hash> m;
  /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/
erase_iter_db1.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
26 std::unordered_map<int, int> l1(a1, a1+3);
27 std::unordered_map<int, int>::const_iterator i = l1.end();
erase_iter_iter_db4.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());

Completed in 591 milliseconds

12 3 4 5 6 7 8 91011>>