/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
allocator.pass.cpp | 73 typedef test_compare<std::equal_to<T>> Comp; 74 typedef std::unordered_map<T, T, HF, Comp, A> C; 80 assert(c.key_eq() == Comp()); 92 typedef test_compare<std::equal_to<T>> Comp; 93 typedef std::unordered_map<T, T, HF, Comp, A> C; 101 assert(c.key_eq() == Comp());
|
range.pass.cpp | 105 typedef test_compare<std::equal_to<int>> Comp; 106 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 125 assert(c.key_eq() == Comp()); 137 typedef test_compare<std::equal_to<int>> Comp; 138 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 160 assert(c.key_eq() == Comp());
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
allocator.pass.cpp | 73 typedef test_compare<std::equal_to<T>> Comp; 74 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 80 assert(c.key_eq() == Comp()); 92 typedef test_compare<std::equal_to<T>> Comp; 93 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 101 assert(c.key_eq() == Comp());
|
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
allocator.pass.cpp | 68 typedef test_compare<std::equal_to<T>> Comp; 70 typedef std::unordered_multiset<T, HF, Comp, A> C; 76 assert(c.key_eq() == Comp ()); 88 typedef test_compare<std::equal_to<T>> Comp; 90 typedef std::unordered_multiset<T, HF, Comp, A> C; 98 assert(c.key_eq() == Comp ());
|
init.pass.cpp | 95 typedef test_compare<std::equal_to<T>> Comp; 97 typedef std::unordered_multiset<T, HF, Comp, A> C; 116 assert(c.key_eq() == Comp()); 128 typedef test_compare<std::equal_to<T>> Comp; 130 typedef std::unordered_multiset<T, HF, Comp, A> C; 151 assert(c.key_eq() == Comp());
|
range.pass.cpp | 100 typedef test_compare<std::equal_to<T>> Comp; 102 typedef std::unordered_multiset<T, HF, Comp, A> C; 121 assert(c.key_eq() == Comp()); 133 typedef test_compare<std::equal_to<T>> Comp; 135 typedef std::unordered_multiset<T, HF, Comp, A> C; 156 assert(c.key_eq() == Comp());
|
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
allocator.pass.cpp | 68 typedef test_compare<std::equal_to<T>> Comp; 70 typedef std::unordered_set<T, HF, Comp, A> C; 76 assert(c.key_eq() == Comp ()); 88 typedef test_compare<std::equal_to<T>> Comp; 90 typedef std::unordered_set<T, HF, Comp, A> C; 98 assert(c.key_eq() == Comp ());
|
init.pass.cpp | 95 typedef test_compare<std::equal_to<T>> Comp; 97 typedef std::unordered_set<T, HF, Comp, A> C; 116 assert(c.key_eq() == Comp()); 128 typedef test_compare<std::equal_to<T>> Comp; 130 typedef std::unordered_set<T, HF, Comp, A> C; 151 assert(c.key_eq() == Comp());
|
range.pass.cpp | 100 typedef test_compare<std::equal_to<T>> Comp; 102 typedef std::unordered_set<T, HF, Comp, A> C; 121 assert(c.key_eq() == Comp()); 133 typedef test_compare<std::equal_to<T>> Comp; 135 typedef std::unordered_set<T, HF, Comp, A> C; 156 assert(c.key_eq() == Comp());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
allocator.pass.cpp | 73 typedef test_compare<std::equal_to<T>> Comp; 74 typedef std::unordered_map<T, T, HF, Comp, A> C; 80 assert(c.key_eq() == Comp()); 92 typedef test_compare<std::equal_to<T>> Comp; 93 typedef std::unordered_map<T, T, HF, Comp, A> C; 101 assert(c.key_eq() == Comp());
|
range.pass.cpp | 105 typedef test_compare<std::equal_to<int>> Comp; 106 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 125 assert(c.key_eq() == Comp()); 137 typedef test_compare<std::equal_to<int>> Comp; 138 typedef std::unordered_map<int, std::string, HF, Comp, A> C; 160 assert(c.key_eq() == Comp());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
allocator.pass.cpp | 73 typedef test_compare<std::equal_to<T>> Comp; 74 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 80 assert(c.key_eq() == Comp()); 92 typedef test_compare<std::equal_to<T>> Comp; 93 typedef std::unordered_multimap<T, T, HF, Comp, A> C; 101 assert(c.key_eq() == Comp());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
allocator.pass.cpp | 68 typedef test_compare<std::equal_to<T>> Comp; 70 typedef std::unordered_multiset<T, HF, Comp, A> C; 76 assert(c.key_eq() == Comp ()); 88 typedef test_compare<std::equal_to<T>> Comp; 90 typedef std::unordered_multiset<T, HF, Comp, A> C; 98 assert(c.key_eq() == Comp ());
|
init.pass.cpp | 95 typedef test_compare<std::equal_to<T>> Comp; 97 typedef std::unordered_multiset<T, HF, Comp, A> C; 116 assert(c.key_eq() == Comp()); 128 typedef test_compare<std::equal_to<T>> Comp; 130 typedef std::unordered_multiset<T, HF, Comp, A> C; 151 assert(c.key_eq() == Comp());
|
range.pass.cpp | 100 typedef test_compare<std::equal_to<T>> Comp; 102 typedef std::unordered_multiset<T, HF, Comp, A> C; 121 assert(c.key_eq() == Comp()); 133 typedef test_compare<std::equal_to<T>> Comp; 135 typedef std::unordered_multiset<T, HF, Comp, A> C; 156 assert(c.key_eq() == Comp());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
allocator.pass.cpp | 68 typedef test_compare<std::equal_to<T>> Comp; 70 typedef std::unordered_set<T, HF, Comp, A> C; 76 assert(c.key_eq() == Comp ()); 88 typedef test_compare<std::equal_to<T>> Comp; 90 typedef std::unordered_set<T, HF, Comp, A> C; 98 assert(c.key_eq() == Comp ());
|
init.pass.cpp | 95 typedef test_compare<std::equal_to<T>> Comp; 97 typedef std::unordered_set<T, HF, Comp, A> C; 116 assert(c.key_eq() == Comp()); 128 typedef test_compare<std::equal_to<T>> Comp; 130 typedef std::unordered_set<T, HF, Comp, A> C; 151 assert(c.key_eq() == Comp());
|
range.pass.cpp | 100 typedef test_compare<std::equal_to<T>> Comp; 102 typedef std::unordered_set<T, HF, Comp, A> C; 121 assert(c.key_eq() == Comp()); 133 typedef test_compare<std::equal_to<T>> Comp; 135 typedef std::unordered_set<T, HF, Comp, A> C; 156 assert(c.key_eq() == Comp());
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/ |
finder.hpp | 46 \param Comp An element comparison predicate 71 const RangeT& Search, PredicateT Comp ) 77 PredicateT>( ::boost::as_literal(Search), Comp ); 87 \param Comp An element comparison predicate 110 last_finder( const RangeT& Search, PredicateT Comp ) 116 PredicateT>( ::boost::as_literal(Search), Comp ) ; 127 \param Comp An element comparison predicate 155 PredicateT Comp ) 161 PredicateT>( ::boost::as_literal(Search), Nth, Comp );
|
/external/llvm/include/llvm/LineEditor/ |
LineEditor.h | 84 template <typename T> void setCompleter(T Comp) { 85 Completer.reset(new CompleterModel<T>(Comp)); 92 template <typename T> void setListCompleter(T Comp) { 93 Completer.reset(new ListCompleterModel<T>(Comp));
|
/external/clang/lib/Lex/ |
PPConditionalDirectiveRecord.cpp | 31 Range.getBegin(), CondDirectiveLoc::Comp(SourceMgr)); 40 Range.getEnd(), CondDirectiveLoc::Comp(SourceMgr)); 61 Loc, CondDirectiveLoc::Comp(SourceMgr));
|
/external/clang/tools/libclang/ |
BuildSystem.cpp | 51 StringRef Comp = *PI; 52 if (Comp == "." || Comp == "..")
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/ |
finder.hpp | 43 first_finderF( const SearchT& Search, PredicateT Comp ) : 44 m_Search(::boost::begin(Search), ::boost::end(Search)), m_Comp(Comp) {} 48 PredicateT Comp ) : 49 m_Search(SearchBegin, SearchEnd), m_Comp(Comp) {} 110 last_finderF( const SearchT& Search, PredicateT Comp ) : 111 m_Search(::boost::begin(Search), ::boost::end(Search)), m_Comp(Comp) {} 115 PredicateT Comp ) : 116 m_Search(SearchBegin, SearchEnd), m_Comp(Comp) {} 226 PredicateT Comp) : 229 m_Comp(Comp) {} [all...] |
/external/clang/include/clang/Lex/ |
PPConditionalDirectiveRecord.h | 42 class Comp { 45 explicit Comp(SourceManager &SM) : SM(SM) {}
|
/external/clang/test/SemaTemplate/ |
instantiate-template-template-parm.cpp | 49 struct Comp { 61 Comp<int, lt> c0;
|