Searched defs:Comp (Results 1 - 25 of 26) sorted by relevance

12

/external/libcxx/test/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 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;
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());
/external/libcxx/test/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/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/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/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/clang/tools/libclang/
H A DBuildSystem.cpp51 StringRef Comp = *PI; local
52 if (Comp == "." || 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/llvm/lib/Support/
H A DTriple.cpp475 StringRef Comp = Components[Idx]; local
479 Arch = parseArch(Comp);
483 Vendor = parseVendor(Comp);
487 OS = parseOS(Comp);
491 Environment = parseEnvironment(Comp);
494 ObjectFormat = parseFormat(Comp);
549 assert(Pos < Components.size() && Components[Pos] == Comp &&
/external/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp215 ICmpInst* Comp = new ICmpInst(ICmpInst::ICMP_SLT, local
217 NewNode->getInstList().push_back(Comp);
218 BranchInst::Create(LBranch, RBranch, Comp, NewNode);
238 ICmpInst* Comp = nullptr; local
241 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val,
247 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
251 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High,
260 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound,
267 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/llvm/lib/Target/R600/
H A DSIISelLowering.cpp1579 unsigned Comp; local
1582 Comp = countTrailingZeros(Dmask);
1583 Dmask &= ~(1 << Comp);
1591 NewDmask |= 1 << Comp;
/external/llvm/utils/TableGen/
H A DCodeGenRegisters.cpp1080 CodeGenSubRegIndex *Comp = A->compose(B); local
1081 if (Comp)
1082 return Comp;
1086 Comp = createSubRegIndex(Name, A->getNamespace());
1087 A->addComposite(B, Comp);
1088 return Comp;
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp1016 APInt Comp = CmpRHSV << ShAmtVal; local
1017 ConstantInt *ShiftedCmpRHS = Builder->getInt(Comp);
1019 Comp = Comp.lshr(ShAmtVal);
1021 Comp = Comp.ashr(ShAmtVal);
1023 if (Comp != CmpRHSV) { // Comparing against a bit that we know is zero.
1442 Constant *Comp = local
1445 if (Comp != RHS) {// Comparing against a bit that we know is zero.
/external/clang/lib/AST/
H A DExpr.cpp3318 StringRef Comp = Accessor->getName(); local
3321 if (Comp == "hi" || Comp == "lo" || Comp == "even" || Comp == "odd")
3325 if (Comp[0] == 's' || Comp[0] == 'S')
3326 Comp = Comp.substr(1);
3328 for (unsigned i = 0, e = Comp
3338 StringRef Comp = Accessor->getName(); local
[all...]
/external/llvm/lib/Target/ARM/
H A DARMBaseInstrInfo.cpp1611 uint32_t Comp = Probability.getDenominator() - Probability.getNumerator(); local
1612 unsigned FUnpredCost = Comp * FCycles;
/external/llvm/lib/Target/Mips/
H A DMipsISelLowering.cpp3285 MipsTargetLowering::LTStr Comp; local
3289 assert(Comp(*I, *(I + 1)));
3292 return std::binary_search(LibCalls, End, CallSym, Comp);

Completed in 374 milliseconds

12