MueLu  Version of the Day
MueLu_UseShortNamesOrdinal.hpp
Go to the documentation of this file.
1 // Type definitions for templated classes (generally graph-related) that do not require a scalar.
2 
3 #include <Xpetra_UseShortNamesOrdinal.hpp>
4 
5 #ifdef MUELU_AGGREGATES_SHORT
6 using Aggregates [[maybe_unused]] = MueLu::Aggregates<LocalOrdinal,GlobalOrdinal,Node>;
7 #endif
8 #ifdef MUELU_AGGREGATES_KOKKOS_SHORT
9 using Aggregates_kokkos [[maybe_unused]] = MueLu::Aggregates_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
10 #endif
11 #ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_SHORT
12 using AggregationPhase1Algorithm [[maybe_unused]] = MueLu::AggregationPhase1Algorithm<LocalOrdinal,GlobalOrdinal,Node>;
13 #endif
14 #ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_KOKKOS_SHORT
15 using AggregationPhase1Algorithm_kokkos [[maybe_unused]] = MueLu::AggregationPhase1Algorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
16 #endif
17 #ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
18 using AggregationPhase2aAlgorithm [[maybe_unused]] = MueLu::AggregationPhase2aAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
19 #endif
20 #ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_KOKKOS_SHORT
21 using AggregationPhase2aAlgorithm_kokkos [[maybe_unused]] = MueLu::AggregationPhase2aAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
22 #endif
23 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT
24 using AggregationPhase2bAlgorithm [[maybe_unused]] = MueLu::AggregationPhase2bAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
25 #endif
26 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_KOKKOS_SHORT
27 using AggregationPhase2bAlgorithm_kokkos [[maybe_unused]] = MueLu::AggregationPhase2bAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
28 #endif
29 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_SHORT
30 using AggregationPhase3Algorithm [[maybe_unused]] = MueLu::AggregationPhase3Algorithm<LocalOrdinal,GlobalOrdinal,Node>;
31 #endif
32 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_KOKKOS_SHORT
33 using AggregationPhase3Algorithm_kokkos [[maybe_unused]] = MueLu::AggregationPhase3Algorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
34 #endif
35 #ifdef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_SHORT
36 using AggregationStructuredAlgorithm [[maybe_unused]] = MueLu::AggregationStructuredAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
37 #endif
38 #ifdef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_KOKKOS_SHORT
39 using AggregationStructuredAlgorithm_kokkos [[maybe_unused]] = MueLu::AggregationStructuredAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
40 #endif
41 #ifdef MUELU_AMALGAMATIONINFO_SHORT
42 using AmalgamationInfo [[maybe_unused]] = MueLu::AmalgamationInfo<LocalOrdinal,GlobalOrdinal,Node>;
43 #endif
44 #ifdef MUELU_AMALGAMATIONINFO_KOKKOS_SHORT
45 using AmalgamationInfo_kokkos [[maybe_unused]] = MueLu::AmalgamationInfo_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
46 #endif
47 #ifdef MUELU_COUPLEDAGGREGATIONCOMMHELPER_SHORT
48 using CoupledAggregationCommHelper [[maybe_unused]] = MueLu::CoupledAggregationCommHelper<LocalOrdinal,GlobalOrdinal,Node>;
49 #endif
50 #ifdef MUELU_COUPLEDAGGREGATIONFACTORY_SHORT
51 using CoupledAggregationFactory [[maybe_unused]] = MueLu::CoupledAggregationFactory<LocalOrdinal,GlobalOrdinal,Node>;
52 #endif
53 #ifdef MUELU_GLOBALLEXICOGRAPHICINDEXMANAGER_SHORT
54 using GlobalLexicographicIndexManager [[maybe_unused]] = MueLu::GlobalLexicographicIndexManager<LocalOrdinal,GlobalOrdinal,Node>;
55 #endif
56 #ifdef MUELU_GRAPH_SHORT
57 using Graph [[maybe_unused]] = MueLu::Graph<LocalOrdinal,GlobalOrdinal,Node>;
58 #endif
59 #ifdef MUELU_GRAPHBASE_SHORT
60 using GraphBase [[maybe_unused]] = MueLu::GraphBase<LocalOrdinal,GlobalOrdinal,Node>;
61 #endif
62 #ifdef MUELU_HYBRIDAGGREGATIONFACTORY_SHORT
63 using HybridAggregationFactory [[maybe_unused]] = MueLu::HybridAggregationFactory<LocalOrdinal,GlobalOrdinal,Node>;
64 #endif
65 #ifdef MUELU_INDEXMANAGER_SHORT
66 using IndexManager [[maybe_unused]] = MueLu::IndexManager<LocalOrdinal,GlobalOrdinal,Node>;
67 #endif
68 #ifdef MUELU_INDEXMANAGER_KOKKOS_SHORT
69 using IndexManager_kokkos [[maybe_unused]] = MueLu::IndexManager_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
70 #endif
71 #ifdef MUELU_INTERFACEAGGREGATIONALGORITHM_SHORT
72 using InterfaceAggregationAlgorithm [[maybe_unused]] = MueLu::InterfaceAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
73 #endif
74 #ifdef MUELU_INTERFACEMAPPINGTRANSFERFACTORY_SHORT
75 using InterfaceMappingTransferFactory [[maybe_unused]] = MueLu::InterfaceMappingTransferFactory<LocalOrdinal,GlobalOrdinal,Node>;
76 #endif
77 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_SHORT
78 using IsolatedNodeAggregationAlgorithm [[maybe_unused]] = MueLu::IsolatedNodeAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
79 #endif
80 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_KOKKOS_SHORT
81 using IsolatedNodeAggregationAlgorithm_kokkos [[maybe_unused]] = MueLu::IsolatedNodeAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
82 #endif
83 #ifdef MUELU_ISORROPIAINTERFACE_SHORT
84 using IsorropiaInterface [[maybe_unused]] = MueLu::IsorropiaInterface<LocalOrdinal,GlobalOrdinal,Node>;
85 #endif
86 #ifdef MUELU_LWGRAPH_SHORT
87 using LWGraph [[maybe_unused]] = MueLu::LWGraph<LocalOrdinal,GlobalOrdinal,Node>;
88 #endif
89 #ifdef MUELU_LWGRAPH_KOKKOS_SHORT
90 using LWGraph_kokkos [[maybe_unused]] = MueLu::LWGraph_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
91 #endif
92 #ifdef MUELU_LOCALLWGRAPH_KOKKOS_SHORT
93 using LocalLWGraph_kokkos [[maybe_unused]] = MueLu::LocalLWGraph_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
94 #endif
95 #ifdef MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT
96 using LeftoverAggregationAlgorithm [[maybe_unused]] = MueLu::LeftoverAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
97 #endif
98 #ifdef MUELU_LOCALAGGREGATIONALGORITHM_SHORT
99 using LocalAggregationAlgorithm [[maybe_unused]] = MueLu::LocalAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
100 #endif
101 #ifdef MUELU_LOCALLEXICOGRAPHICINDEXMANAGER_SHORT
102 using LocalLexicographicIndexManager [[maybe_unused]] = MueLu::LocalLexicographicIndexManager<LocalOrdinal,GlobalOrdinal,Node>;
103 #endif
104 #ifdef MUELU_LOCALORDINALTRANSFERFACTORY_SHORT
105 using LocalOrdinalTransferFactory [[maybe_unused]] = MueLu::LocalOrdinalTransferFactory<LocalOrdinal,GlobalOrdinal,Node>;
106 #endif
107 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT
108 using OnePtAggregationAlgorithm [[maybe_unused]] = MueLu::OnePtAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
109 #endif
110 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_KOKKOS_SHORT
111 using OnePtAggregationAlgorithm_kokkos [[maybe_unused]] = MueLu::OnePtAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
112 #endif
113 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT
114 using PreserveDirichletAggregationAlgorithm [[maybe_unused]] = MueLu::PreserveDirichletAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node>;
115 #endif
116 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_SHORT
117 using PreserveDirichletAggregationAlgorithm_kokkos [[maybe_unused]] = MueLu::PreserveDirichletAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
118 #endif
119 #ifdef MUELU_PRFACTORY_SHORT
120 using PRFactory [[maybe_unused]] = MueLu::PRFactory<LocalOrdinal,GlobalOrdinal,Node>;
121 #endif
122 #ifdef MUELU_REBALANCEMAPFACTORY_SHORT
123 using RebalanceMapFactory [[maybe_unused]] = MueLu::RebalanceMapFactory<LocalOrdinal,GlobalOrdinal,Node>;
124 #endif
125 #ifdef MUELU_REPARTITIONINTERFACE_SHORT
126 using RepartitionInterface [[maybe_unused]] = MueLu::RepartitionInterface<LocalOrdinal,GlobalOrdinal,Node>;
127 #endif
128 #ifdef MUELU_STRUCTUREDAGGREGATIONFACTORY_KOKKOS_SHORT
129 using StructuredAggregationFactory_kokkos [[maybe_unused]] = MueLu::StructuredAggregationFactory_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
130 #endif
131 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT
132 using UncoupledAggregationFactory [[maybe_unused]] = MueLu::UncoupledAggregationFactory<LocalOrdinal,GlobalOrdinal,Node>;
133 #endif
134 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_KOKKOS_SHORT
135 using UncoupledAggregationFactory_kokkos [[maybe_unused]] = MueLu::UncoupledAggregationFactory_kokkos<LocalOrdinal,GlobalOrdinal,Node>;
136 #endif
137 #ifdef MUELU_UNCOUPLEDINDEXMANAGER_SHORT
138 using UncoupledIndexManager [[maybe_unused]] = MueLu::UncoupledIndexManager<LocalOrdinal,GlobalOrdinal,Node>;
139 #endif
140 #ifdef MUELU_USERAGGREGATIONFACTORY_SHORT
141 using UserAggregationFactory [[maybe_unused]] = MueLu::UserAggregationFactory<LocalOrdinal,GlobalOrdinal,Node>;
142 #endif
143 #ifdef MUELU_FACTORY_SHORT
144 using Factory [[maybe_unused]] = MueLu::Factory;
145 #endif
146 #ifdef MUELU_FACTORYBASE_SHORT
147 using FactoryBase [[maybe_unused]] = MueLu::FactoryBase;
148 #endif
149 #ifdef MUELU_FACTORYMANAGERBASE_SHORT
150 using FactoryManagerBase [[maybe_unused]] = MueLu::FactoryManagerBase;
151 #endif
152 #ifdef MUELU_LEVEL_SHORT
153 using Level [[maybe_unused]] = MueLu::Level;
154 #endif
155 #ifdef MUELU_PFACTORY_SHORT
156 using PFactory [[maybe_unused]] = MueLu::PFactory;
157 #endif
158 #ifdef MUELU_RFACTORY_SHORT
159 using RFactory [[maybe_unused]] = MueLu::RFactory;
160 #endif
161 #ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT
162 using SingleLevelFactoryBase [[maybe_unused]] = MueLu::SingleLevelFactoryBase;
163 #endif
164 #ifdef MUELU_TWOLEVELFACTORYBASE_SHORT
165 using TwoLevelFactoryBase [[maybe_unused]] = MueLu::TwoLevelFactoryBase;
166 #endif
167 #ifdef MUELU_VARIABLECONTAINER_SHORT
168 using VariableContainer [[maybe_unused]] = MueLu::VariableContainer;
169 #endif
170 #ifdef MUELU_SMOOTHERFACTORYBASE_SHORT
171 using SmootherFactoryBase [[maybe_unused]] = MueLu::SmootherFactoryBase;
172 #endif
173 #ifdef MUELU_AMESOSSMOOTHER_SHORT
174 typedef MueLu::AmesosSmoother<Node> AmesosSmoother;
175 #endif
176 #ifdef MUELU_IFPACKSMOOTHER_SHORT
177 typedef MueLu::IfpackSmoother<Node> IfpackSmoother;
178 #endif
Algorithm for coarsening a graph with uncoupled aggregation. keep special marked nodes as singleton n...
Lightweight MueLu representation of a compressed row storage graph.
Container class for aggregation information.
MueLu representation of a compressed row storage graph.
Interface to IsorropiaInterface to Isorropia allowing to access other rebalancing/repartitioning algo...
Algorithm for coarsening a graph with structured aggregation.
Factory for building aggregates on meshes partly structured and partly unstructured.
Class for transferring a vector of local ordinals from a finer level to a coarser one...
Algorithm for coarsening a graph with uncoupled aggregation.
Base class for factories that use two levels (fineLevel and coarseLevel).
Factory for coarsening a graph with uncoupled aggregation.
Base class for factories (e.g., R, P, and A_coarse).
Algorithm for coarsening a graph with uncoupled aggregation. creates aggregates along an interface us...
Builds one-to-one aggregates for all Dirichlet boundary nodes. For some applications this might be ne...
Helper class for providing arbitrated communication across processors.
Class that holds all level-specific information.
Definition: MueLu_Level.hpp:99
Class that provides default factories within Needs class.
Ignores isolated nodes during aggregation. Marks the node to be "aggregated" without adding real aggr...
Transfer mapping data for interface aggregation to the coarse level.
minimal container class for storing amalgamation information
Factory which rebalances a map on current level using the Importer object generated by the Repartitio...
MueLu representation of a graph.
Lightweight MueLu representation of a compressed row storage graph.
Among unaggregated points, see if we can make a reasonable size aggregate out of it.IdeaAmong unaggregated points, see if we can make a reasonable size aggregate out of it. We do this by looking at neighbors and seeing how many are unaggregated and on my processor. Loosely, base the number of new aggregates created on the percentage of unaggregated nodes.
Helper class which transforms an "AmalgamatedPartition" array to an unamalgamated "Partition"...
Add leftovers to existing aggregatesIdeaIn phase 2b non-aggregated nodes are added to existing aggreg...
Lightweight MueLu representation of a compressed row storage graph.
Algorithm for coarsening a graph with uncoupled aggregation.
Container class for mesh layout and indices calculation.
Class that stores all relevant data for a variable.
Factory that provides an interface for a concrete implementation of a prolongation operator...
Handle leftover nodes. Try to avoid singleton nodesIdeaIn phase 3 we try to stick unaggregated nodes ...
Factory for building structured aggregates or CrsGraph for interpolation base prolongator.
Factory for building uncoupled aggregates.
minimal container class for storing amalgamation information
Base class for factories that use one level (currentLevel).
Container class for mesh layout and indices calculation.
Class that encapsulates Ifpack smoothers.
Class that encapsulates Amesos direct solvers.