OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:unordered_set
(Results
1 - 25
of
837
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/libcxx/test/std/containers/unord/unord.set/
insert_and_emplace_allocator_requirements.pass.cpp
10
// <
unordered_set
>
12
// class
unordered_set
19
#include <
unordered_set
>
27
testSetInsert<TCT::
unordered_set
<> >();
28
testSetEmplace<TCT::
unordered_set
<> >();
allocator_mismatch.fail.cpp
10
// <
unordered_set
>
13
#include <
unordered_set
>
17
std::
unordered_set
<int, std::hash<int>, std::less<int>, std::allocator<long> > v;
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()));
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/
insert_and_emplace_allocator_requirements.pass.cpp
10
// <
unordered_set
>
12
// class
unordered_set
19
#include <
unordered_set
>
27
testSetInsert<TCT::
unordered_set
<> >();
28
testSetEmplace<TCT::
unordered_set
<> >();
allocator_mismatch.fail.cpp
10
// <
unordered_set
>
13
#include <
unordered_set
>
17
std::
unordered_set
<int, std::hash<int>, std::less<int>, std::allocator<long> > v;
version.pass.cpp
10
// <
unordered_set
>
12
#include <
unordered_set
>
/external/libcxx/test/std/containers/unord/unord.multiset/
insert_allocator_requirements.pass.cpp
10
// <
unordered_set
>
18
#include <
unordered_set
>
scary.pass.cpp
10
// <
unordered_set
>
12
// class
unordered_set
class unordered_multiset
14
// Extension: SCARY/N2913 iterator compatibility between
unordered_set
and unordered_multiset
16
#include <
unordered_set
>
20
typedef std::
unordered_set
<int> M1;
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/
insert_allocator_requirements.pass.cpp
10
// <
unordered_set
>
18
#include <
unordered_set
>
scary.pass.cpp
10
// <
unordered_set
>
12
// class
unordered_set
class unordered_multiset
14
// Extension: SCARY/N2913 iterator compatibility between
unordered_set
and unordered_multiset
16
#include <
unordered_set
>
20
typedef std::
unordered_set
<int> M1;
/external/libcxx/test/libcxx/containers/unord/unord.set/
version.pass.cpp
10
// <
unordered_set
>
12
#include <
unordered_set
>
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/
version.pass.cpp
10
// <
unordered_set
>
12
#include <
unordered_set
>
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()));
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/
compare_copy_constructible.fail.cpp
10
// <
unordered_set
>
12
// Check that std::
unordered_set
fails to instantiate if the comparison predicate is
15
#include <
unordered_set
>
28
std::
unordered_set
<int, std::hash<int>, Comp<int> > m;
hash_copy_constructible.fail.cpp
12
// Check that std::
unordered_set
fails to instantiate if the hash function is
15
#include <
unordered_set
>
28
std::
unordered_set
<int, Hash<int> > m;
/frameworks/minikin/libs/minikin/
FontUtils.h
20
#include <
unordered_set
>
25
void analyzeAxes(const uint8_t* fvar_data, size_t fvar_size, std::
unordered_set
<uint32_t>* axes);
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/
scary.pass.cpp
10
// <
unordered_set
>
12
// class
unordered_set
class unordered_multiset
14
// Extension: SCARY/N2913 iterator compatibility between
unordered_set
and unordered_multiset
16
#include <
unordered_set
>
20
typedef std::
unordered_set
<int> M1;
/external/libcxx/test/libcxx/experimental/memory/memory.resource.aliases/
header_unordered_set_libcpp_version.pass.cpp
12
// <experimental/
unordered_set
>
14
#include <experimental/
unordered_set
>
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/experimental/memory/memory.resource.aliases/
header_unordered_set_libcpp_version.pass.cpp
12
// <experimental/
unordered_set
>
14
#include <experimental/
unordered_set
>
Completed in 1593 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>