| /external/libcxx/test/std/containers/associative/map/map.cons/ |
| D | compare_copy_constructible.fail.cpp | 18 struct Comp { struct
21 Comp () {} in Comp() argument
23 Comp (const Comp &); // declared but not defined
28 std::map<int, int, Comp<int> > m; in main()
|
| /external/libcxx/test/std/containers/associative/set/set.cons/ |
| D | compare_copy_constructible.fail.cpp | 18 struct Comp { struct
21 Comp () {} in Comp() argument
23 Comp (const Comp &); // declared but not defined
28 std::set<int, Comp<int> > m; in main()
|
| /external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
| D | compare_copy_constructible.fail.cpp | 18 struct Comp { struct
21 Comp () {} in Comp() argument
23 Comp (const Comp &); // declared but not defined
28 std::multiset<int, Comp<int> > m; in main()
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| D | compare_copy_constructible.fail.cpp | 18 struct Comp { struct
21 Comp () {} in Comp() argument
23 Comp (const Comp &); // declared but not defined
28 std::multimap<int, int, Comp<int> > m; in main()
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| D | compare_copy_constructible.fail.cpp | 21 struct Comp { struct
24 Comp () {} in Comp() argument
26 Comp (const Comp &); // declared but not defined
31 std::unordered_map<int, int, std::hash<int>, Comp<int> > m; in main()
|
| D | allocator.pass.cpp | 92 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
93 typedef std::unordered_map<T, T, HF, Comp, A> C; in main()
99 assert(c.key_eq() == Comp()); in main()
111 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
112 typedef std::unordered_map<T, T, HF, Comp, A> C; in main()
120 assert(c.key_eq() == Comp()); in main()
|
| D | range.pass.cpp | 107 typedef test_compare<std::equal_to<int>> Comp; in main() typedef
108 typedef std::unordered_map<int, std::string, HF, Comp, A> C; in main()
127 assert(c.key_eq() == Comp()); in main()
139 typedef test_compare<std::equal_to<int>> Comp; in main() typedef
140 typedef std::unordered_map<int, std::string, HF, Comp, A> C; in main()
162 assert(c.key_eq() == Comp()); in main()
|
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| D | compare_copy_constructible.fail.cpp | 18 struct Comp { struct
21 Comp () {} in Comp() function
23 Comp (const Comp &); // declared but not defined
28 std::unordered_set<int, std::hash<int>, Comp<int> > m; in main()
|
| D | allocator.pass.cpp | 69 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
71 typedef std::unordered_set<T, HF, Comp, A> C; in main()
77 assert(c.key_eq() == Comp ()); in main()
89 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
91 typedef std::unordered_set<T, HF, Comp, A> C; in main()
99 assert(c.key_eq() == Comp ()); in main()
|
| D | init.pass.cpp | 97 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
99 typedef std::unordered_set<T, HF, Comp, A> C; in main()
118 assert(c.key_eq() == Comp()); in main()
130 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
132 typedef std::unordered_set<T, HF, Comp, A> C; in main()
153 assert(c.key_eq() == Comp()); in main()
|
| D | range.pass.cpp | 102 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
104 typedef std::unordered_set<T, HF, Comp, A> C; in main()
123 assert(c.key_eq() == Comp()); in main()
135 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
137 typedef std::unordered_set<T, HF, Comp, A> C; in main()
158 assert(c.key_eq() == Comp()); in main()
|
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| D | compare_copy_constructible.fail.cpp | 18 struct Comp { struct
21 Comp () {} in Comp() argument
23 Comp (const Comp &); // declared but not defined
28 std::unordered_multiset<int, std::hash<int>, Comp<int> > m; in main()
|
| D | allocator.pass.cpp | 69 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
71 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
77 assert(c.key_eq() == Comp ()); in main()
89 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
91 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
99 assert(c.key_eq() == Comp ()); in main()
|
| D | init.pass.cpp | 97 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
99 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
118 assert(c.key_eq() == Comp()); in main()
130 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
132 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
153 assert(c.key_eq() == Comp()); in main()
|
| D | range.pass.cpp | 102 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
104 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
123 assert(c.key_eq() == Comp()); in main()
135 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
137 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
158 assert(c.key_eq() == Comp()); in main()
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| D | compare_copy_constructible.fail.cpp | 21 struct Comp { struct
24 Comp () {} in Comp() argument
26 Comp (const Comp &); // declared but not defined
31 std::unordered_multimap<int, int, std::hash<int>, Comp<int> > m; in main()
|
| D | allocator.pass.cpp | 92 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
93 typedef std::unordered_multimap<T, T, HF, Comp, A> C; in main()
99 assert(c.key_eq() == Comp()); in main()
111 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
112 typedef std::unordered_multimap<T, T, HF, Comp, A> C; in main()
120 assert(c.key_eq() == Comp()); in main()
|
| D | init.pass.cpp | 145 typedef test_compare<std::equal_to<int>> Comp; in main() typedef
146 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; in main()
192 assert(c.key_eq() == Comp()); in main()
200 typedef test_compare<std::equal_to<int>> Comp; in main() typedef
201 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C; in main()
249 assert(c.key_eq() == Comp()); in main()
|
| /external/abi-compliance-checker/modules/Internals/ |
| D | SysCheck.pm | 529 foreach my $Comp ("Binary", "Source")
531 if(not defined $TestResults{$LName}{$Comp}) {
534 foreach my $Kind (keys(%{$TestResults{$LName}{$Comp}}))
537 $TOTAL{$LName}{$Comp} += $TestResults{$LName}{$Comp}{$Kind};
545 foreach my $Comp ("Binary", "Source")
547 $STAT{$Comp}{"total"} = keys(%TestResults) - keys(%SONAME_Changed);
548 $STAT{$Comp}{"added"} = keys(%Added);
549 $STAT{$Comp}{"removed"} = keys(%Removed);
557 $STAT{$Comp}{$Kind} += $TestResults{$LName}{$Comp}{$_};
559 push(@{$META_DATA{$Comp}}, $Kind.":".$STAT{$Comp}{$Kind});
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 162 ICmpInst* Comp = new ICmpInst(ICmpInst::ICMP_SLT, in switchConvert() local
164 NewNode->getInstList().push_back(Comp); in switchConvert()
165 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in switchConvert()
185 ICmpInst* Comp = NULL; in newLeafBlock() local
188 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val, in newLeafBlock()
194 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in newLeafBlock()
198 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in newLeafBlock()
207 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound, in newLeafBlock()
214 BranchInst::Create(Succ, Default, Comp, NewLeaf); in newLeafBlock()
|
| /external/llvm/include/llvm/LineEditor/ |
| D | LineEditor.h | 85 template <typename T> void setCompleter(T Comp) { in setCompleter() argument
86 Completer.reset(new CompleterModel<T>(Comp)); in setCompleter()
93 template <typename T> void setListCompleter(T Comp) { in setListCompleter() argument
94 Completer.reset(new ListCompleterModel<T>(Comp)); in setListCompleter()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 274 ICmpInst* Comp = new ICmpInst(ICmpInst::ICMP_SLT, in switchConvert() local
285 NewNode->getInstList().push_back(Comp); in switchConvert()
287 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in switchConvert()
304 ICmpInst* Comp = nullptr; in newLeafBlock() local
307 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val, in newLeafBlock()
313 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in newLeafBlock()
317 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in newLeafBlock()
326 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound, in newLeafBlock()
333 BranchInst::Create(Succ, Default, Comp, NewLeaf); in newLeafBlock()
|
| /external/clang/tools/libclang/ |
| D | BuildSystem.cpp | 51 StringRef Comp = *PI; in clang_VirtualFileOverlay_addFileMapping() local
52 if (Comp == "." || Comp == "..") in clang_VirtualFileOverlay_addFileMapping()
|
| /external/clang/lib/Lex/ |
| D | PPConditionalDirectiveRecord.cpp | 31 Range.getBegin(), CondDirectiveLoc::Comp(SourceMgr)); in rangeIntersectsConditionalDirective()
40 Range.getEnd(), CondDirectiveLoc::Comp(SourceMgr)); in rangeIntersectsConditionalDirective()
61 Loc, CondDirectiveLoc::Comp(SourceMgr)); in findConditionalDirectiveRegionLoc()
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsCCState.cpp | 33 auto Comp = [](const char *S1, const char *S2) { return strcmp(S1, S2) < 0; }; in isF128SoftLibCall() local
34 assert(std::is_sorted(std::begin(LibCalls), std::end(LibCalls), Comp)); in isF128SoftLibCall()
36 CallSym, Comp); in isF128SoftLibCall()
|