|
struct | array_family |
| Deduces which family an array type belongs to. More...
|
|
struct | array_family< T, false, false, true, false > |
|
struct | array_family< T, false, false, true, true > |
|
struct | array_family< T, false, true, false, false > |
|
struct | array_family< T, true, false, false, false > |
|
class | ArrayHandler |
| Enhances various operations between pairs of arrays and allows dynamic code injection with uniform interface. More...
|
|
class | ArrayHandlerDDisk |
|
class | ArrayHandlerDDiskDistr |
|
class | ArrayHandlerDDiskSparse |
|
class | ArrayHandlerDDiskSparse< AL, AR, true > |
| Array handler between an iterable and a sparse arrays. Iterable container must implement access operator. More...
|
|
class | ArrayHandlerDefault |
| Fall back handler that calls member functions of arrays. More...
|
|
class | ArrayHandlerDistr |
|
class | ArrayHandlerDistrDDisk |
|
class | ArrayHandlerDistrSparse |
|
class | ArrayHandlerDistrSparse< AL, AR, true > |
| Array handler between an iterable and a sparse arrays. Iterable container must implement access operator. More...
|
|
class | ArrayHandlerIterable |
| Array handler for two containers both of which can be iterated through using begin() and end() member functions, and have a copy constructor. More...
|
|
class | ArrayHandlerIterableSparse |
|
class | ArrayHandlerIterableSparse< AL, AR, true > |
| Array handler between an iterable and a sparse arrays. Iterable container must implement access operator. More...
|
|
class | ArrayHandlerSparse |
| Array handler between two sparse arrays (e.g. std::map) More...
|
|
struct | default_handler |
|
struct | default_handler< T, S, ArrayFamily::Distributed, ArrayFamily::Distributed > |
|
struct | default_handler< T, S, ArrayFamily::Distributed, ArrayFamily::DistributedDisk > |
|
struct | default_handler< T, S, ArrayFamily::Distributed, ArrayFamily::Sparse > |
|
struct | default_handler< T, S, ArrayFamily::DistributedDisk, ArrayFamily::Distributed > |
|
struct | default_handler< T, S, ArrayFamily::DistributedDisk, ArrayFamily::DistributedDisk > |
|
struct | default_handler< T, S, ArrayFamily::DistributedDisk, ArrayFamily::Sparse > |
|
struct | default_handler< T, S, ArrayFamily::Iterable, ArrayFamily::Iterable > |
|
struct | default_handler< T, S, ArrayFamily::Iterable, ArrayFamily::Sparse > |
|
struct | default_handler< T, S, ArrayFamily::Sparse, ArrayFamily::Sparse > |
|
class | DistrArray |
| Array distributed across many processes supporting remote-memory-access, access to process local buffer, and some linear algebra operations. More...
|
|
class | DistrArrayDisk |
| Distributed array located primarily on disk. More...
|
|
class | DistrArrayFile |
| Distributed array storing the buffer on disk using temporary local files. More...
|
|
class | DistrArrayGA |
| Distributed array which uses Global Arrays for managing the array buffer and RMA calls. More...
|
|
class | DistrArrayMPI3 |
| Implementation of distributed array using MPI3 RMA operations. More...
|
|
class | DistrArraySpan |
|
struct | has_mapped_type |
| checks that type name A::mapped_type exists More...
|
|
struct | has_mapped_type< A, void_t< typename A::mapped_type > > |
|
struct | is_disk |
| Checks if class T has a tag marking it as a distributed disk array. More...
|
|
struct | is_disk< T, void_t< typename T::disk_array > > |
|
struct | is_distributed |
| Checks if class T has a tag marking it as a distributed array. More...
|
|
struct | is_distributed< T, void_t< typename T::distributed_array > > |
|
struct | is_iterable |
| Checks that class T can be iterated with std::begin and std::end, and is not sparse. More...
|
|
struct | is_iterable< T, void_t< decltype(std::begin(std::declval< T >())), decltype(std::end(std::declval< T >())), std::enable_if_t<!is_sparse_v< T > > > > |
|
struct | mapped_or_value_type |
| Stores A::mapped_type or A::value_type as member type value, with former taking priority if both exist. More...
|
|
struct | mapped_or_value_type< A, true > |
|
class | Span |
| Non-owning container taking a pointer to the data buffer and its size and exposing routines for iteration. More...
|
|