| Cnarray< Policy >::access< Priv > | Topology interface base |
| Cntree< Policy >::access< Priv > | See specialization_base::interface |
| Cunstructured< Policy >::access< Privileges > | Topology interface base |
| Caccessor< L, T, Priv > | A data accessor |
| Caccessor< dense, DATA_TYPE, PRIVILEGES > | |
| Caccessor< dense, std::size_t, OP > | |
| Caccessor< raw, DATA_TYPE, PRIVILEGES > | Accessor for potentially uninitialized memory |
| ►Caccessor< raw, T, P > | |
| Caccessor< dense, T, P > | Accessor for ordinary fields |
| ►Caccessor< raw, T, privilege_pack< privilege_merge(P)> > | |
| Cragged_accessor< T, P, privilege_repeat< ro, privilege_count(P)> > | |
| Cragged_accessor< T, P, privilege_repeat< privilege_discard(P) ? wo :rw, privilege_count(P)> > | |
| Cragged_accessor< T, P, OP > | Accessor for ragged fields |
| Caccessor< single, DATA_TYPE, PRIVILEGES > | Accessor for a single value. This class is supported for GPU execution |
| Caccessor< sparse, T, P > | Accessor for sparse fields |
| Ccontrol< P >::action< T, CP, M > | The action type provides a mechanism to add execution elements to the FleCSI control model |
| Ccontrol< P >::action< wrap, cp > | |
| Caxis | Information about the layout of an entire axis |
| ►Caxis_color | High-level information about one axis of one color |
| Caxis_info | Collected information about one color along one axis. This class is supported for GPU execution |
| Caxis_definition | This type is part of the index definition, and defines the coloring of an individal axis |
| Caxis_layout | The layout of one axis of one color |
| CBBox< DIM > | The bounding box type that is used by KDTree as input |
| Ccast | Aggregate helper that converts to any type via get |
| Cnarray_base::coloring | Coloring type |
| Cntree_base::coloring | Ntree coloring |
| Cunstructured_base::coloring | Information for constructing an unstructured mesh |
| Ccoloring_slot< class > | A mpi_coloring object, constructed on request |
| Ccoloring_slot< D > | |
| ►Cconfig_base | Specification of options for FleCSI |
| Cconfig | Backend-specific options |
| Ccontext< T > | Base for annotation contexts |
| Ccontext< execution > | |
| Ccontrol< P > | The control type provides a control model for specifying a set of control points as a coarse-grained control flow graph, with each node of the graph specifying a set of actions as a directed acyclic graph (DAG) |
| ►Ccontrol_base | Base class for providing default implementations for optional interfaces |
| Ccontrol_policy | An example control policy that is not really implemented |
| Cconvert< T > | Defines a serialization in terms of a representation type |
| Cdag< NodePolicy > | Basic DAG type |
| Cfield< T, L >::definition< Topo, Space > | A field registration |
| Cfield< T, L >::definition< claims > | |
| Cfield< T, L >::definition< flecsi::topo::resize > | |
| Cfield< T, L >::definition< meta< P > > | |
| Cfield< T, L >::definition< meta< Policy > > | |
| Cdependencies_config | Specification for initializing underlying libraries |
| Cdependencies_guard | RAII guard for initializing/finalizing FleCSI dependencies |
| Cdimensioned_array< TYPE, DIMENSION, NAMESPACE > | The dimensioned_array type provides a general base for defining contiguous array types that have a specific dimension |
| Cdimensioned_array< double, DIM > | |
| Cntree_specialization::entity_data | Struct containing data for entities to compute interactions |
| Ccontrol_base::exception | Exception class for control points |
| Cfield< T, L > | Helper type to define and access fields |
| Cfield< Color > | |
| Cfield< color_id > | |
| Cfield< entity_data > | |
| Cfield< h_s_t > | |
| Cfield< hcell_t > | |
| Cfield< hist_int_t > | |
| Cfield< hmap_pair_t > | |
| Cfield< int > | |
| Cfield< interval > | |
| Cfield< key_t > | |
| Cfield< key_type > | |
| Cfield< meta, data::single > | |
| Cfield< meta_type, data::single > | |
| Cfield< node_data > | |
| Cfield< ntree_data > | |
| Cfield< std::size_t > | |
| Cfield< typenamePolicy::meta_data, data::single > | |
| Cfield< util::id > | |
| Cfield< util::key_array< meta_data, index_spaces >, data::single > | |
| Cfield_reference< T, L, Topo, Space > | Identifies a field on a particular topology instance |
| Cfilling_curve_key< DIM, T, DERIVED > | Space filling curve keys generator, CRTP base |
| ►Cfilling_curve_key< DIM, T, hilbert_key< DIM, T > > | |
| Chilbert_key< DIM, T > | Point on a Hilbert-Peano space filling curve |
| ►Cfilling_curve_key< DIM, T, morton_key< DIM, T > > | |
| Cmorton_key< DIM, T > | Point on a Morton space filling curve |
| ►Cfilling_curve_key< DIM, T, my_key< DIM, T > > | |
| Cmy_key< DIM, T > | Example implementation of filling curve derived from the filling_curve_key CRTP |
| Cfull_range | This class computes full range size if prefix or subinterval of the range is not specified |
| Cfuture< Return, Launch > | Single or multiple future |
| Cfuture< Return > | Single-valued future |
| Cfuture< Return, exec::launch_type_t::index > | Multi-valued future from an index launch |
| Cgetopt | Command-line parser |
| Ctrace::guard | RAII guard for executing a trace |
| Cguard | Scope guard for categorizing output |
| Cguard< ctx, severity > | Scope guard for marking a code region |
| Cidentity | Interpret a type as itself in functional contexts |
| Cindex_color | Information specific to a single index space and color |
| Cindex_definition | This type is part of the coloring, and encapsulates the coloring information for a single index space (such as how many colors per axis the mesh needs to be partitioned into, if boundaries are periodic, etc), that is used by the coloring algorithm to create mesh partitions |
| Cunstructured_base::coloring::index_space | Coloring information for a single index space |
| Cmutator< sparse, T, P >::row::iterator | Bidirectional iterator over key-value pairs |
| CKDTree< DIM > | A k-d tree for efficiently finding intersections between shapes |
| Claunch_domain | An explicit launch domain size |
| Cmap_base< D > | A partition of some prefix of the whole numbers into substrings |
| ►Cmap_base< equal_map > | |
| Cequal_map | A partition with substrings of equal size |
| ►Cmap_base< offsets > | |
| Coffsets | A partition with substrings of arbitrary size |
| Cmapping< P > | A prepared assignment of colors |
| Cmax | Maximum reduction type |
| ►Cmdbase< T, D > | A multi-dimensional view of an array |
| Cmdcolex< T, D > | A variation of mdspan with reversed indices (distinguished by ()) |
| Cmdspan< T, D > | A small, approximate subset of mdspan from C++23 |
| Cnarray_specialization::meta_data | Specialization-specific data to store once per color |
| Cmin | Minimum reduction type |
| Cspecialization< C, D >::mpi_coloring | Constructs a coloring in an MPI task |
| Cmulti< class > | A sequence of accessors obtained from a launch::mapping |
| Cmulti_reference< T, L, Topo, S > | Identifies a field on a launch::mapping |
| Cmutator< layout, class, Privileges > | A specialized accessor for changing the extent of dynamic layouts |
| Cmutator< ragged, T, P > | Mutator for ragged fields |
| Cmutator< sparse, T, P > | Mutator for sparse fields |
| ►Cnarray_base | Specialization-independent definitions |
| Cnarray< Policy > | Narray Topology |
| Cntree_specialization::node_data | Struct containing data for nodes to compute interactions |
| Ccontrol_policy::node_policy | Base class for control point objects |
| ►Cntree_base | Ntree topology base |
| Cntree< Policy > | The ntree topology represents a binary, quad or octree stored/accessed using a hashtable |
| Cparticle_accessor< T, P, M > | Accessor for particle fields |
| Cparticle_accessor< T, P, false > | |
| ►Cparticle_accessor< T, P, true > | |
| Cmutator< particle, T, P > | Mutator for particle fields |
| Cpeer_entities | Communication pattern for a single pair of colors |
| Cresize::policy | A heuristic for automatically resizing a partition |
| Cprefix_range | This class computes the range based on the prefix specified |
| Cproduct | Product reduction type |
| Cprogram_option< ValueType > | The program_option type is a wrapper that implements a useful subset of Boost's Program Options utility |
| Creduce | An example reduction type that is not really implemented |
| Creduction_accessor< R, T > | Accessor for computing reductions |
| Cregion< CTX > | Base for code region annotations |
| Cregion< execution > | |
| Crguard< reg > | Scope guard for marking a code region |
| Caccessor< sparse, T, P >::row | A mapping backed by a row. Use the ragged interface to iterate |
| Cmutator< ragged, T, P >::row | A row handle |
| Cmutator< sparse, T, P >::row | A row handle |
| Cruntime | FleCSI runtime state |
| Cspan< T > | A workalike for std::span from C++20 (only dynamic-extent, without ranges support) |
| Cspan< element_type > | |
| Cspan< pair_t > | |
| ►Cspecialization_base | Utilities and defaults for specializations |
| Cspecialization< array_category, array< P > > | |
| Cspecialization< column, claims > | |
| ►Cspecialization< global_category, global > | |
| Cglobal | Unpartitioned topology whose fields are readable by all colors |
| ►Cspecialization< index_category, index > | |
| Cindex | The index type allows users to register data on an arbitrarily-sized set of indices that have an implicit one-to-one coloring |
| Cspecialization< user, meta< P > > | |
| Cspecialization< user, meta< Policy > > | |
| ►Cspecialization< narray, narray_specialization > | |
| Cnarray_specialization | Example specialization which is not really implemented |
| ►Cspecialization< ntree, ntree_specialization > | |
| Cntree_specialization | Example specialization which is not really implemented |
| Cspecialization< ragged_category, ragged< T > > | |
| Cspecialization< ragged_partition_category, ragged_partition > | |
| ►Cspecialization< column, resize > | |
| Cresize | Types for resizing partitions |
| Cspecialization< user, ctopo > | |
| ►Cspecialization< unstructured, unstructured_specialization > | |
| Cunstructured_specialization | Example specialization which is not really implemented |
| Cspecialization< topo::color, sort_color > | |
| Chelp | Convenience base class for specialization class templates |
| Cspecialization< C, D > | CRTP base for specializations |
| Csub_range | This class computes subinterval of a range based on the starting and ending indices provided |
| Csubstring_view< R > | A view of part of a range |
| Csum | Sum reduction type |
| CSymbol< S > | Dummy class template |
| Ctag | A tag for labeling output to enable |
| Ctask_local< T > | A global variable with a task-specific value |
| Ctask_local< test_output_t > | |
| Ctopology_accessor< class, Privileges > | Topology accessor type |
| Ctopology_slot< Topo > | A movable slot that holds a topology, constructed upon request |
| Ctrace | Records execution of a loop whose iterations all execute the same sequence of tasks |
| Ctraits< T, E > | Extension point for serialization |
| ►Cunstructured_base | Specialization-independent definitions |
| Cunstructured< P > | |
| Cunstructured< Policy > | Topology type |
| Cuser< P > | The User topology is a bare-bones topology supporting a single index space |
| Cvalue< T > | Convenience for stateless types |
| ►Cwith_size | Size information for a partition |
| Crepartition | A partition with a field for dynamically resizing it |
1.12.0