Searched refs:Comp (Results 1 - 25 of 32) sorted by relevance

12

/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/
H A Dallocator.pass.cpp73 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
93 typedef std::unordered_map<T, T, HF, Comp, A> C;
101 assert(c.key_eq() == Comp());
H A Drange.pass.cpp105 typedef test_compare<std::equal_to<int>> Comp; typedef
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; typedef
138 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
160 assert(c.key_eq() == Comp());
H A Dinit.pass.cpp99 typedef test_compare<std::equal_to<int>> Comp; typedef
100 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
130 typedef test_compare<std::equal_to<int>> Comp; typedef
131 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/
H A Dallocator.pass.cpp73 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
93 typedef std::unordered_multimap<T, T, HF, Comp, A> C;
101 assert(c.key_eq() == Comp());
H A Dinit.pass.cpp143 typedef test_compare<std::equal_to<int>> Comp; typedef
144 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C;
190 assert(c.key_eq() == Comp());
198 typedef test_compare<std::equal_to<int>> Comp; typedef
199 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C;
247 assert(c.key_eq() == Comp());
H A Drange.pass.cpp149 typedef test_compare<std::equal_to<int>> Comp; typedef
150 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C;
198 assert(c.key_eq() == Comp());
206 typedef test_compare<std::equal_to<int>> Comp; typedef
207 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C;
257 assert(c.key_eq() == Comp());
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/
H A Dallocator.pass.cpp68 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
90 typedef std::unordered_multiset<T, HF, Comp, A> C;
98 assert(c.key_eq() == Comp ());
H A Dinit.pass.cpp95 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
130 typedef std::unordered_multiset<T, HF, Comp, A> C;
151 assert(c.key_eq() == Comp());
H A Drange.pass.cpp100 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
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/
H A Dallocator.pass.cpp68 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
90 typedef std::unordered_set<T, HF, Comp, A> C;
98 assert(c.key_eq() == Comp ());
H A Dinit.pass.cpp95 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
130 typedef std::unordered_set<T, HF, Comp, A> C;
151 assert(c.key_eq() == Comp());
H A Drange.pass.cpp100 typedef test_compare<std::equal_to<T>> Comp; typedef
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; typedef
135 typedef std::unordered_set<T, HF, Comp, A> C;
156 assert(c.key_eq() == Comp());
/external/llvm/include/llvm/LineEditor/
H A DLineEditor.h84 template <typename T> void setCompleter(T Comp) { argument
85 Completer.reset(new CompleterModel<T>(Comp));
92 template <typename T> void setListCompleter(T Comp) { argument
93 Completer.reset(new ListCompleterModel<T>(Comp));
/external/clang/lib/Lex/
H A DPPConditionalDirectiveRecord.cpp31 Range.getBegin(), CondDirectiveLoc::Comp(SourceMgr));
40 Range.getEnd(), CondDirectiveLoc::Comp(SourceMgr));
61 Loc, CondDirectiveLoc::Comp(SourceMgr));
/external/clang/tools/libclang/
H A DBuildSystem.cpp51 StringRef Comp = *PI; local
52 if (Comp == "." || Comp == "..")
/external/clang/include/clang/Lex/
H A DPPConditionalDirectiveRecord.h42 class Comp { class in class:clang::PPConditionalDirectiveRecord::CondDirectiveLoc
45 explicit Comp(SourceManager &SM) : SM(SM) {} function in class:clang::PPConditionalDirectiveRecord::CondDirectiveLoc::Comp
/external/clang/test/SemaTemplate/
H A Dinstantiate-template-template-parm.cpp49 struct Comp { struct
61 Comp<int, lt> c0;
/external/llvm/lib/Target/Mips/
H A DMipsCCState.cpp33 auto Comp = [](const char *S1, const char *S2) { return strcmp(S1, S2) < 0; }; local
34 assert(std::is_sorted(std::begin(LibCalls), std::end(LibCalls), Comp)); local
36 CallSym, Comp);
/external/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp280 ICmpInst* Comp = new ICmpInst(ICmpInst::ICMP_SLT, local
291 NewNode->getInstList().push_back(Comp);
293 BranchInst::Create(LBranch, RBranch, Comp, NewNode);
310 ICmpInst* Comp = nullptr; local
313 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val,
319 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
323 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High,
332 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound,
339 BranchInst::Create(Succ, Default, Comp, NewLeaf);
/external/clang/test/SemaCXX/
H A Dnew-delete.cpp165 class Comp : public Tier {}; class in inherits:Tier
173 const Comp *dict;
/external/ppp/pppd/plugins/radius/etc/
H A Ddictionary.ascend104 ATTRIBUTE Ascend-PPP-VJ-Slot-Comp 210 integer
197 VALUE Ascend-Link-Compression Link-Comp-None 0
198 VALUE Ascend-Link-Compression Link-Comp-Stac 1
199 VALUE Ascend-Link-Compression Link-Comp-Stac-Draft-9 2
200 VALUE Ascend-Link-Compression Link-Comp-MS-Stac 3
259 VALUE Ascend-PPP-VJ-Slot-Comp VJ-Slot-Comp-No 1
/external/llvm/lib/Support/
H A DTriple.cpp717 StringRef Comp = Components[Idx]; local
721 Arch = parseArch(Comp);
725 Vendor = parseVendor(Comp);
729 OS = parseOS(Comp);
730 IsCygwin = Comp.startswith("cygwin");
731 IsMinGW32 = Comp.startswith("mingw");
735 Environment = parseEnvironment(Comp);
738 ObjectFormat = parseFormat(Comp);
793 assert(Pos < Components.size() && Components[Pos] == Comp &&
/external/clang/lib/AST/
H A DExpr.cpp3518 StringRef Comp = Accessor->getName(); local
3521 if (Comp == "hi" || Comp == "lo" || Comp == "even" || Comp == "odd")
3525 if (Comp[0] == 's' || Comp[0] == 'S')
3526 Comp = Comp.substr(1);
3528 for (unsigned i = 0, e = Comp
3538 StringRef Comp = Accessor->getName(); local
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachineFunction.h395 template <typename Comp>
396 void sort(Comp comp) {
/external/llvm/utils/TableGen/
H A DCodeGenRegisters.cpp1075 CodeGenSubRegIndex *Comp = A->compose(B); local
1076 if (Comp)
1077 return Comp;
1081 Comp = createSubRegIndex(Name, A->getNamespace());
1082 A->addComposite(B, Comp);
1083 return Comp;

Completed in 459 milliseconds

12