|
LLVM 22.0.0git
|
Namespaces | |
| namespace | clause |
| namespace | type |
Classes | |
| struct | ClauseT |
| struct | ConstructDecompositionT |
| struct | DirectiveWithClauses |
Typedefs | |
| template<typename T> | |
| using | ListT = type::ListT<T> |
| template<typename I, typename E> | |
| using | ObjectT = type::ObjectT<I, E> |
| template<typename I, typename E> | |
| using | ObjectListT = type::ObjectListT<I, E> |
| template<typename T, typename I, typename E> | |
| using | IteratorT = type::IteratorT<T, I, E> |
Enumerations | |
| enum struct | ErrorCode : int { NoLeafAllowing , NoLeafPrivatizing , InvalidDirNameMod , RedModNotApplied } |
Functions | |
| template<typename ContainerTy, typename FunctionTy, typename ElemTy = typename llvm::remove_cvref_t<ContainerTy>::value_type, typename ResultTy = std::invoke_result_t<FunctionTy, ElemTy>> | |
| ListT< ResultTy > | makeList (ContainerTy &&container, FunctionTy &&func) |
| template<typename ClauseType, typename HelperType> | |
| ConstructDecompositionT (uint32_t, HelperType &, llvm::omp::Directive, llvm::ArrayRef< ClauseType >) -> ConstructDecompositionT< ClauseType, HelperType > | |
| template<typename I, typename E> | |
| bool | operator== (const ObjectT< I, E > &o1, const ObjectT< I, E > &o2) |
| using tomp::IteratorT = type::IteratorT<T, I, E> |
| using tomp::ListT = type::ListT<T> |
| using tomp::ObjectListT = type::ObjectListT<I, E> |
| using tomp::ObjectT = type::ObjectT<I, E> |
|
strong |
| Enumerator | |
|---|---|
| NoLeafAllowing | |
| NoLeafPrivatizing | |
| InvalidDirNameMod | |
| RedModNotApplied | |
Definition at line 71 of file ConstructDecompositionT.h.
| tomp::ConstructDecompositionT | ( | uint32_t | , |
| HelperType & | , | ||
| llvm::omp::Directive | , | ||
| llvm::ArrayRef< ClauseType > | ) -> ConstructDecompositionT< ClauseType, HelperType > |
| ListT< ResultTy > tomp::makeList | ( | ContainerTy && | container, |
| FunctionTy && | func ) |
Definition at line 317 of file ClauseT.h.
References llvm::transform().