| /external/google-fruit/include/fruit/impl/ |
| D | component_functors.defn.h | 55 template <typename Comp>
57 using type = F(Comp, Args...);
64 template <typename Comp>
67 using Result = Comp;
80 template <typename Comp>
82 using Op1 = F1(Comp);
138 template <typename Comp, typename AnnotatedI, typename AnnotatedC>
140 … using Comp1 = ConsComp(typename Comp::RsSuperset, typename Comp::Ps, typename Comp::NonConstRsPs,
142 typename Comp::Deps,
144 … PushFront(typename Comp::InterfaceBindings, Pair<AnnotatedI, AnnotatedC>),
[all …]
|
| D | injector.defn.h | 48 template <typename NormalizedComp, typename Comp>
50 using Op = InstallComponent(Comp, NormalizedComp);
59 Not(IsEmptySet(GetComponentRsSuperset(Comp))),
61 SetToVector(GetComponentRsSuperset(Comp))),
78 using Comp = ConstructComponentImpl(Type<P>...); member
81 If(Not(IsInSet(NormalizeType(Type<T>), GetComponentPs(Comp))),
84 … Not(IsInSet(NormalizeType(Type<T>), GetComponentNonConstRsPs(Comp)))),
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
| D | Parallel.h | 87 const Comparator &Comp) { in parallel_sort() argument
88 concurrency::parallel_sort(Start, End, Comp); in parallel_sort()
107 const Comparator &Comp) { in medianOf3() argument
109 return Comp(*Start, *(End - 1)) in medianOf3()
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start) in medianOf3()
112 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1) in medianOf3()
118 const Comparator &Comp, TaskGroup &TG, size_t Depth) { in parallel_quick_sort() argument
121 llvm::sort(Start, End, Comp); in parallel_quick_sort()
126 auto Pivot = medianOf3(Start, End, Comp); in parallel_quick_sort()
129 Pivot = std::partition(Start, End - 1, [&Comp, End](decltype(*Start) V) { in parallel_quick_sort()
[all …]
|
| /external/google-fruit/include/fruit/impl/meta/ |
| D | component.h | 527 struct Comp {
568 using type = Comp<RsSupersetParam, PsParam, NonConstRsPsParam,
577 template <typename Comp>
579 using type = typename Comp::Deps;
584 template <typename Comp>
586 using type = typename Comp::Ps;
591 template <typename Comp>
593 using type = typename Comp::RsSuperset;
598 template <typename Comp>
600 using type = typename Comp::NonConstRsPs;
[all …]
|
| /external/walt/hardware/kicad/ |
| D | WALTsm.sch | 42 Comp ""
48 $Comp
59 $Comp
70 $Comp
81 $Comp
102 $Comp
113 $Comp
124 $Comp
135 $Comp
146 $Comp
[all …]
|
| /external/libcxx/test/std/containers/associative/set/set.cons/ |
| 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::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/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/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 | 108 typedef test_compare<std::equal_to<int>> Comp; in main() typedef
109 typedef std::unordered_map<int, std::string, HF, Comp, A> C; in main()
128 assert(c.key_eq() == Comp()); in main()
140 typedef test_compare<std::equal_to<int>> Comp; in main() typedef
141 typedef std::unordered_map<int, std::string, HF, Comp, A> C; in main()
163 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() function
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()
|
| /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() function
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 | 98 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
100 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
119 assert(c.key_eq() == Comp()); in main()
131 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
133 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
154 assert(c.key_eq() == Comp()); in main()
|
| D | range.pass.cpp | 103 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
105 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
124 assert(c.key_eq() == Comp()); in main()
136 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
138 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
159 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() argument
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 | 98 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
100 typedef std::unordered_set<T, HF, Comp, A> C; in main()
119 assert(c.key_eq() == Comp()); in main()
131 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
133 typedef std::unordered_set<T, HF, Comp, A> C; in main()
154 assert(c.key_eq() == Comp()); in main()
|
| D | range.pass.cpp | 103 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
105 typedef std::unordered_set<T, HF, Comp, A> C; in main()
124 assert(c.key_eq() == Comp()); in main()
136 typedef test_compare<std::equal_to<T>> Comp; in main() typedef
138 typedef std::unordered_set<T, HF, Comp, A> C; in main()
159 assert(c.key_eq() == Comp()); in main()
|
| /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/mesa3d/src/gallium/drivers/swr/rasterizer/common/ |
| D | simdintrin.h | 266 template<UINT Attrib, UINT Comp, UINT numComponents = 4>
269 const float *pInterpA = &pInterpBuffer[Attrib * 3 * numComponents + 0 + Comp]; in InterpolateComponent()
270 const float *pInterpB = &pInterpBuffer[Attrib * 3 * numComponents + numComponents + Comp]; in InterpolateComponent()
271 const float *pInterpC = &pInterpBuffer[Attrib * 3 * numComponents + numComponents * 2 + Comp]; in InterpolateComponent()
286 template<UINT Attrib, UINT Comp, UINT numComponents = 4>
289 const float *pInterpA = &pInterpBuffer[Attrib * 3 * numComponents + 0 + Comp]; in InterpolateComponentFlat()
301 template<UINT Attrib, UINT Comp, UINT numComponents = 4>
304 const float *pInterpA = &pInterpBuffer[Attrib * 3 * numComponents + 0 + Comp]; in InterpolateComponent()
305 const float *pInterpB = &pInterpBuffer[Attrib * 3 * numComponents + numComponents + Comp]; in InterpolateComponent()
306 const float *pInterpC = &pInterpBuffer[Attrib * 3 * numComponents + numComponents * 2 + Comp]; in InterpolateComponent()
|
| /external/google-fruit/include/fruit/ |
| D | injector.h | 228 …using Comp = fruit::impl::meta::Eval<fruit::impl::meta::ConstructComponentImpl(fruit::impl::meta::… variable
230 using Check2 = typename fruit::impl::meta::CheckIfError<Comp>::type;
235 fruit::impl::meta::Not(fruit::impl::meta::IsEmptySet(typename Comp::RsSuperset)),
237 … fruit::impl::meta::SetToVector(typename Comp::RsSuperset)),
|