\n
\n
\n
\n-
5#ifndef DUNE_COMMON_SCALARMATRIXVIEW_HH \n-
6#define DUNE_COMMON_SCALARMATRIXVIEW_HH \n+
5#ifndef DUNE_REMOTEINDICES_HH \n+
6#define DUNE_REMOTEINDICES_HH \n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
40 class ScalarMatrixView :
\n-
41 public DenseMatrix<ScalarMatrixView<K>>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
40 template<
typename TG,
typename TA>
\n+
\n+
\n
\n-
43 ScalarVectorView<K> data_;
\n-
44 using Base = DenseMatrix<ScalarMatrixView<K>>;
\n-
\n-
\n-
47 friend class ScalarMatrixView;
\n-
\n+
\n+
44 inline static MPI_Datatype
getType();
\n+
\n+
46 static MPI_Datatype type;
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n+
50 template<
typename T,
typename A>
\n+
\n+
\n+
53 template<
typename T1,
typename T2>
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
63 constexpr static int rows = 1;
\n-
66 constexpr static int cols = 1;
\n+
\n+
\n+
\n+
\n+
60 template<
typename T1,
typename T2>
\n+
\n+
\n+
\n+
64 template<
typename T,
typename A,
bool mode>
\n+
\n+
\n
\n-
\n-
71 constexpr ScalarMatrixView ()
\n-
\n-
\n-
\n-
76 ScalarMatrixView (K* p) :
\n-
\n-
\n-
\n-
81 ScalarMatrixView (
const ScalarMatrixView &other) :
\n-
\n-
\n-
\n-
\n-
87 ScalarMatrixView (ScalarMatrixView &&other) :
\n-
\n-
\n-
\n-
\n-
93 ScalarMatrixView& operator= (
const ScalarMatrixView& other)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
100 ScalarMatrixView& operator= (
const ScalarMatrixView<KK>& other)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
108 std::enable_if_t<std::is_convertible<T, K>::value,
int> = 0>
\n-
109 inline ScalarMatrixView& operator= (
const T& k)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
116 static constexpr size_type mat_rows() {
return 1; }
\n-
117 static constexpr size_type mat_cols() {
return 1; }
\n-
\n-
\n-
\n-
\n-
\n-
\n+
71 template<
typename T1,
typename T2>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
77 template<
typename T,
typename A,
typename A1>
\n+
\n+
\n+
\n+
\n+
82 template<
typename T,
typename A,
bool mode>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
134 std::ostream& operator<< (std::ostream& s,
const ScalarMatrixView<K>& a)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
142 std::enable_if_t<IsNumber<T>::value,
int> = 0>
\n-
\n-
\n-
145 return ScalarMatrixView<T>{&t};
\n-
\n-
\n-
\n-
150 std::enable_if_t<IsNumber<T>::value,
int> = 0>
\n-
151 auto asMatrix(
const T& t)
\n-
\n-
153 return ScalarMatrixView<const T>{&t};
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
153 template<
class T,
class A>
\n+
\n
\n-
\n-
158 std::enable_if_t<not IsNumber<T>::value,
int> = 0>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
166 std::enable_if_t<not IsNumber<T>::value,
int> = 0>
\n-
167 const T& asMatrix(
const T& t)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
177 struct FieldTraits<Impl::ScalarMatrixView<K>> :
public FieldTraits<std::remove_const_t<K>> {};
\n-
\n-
\n-
180 struct DenseMatVecTraits<Impl::ScalarMatrixView<K>>
\n-
\n-
182 using derived_type = Impl::ScalarMatrixView<K>;
\n-
183 using row_type = Impl::ScalarVectorView<K>;
\n-
184 using row_reference = row_type&;
\n-
185 using const_row_reference =
const row_type&;
\n-
186 using value_type = std::remove_const_t<K>;
\n-
187 using size_type = std::size_t;
\n-
\n-
\n-
\n-
\n-
192 struct AutonomousValueType<Impl::ScalarMatrixView<K>>
\n-
\n-
194 using type = FieldMatrix<std::remove_const_t<K>,1,1>;
\n-
\n+
\n+
\n+
158 template<
class T,
class A>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
166 template<
typename T1,
typename T2>
\n+
\n+
\n+
\n+
186 template<
class T,
class A=std::allocator<
RemoteIndex<
typename T::GlobalIndex,
\n+
187 typename T::LocalIndex::Attribute> > >
\n+
\n+
\n+
\n+
\n+
\n+
192 template<
typename T1,
typename A2,
typename A1>
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
Implements a matrix constructed from a given type representing a field and a compile-time given numbe...
\n-
Macro for wrapping boundary checks.
\n-
Traits for type conversions and type information.
\n-
Implements a matrix constructed from a given type representing a field and compile-time given number ...
\n-
Implements a scalar vector view wrapper around an existing scalar.
\n-
Documentation of the traits classes you need to write for each implementation of DenseVector or Dense...
\n-
#define DUNE_ASSERT_BOUNDS(cond)
If DUNE_CHECK_BOUNDS is defined: check if condition cond holds; otherwise, do nothing.
Definition boundschecking.hh:30
\n+
197 template<
class G,
class T1,
class T2>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
237 using Allocator =
typename std::allocator_traits<A>::template rebind_alloc<RemoteIndex>;
\n+
\n+
\n+
\n+
\n+
244 typedef std::map<int, std::pair<RemoteIndexList*,RemoteIndexList*> >
\n+
\n+
\n+
\n+
\n+
\n+
267 const MPI_Comm& comm,
const std::vector<int>&
neighbours=std::vector<int>(),
bool includeSelf=
false);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
297 const MPI_Comm& comm,
const std::vector<int>&
neighbours=std::vector<int>());
\n+
\n+
\n+
\n+
\n+
\n+
302 neighbourIds.clear();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
326 template<
bool ignorePublic>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
359 template<
bool mode,
bool send>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
420 std::set<int> neighbourIds;
\n+
\n+
423 const static int commTag_=333;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
477 template<
bool ignorePublic>
\n+
478 inline void buildRemote(
bool includeSelf);
\n+
\n+
\n+
\n+
498 template<
bool ignorePublic>
\n+
499 inline void packEntries(PairType** myPairs,
const ParallelIndexSet& indexSet,
\n+
500 char* p_out, MPI_Datatype type,
int bufferSize,
\n+
501 int* position,
int n);
\n+
\n+
\n+
517 PairType** local,
int localEntries,
char* p_in,
\n+
518 MPI_Datatype type,
int* position,
int bufferSize,
\n+
\n+
\n+
\n+
522 int remoteEntries, PairType** localSource,
\n+
523 int localSourceEntries, PairType** localDest,
\n+
524 int localDestEntries,
char* p_in,
\n+
525 MPI_Datatype type,
int* position,
int bufferSize);
\n+
\n+
527 void unpackCreateRemote(
char* p_in, PairType** sourcePairs, PairType** DestPairs,
\n+
528 int remoteProc,
int sourcePublish,
int destPublish,
\n+
529 int bufferSize,
bool sendTwo,
bool fromOurSelf=
false);
\n+
\n+
\n+
\n+
549 template<
class T,
class A,
bool mode>
\n+
\n+
\n+
\n+
\n+
553 template<
typename T1,
typename A1>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
696 GlobalModifyIterator giter_;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
706 template<
class T,
class A>
\n+
\n+
\n+
\n+
\n+
713 typedef T ParallelIndexSet;
\n+
\n+
\n+
\n+
\n+
\n+
728 typedef typename LocalIndex::Attribute Attribute;
\n+
\n+
\n+
\n+
734 using Allocator =
typename std::allocator_traits<A>::template rebind_alloc<RemoteIndex>;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
747 typedef std::map<int, std::pair<RemoteIndexList*,RemoteIndexList*> >
\n+
\n+
\n+
\n+
\n+
765 inline void advance(
const GlobalIndex& global);
\n+
\n+
776 inline void advance(
const GlobalIndex& global,
const Attribute& attribute);
\n+
\n+
\n+
\n+
783 inline bool empty()
const;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
800 : iter_(iter), end_(
end), index_(index), hasAttribute(false)
\n+
\n+
\n+
803 while(iter_!=end_ && iter_->second.first->localIndexPair().global()!=index_)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
809 : iter_(iter), end_(
end), index_(index), attribute_(attribute), hasAttribute(true)
\n+
\n+
\n+
812 while(iter_!=end_ && (iter_->second.first->localIndexPair().global()!=index_
\n+
813 || iter_->second.first->localIndexPair().local().attribute()!=attribute))
\n+
\n+
\n+
\n+
\n+
\n+
818 : iter_(other.iter_), end_(other.end_), index_(other.index_)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
826 while(iter_!=end_ && (iter_->second.first->localIndexPair().global()!=index_ ||
\n+
\n+
828 iter_->second.first->localIndexPair().local().attribute()!=attribute_)))
\n+
\n+
830 assert(iter_==end_ ||
\n+
831 (iter_->second.first->localIndexPair().global()==index_));
\n+
832 assert(iter_==end_ || !hasAttribute ||
\n+
833 (iter_->second.first->localIndexPair().local().attribute()==attribute_));
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
840 return *(iter_->second.first);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
852 return iter_->second.first.operator->();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
858 return other.iter_==iter_;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
864 return other.iter_!=iter_;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
873 Attribute attribute_;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
885 Attribute attribute_;
\n+
\n+
\n+
\n+
\n+
889 template<
typename TG,
typename TA>
\n+
\n+
\n+
\n+
892 if(type==MPI_DATATYPE_NULL) {
\n+
893 int length[2] = {1, 1};
\n+
\n+
\n+
\n+
\n+
\n+
899 MPI_Get_address(&rep, &base);
\n+
900 MPI_Get_address(&(rep.global_), &disp[0]);
\n+
901 MPI_Get_address(&(rep.local_), &disp[1]);
\n+
902 for (MPI_Aint& d : disp)
\n+
\n+
\n+
\n+
906 MPI_Type_create_struct(2, length, disp, types, &tmp);
\n+
\n+
\n+
909 MPI_Type_commit(&type);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
916 template<
typename TG,
typename TA>
\n+
\n+
\n+
919 template<
typename T1,
typename T2>
\n+
\n+
\n+
921 : localIndex_(local), attribute_(static_cast<
std::underlying_type_t<T2>>(attribute))
\n+
\n+
\n+
\n+
924 template<
typename T1,
typename T2>
\n+
\n+
\n+
926 : localIndex_(0), attribute_(static_cast<
std::underlying_type_t<T2>>(attribute))
\n+
\n+
\n+
\n+
929 template<
typename T1,
typename T2>
\n+
\n+
\n+
931 : localIndex_(0), attribute_()
\n+
\n+
\n+
933 template<
typename T1,
typename T2>
\n+
\n+
\n+
\n+
936 return localIndex_==ri.localIndex_ && attribute_==ri.
attribute;
\n+
\n+
\n+
\n+
939 template<
typename T1,
typename T2>
\n+
\n+
\n+
\n+
942 return localIndex_!=ri.localIndex_ || attribute_!=ri.attribute_;
\n+
\n+
\n+
\n+
945 template<
typename T1,
typename T2>
\n+
\n+
\n+
\n+
948 return T2(attribute_);
\n+
\n+
\n+
\n+
951 template<
typename T1,
typename T2>
\n+
\n+
\n+
957 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
960 const MPI_Comm& comm,
\n+
961 const std::vector<int>& neighbours,
\n+
\n+
963 : source_(&source), target_(&destination), comm_(comm),
\n+
964 sourceSeqNo_(-1), destSeqNo_(-1), publicIgnored(false), firstBuild(true),
\n+
965 includeSelf(includeSelf_)
\n+
\n+
\n+
\n+
\n+
\n+
970 template<
typename T,
typename A>
\n+
\n+
\n+
976 template<
typename T,
typename A>
\n+
\n+
\n+
978 : source_(0), target_(0), sourceSeqNo_(-1),
\n+
979 destSeqNo_(-1), publicIgnored(false), firstBuild(true),
\n+
\n+
\n+
\n+
\n+
983 template<
class T,
typename A>
\n+
\n+
\n+
\n+
986 const MPI_Comm& comm,
\n+
987 const std::vector<int>& neighbours)
\n+
\n+
\n+
\n+
991 target_ = &destination;
\n+
\n+
\n+
994 setNeighbours(neighbours);
\n+
\n+
\n+
\n+
997 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1005 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1013 template<
typename T,
typename A>
\n+
\n+
\n+
1019 template<
typename T,
typename A>
\n+
1020 template<
bool ignorePublic>
\n+
\n+
\n+
\n+
1023 char* p_out, MPI_Datatype type,
\n+
\n+
\n+
1026 [[maybe_unused]]
int n)
\n+
\n+
\n+
1029 const auto end = indexSet.
end();
\n+
\n+
\n+
\n+
1033 for(
auto index = indexSet.begin(); index != end; ++index)
\n+
1034 if(ignorePublic || index->local().isPublic()) {
\n+
\n+
1036 MPI_Pack(
const_cast<PairType*
>(&(*index)), 1,
\n+
\n+
1038 p_out, bufferSize, position, comm_);
\n+
1039 pairs[i++] =
const_cast<PairType*
>(&(*index));
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1045 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
\n+
1051 const auto end=indexSet.
end();
\n+
1052 for(
auto index=indexSet.
begin(); index!=end; ++index)
\n+
1053 if(index->local().isPublic())
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1061 template<
typename T,
typename A>
\n+
1062 inline void RemoteIndices<T,A>::unpackCreateRemote(
char* p_in, PairType** sourcePairs,
\n+
1063 PairType** destPairs,
int remoteProc,
\n+
1064 int sourcePublish,
int destPublish,
\n+
1065 int bufferSize,
bool sendTwo,
\n+
\n+
\n+
\n+
\n+
1070 int noRemoteSource=-1, noRemoteDest=-1;
\n+
1071 char twoIndexSets=0;
\n+
\n+
\n+
1074 MPI_Unpack(p_in, bufferSize, &position, &twoIndexSets, 1, MPI_CHAR, comm_);
\n+
\n+
1076 MPI_Unpack(p_in, bufferSize, &position, &noRemoteSource, 1, MPI_INT, comm_);
\n+
\n+
1078 MPI_Unpack(p_in, bufferSize, &position, &noRemoteDest, 1, MPI_INT, comm_);
\n+
\n+
\n+
\n+
1082 RemoteIndexList* receive=
new RemoteIndexList();
\n+
\n+
1084 RemoteIndexList* send=0;
\n+
\n+
\n+
\n+
\n+
\n+
1090 send =
new RemoteIndexList();
\n+
\n+
1092 unpackIndices(*send, *receive, noRemoteSource, sourcePairs, sourcePublish,
\n+
1093 destPairs, destPublish, p_in, type, &position, bufferSize);
\n+
\n+
\n+
1096 unpackIndices(*receive, noRemoteSource, sourcePairs, sourcePublish,
\n+
1097 p_in, type, &position, bufferSize, fromOurSelf);
\n+
\n+
\n+
\n+
\n+
1102 int oldPos=position;
\n+
\n+
1104 unpackIndices(*receive, noRemoteSource, destPairs, destPublish,
\n+
1105 p_in, type, &position, bufferSize, fromOurSelf);
\n+
\n+
\n+
\n+
\n+
1110 send =
new RemoteIndexList();
\n+
1111 unpackIndices(*send, noRemoteDest, sourcePairs, sourcePublish,
\n+
1112 p_in, type, &position, bufferSize, fromOurSelf);
\n+
\n+
\n+
1115 if(receive->empty() && send->empty()) {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1123 remoteIndices_.insert(std::make_pair(remoteProc,
\n+
1124 std::make_pair(send,receive)));
\n+
\n+
\n+
\n+
\n+
1129 template<
typename T,
typename A>
\n+
1130 template<
bool ignorePublic>
\n+
1131 inline void RemoteIndices<T,A>::buildRemote(
bool includeSelf_)
\n+
\n+
\n+
\n+
1135 MPI_Comm_rank(comm_, &rank);
\n+
1136 MPI_Comm_size(comm_, &procs);
\n+
\n+
\n+
\n+
1140 int sourcePublish, destPublish;
\n+
\n+
\n+
1143 char sendTwo = (source_ != target_);
\n+
\n+
1145 if(procs==1 && !(sendTwo || includeSelf_))
\n+
\n+
\n+
\n+
1149 sourcePublish = (ignorePublic) ? source_->size() : noPublic(*source_);
\n+
\n+
\n+
1152 destPublish = (ignorePublic) ? target_->size() : noPublic(*target_);
\n+
\n+
\n+
\n+
\n+
1157 int maxPublish, publish=sourcePublish+destPublish;
\n+
\n+
\n+
1160 MPI_Allreduce(&publish, &maxPublish, 1, MPI_INT, MPI_MAX, comm_);
\n+
\n+
\n+
1163 PairType** destPairs;
\n+
1164 PairType** sourcePairs =
new PairType*[sourcePublish>0 ? sourcePublish : 1];
\n+
\n+
\n+
1167 destPairs =
new PairType*[destPublish>0 ? destPublish : 1];
\n+
\n+
1169 destPairs=sourcePairs;
\n+
\n+
1171 char** buffer =
new char*[2];
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1180 MPI_Pack_size(maxPublish, type, comm_,
\n+
\n+
1182 MPI_Pack_size(1, MPI_INT, comm_,
\n+
\n+
1184 MPI_Pack_size(1, MPI_CHAR, comm_,
\n+
\n+
\n+
\n+
\n+
\n+
1190 bufferSize += 2 * intSize + charSize;
\n+
\n+
1192 if(bufferSize<=0) bufferSize=1;
\n+
\n+
1194 buffer[0] =
new char[bufferSize];
\n+
1195 buffer[1] =
new char[bufferSize];
\n+
\n+
\n+
\n+
1199 MPI_Pack(&sendTwo, 1, MPI_CHAR, buffer[0], bufferSize, &position,
\n+
\n+
\n+
\n+
1203 MPI_Pack(&sourcePublish, 1, MPI_INT, buffer[0], bufferSize, &position,
\n+
\n+
1205 MPI_Pack(&destPublish, 1, MPI_INT, buffer[0], bufferSize, &position,
\n+
\n+
\n+
\n+
1209 packEntries<ignorePublic>(sourcePairs, *source_, buffer[0], type,
\n+
1210 bufferSize, &position, sourcePublish);
\n+
\n+
\n+
1213 packEntries<ignorePublic>(destPairs, *target_, buffer[0], type,
\n+
1214 bufferSize, &position, destPublish);
\n+
\n+
\n+
\n+
1218 if(sendTwo|| includeSelf_)
\n+
1219 unpackCreateRemote(buffer[0], sourcePairs, destPairs, rank, sourcePublish,
\n+
1220 destPublish, bufferSize, sendTwo, includeSelf_);
\n+
\n+
1222 neighbourIds.erase(rank);
\n+
\n+
1224 if(neighbourIds.size()==0)
\n+
\n+
1226 Dune::dvverb<<rank<<
": Sending messages in a ring"<<std::endl;
\n+
\n+
1228 for(
int proc=1; proc<procs; proc++) {
\n+
\n+
1230 char* p_out = buffer[1-(proc%2)];
\n+
1231 char* p_in = buffer[proc%2];
\n+
\n+
\n+
\n+
1235 MPI_Ssend(p_out, bufferSize, MPI_PACKED, (rank+1)%procs,
\n+
\n+
1237 MPI_Recv(p_in, bufferSize, MPI_PACKED, (rank+procs-1)%procs,
\n+
1238 commTag_, comm_, &status);
\n+
\n+
1240 MPI_Recv(p_in, bufferSize, MPI_PACKED, (rank+procs-1)%procs,
\n+
1241 commTag_, comm_, &status);
\n+
1242 MPI_Ssend(p_out, bufferSize, MPI_PACKED, (rank+1)%procs,
\n+
\n+
\n+
\n+
\n+
\n+
1248 int remoteProc = (rank+procs-proc)%procs;
\n+
\n+
1250 unpackCreateRemote(p_in, sourcePairs, destPairs, remoteProc, sourcePublish,
\n+
1251 destPublish, bufferSize, sendTwo);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1258 MPI_Request* requests=
new MPI_Request[neighbourIds.size()];
\n+
1259 MPI_Request* req=requests;
\n+
\n+
1261 typedef typename std::set<int>::size_type size_type;
\n+
1262 size_type noNeighbours=neighbourIds.size();
\n+
\n+
\n+
1265 for(std::set<int>::iterator neighbour=neighbourIds.begin();
\n+
1266 neighbour!= neighbourIds.end(); ++neighbour) {
\n+
\n+
1268 MPI_Issend(buffer[0], position , MPI_PACKED, *neighbour, commTag_, comm_, req++);
\n+
\n+
\n+
\n+
\n+
1273 for(size_type received=0; received <noNeighbours; ++received)
\n+
\n+
\n+
\n+
1277 MPI_Probe(MPI_ANY_SOURCE, commTag_, comm_, &status);
\n+
1278 int remoteProc=status.MPI_SOURCE;
\n+
\n+
1280 MPI_Get_count(&status, MPI_PACKED, &size);
\n+
\n+
1282 MPI_Recv(buffer[1], size, MPI_PACKED, remoteProc,
\n+
1283 commTag_, comm_, &status);
\n+
\n+
1285 unpackCreateRemote(buffer[1], sourcePairs, destPairs, remoteProc, sourcePublish,
\n+
1286 destPublish, bufferSize, sendTwo);
\n+
\n+
\n+
1289 MPI_Status* statuses =
new MPI_Status[neighbourIds.size()];
\n+
\n+
1291 if(MPI_ERR_IN_STATUS==MPI_Waitall(neighbourIds.size(), requests, statuses)) {
\n+
1292 for(size_type i=0; i < neighbourIds.size(); ++i)
\n+
1293 if(statuses[i].MPI_ERROR!=MPI_SUCCESS) {
\n+
1294 std::cerr<<rank<<
": MPI_Error occurred while receiving message."<<std::endl;
\n+
1295 MPI_Abort(comm_, 999);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1304 if(destPairs!=sourcePairs)
\n+
\n+
\n+
1307 delete[] sourcePairs;
\n+
\n+
\n+
\n+
\n+
\n+
1313 template<
typename T,
typename A>
\n+
1314 inline void RemoteIndices<T,A>::unpackIndices(RemoteIndexList& remote,
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1324 if(remoteEntries==0)
\n+
\n+
\n+
\n+
1328 MPI_Unpack(p_in, bufferSize, position, &index, 1,
\n+
\n+
1330 GlobalIndex oldGlobal=index.global();
\n+
1331 int n_in=0, localIndex=0;
\n+
\n+
\n+
1334 while(localIndex<localEntries) {
\n+
1335 if(local[localIndex]->global()==index.global()) {
\n+
1336 int oldLocalIndex=localIndex;
\n+
\n+
1338 while(localIndex<localEntries &&
\n+
1339 local[localIndex]->global()==index.global()) {
\n+
1340 if(!fromOurSelf || index.local().attribute() !=
\n+
1341 local[localIndex]->local().attribute())
\n+
\n+
1343 remote.push_back(RemoteIndex(index.local().attribute(),
\n+
1344 local[localIndex]));
\n+
\n+
\n+
\n+
\n+
1349 if((++n_in) < remoteEntries) {
\n+
1350 MPI_Unpack(p_in, bufferSize, position, &index, 1,
\n+
\n+
1352 if(index.global()==oldGlobal)
\n+
\n+
1354 localIndex=oldLocalIndex;
\n+
\n+
1356 oldGlobal=index.global();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1364 if (local[localIndex]->global()<index.global()) {
\n+
\n+
\n+
\n+
\n+
1369 if((++n_in) < remoteEntries) {
\n+
1370 MPI_Unpack(p_in, bufferSize, position, &index, 1,
\n+
\n+
1372 oldGlobal=index.global();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1380 while(++n_in < remoteEntries)
\n+
1381 MPI_Unpack(p_in, bufferSize, position, &index, 1,
\n+
\n+
\n+
\n+
\n+
1386 template<
typename T,
typename A>
\n+
1387 inline void RemoteIndices<T,A>::unpackIndices(RemoteIndexList& send,
\n+
1388 RemoteIndexList& receive,
\n+
\n+
1390 PairType** localSource,
\n+
1391 int localSourceEntries,
\n+
1392 PairType** localDest,
\n+
1393 int localDestEntries,
\n+
\n+
\n+
\n+
\n+
\n+
1399 int n_in=0, sourceIndex=0, destIndex=0;
\n+
\n+
\n+
1402 while(n_in<remoteEntries && (sourceIndex<localSourceEntries || destIndex<localDestEntries)) {
\n+
\n+
\n+
1405 MPI_Unpack(p_in, bufferSize, position, &index, 1,
\n+
\n+
\n+
\n+
\n+
1410 while(sourceIndex<localSourceEntries && localSource[sourceIndex]->global()<index.global())
\n+
\n+
\n+
1413 while(destIndex<localDestEntries && localDest[destIndex]->global()<index.global())
\n+
\n+
\n+
\n+
1417 if(sourceIndex<localSourceEntries && localSource[sourceIndex]->global()==index.global())
\n+
1418 send.push_back(RemoteIndex(index.local().attribute(),
\n+
1419 localSource[sourceIndex]));
\n+
\n+
1421 if(destIndex < localDestEntries && localDest[destIndex]->global() == index.global())
\n+
1422 receive.push_back(RemoteIndex(index.local().attribute(),
\n+
1423 localDest[sourceIndex]));
\n+
\n+
\n+
\n+
\n+
1428 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
1431 auto lend = remoteIndices_.end();
\n+
1432 for(
auto lists=remoteIndices_.begin(); lists != lend; ++lists) {
\n+
1433 if(lists->second.first==lists->second.second) {
\n+
\n+
1435 delete lists->second.first;
\n+
\n+
1437 delete lists->second.first;
\n+
1438 delete lists->second.second;
\n+
\n+
\n+
1441 remoteIndices_.clear();
\n+
\n+
\n+
\n+
\n+
1445 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
1448 return remoteIndices_.size();
\n+
\n+
\n+
\n+
1451 template<
typename T,
typename A>
\n+
1452 template<
bool ignorePublic>
\n+
\n+
\n+
\n+
\n+
\n+
1457 ignorePublic!=publicIgnored || !
\n+
\n+
\n+
\n+
1461 buildRemote<ignorePublic>(includeSelf);
\n+
\n+
1463 sourceSeqNo_ = source_->seqNo();
\n+
1464 destSeqNo_ = target_->seqNo();
\n+
\n+
1466 publicIgnored=ignorePublic;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1472 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
1475 return sourceSeqNo_==source_->seqNo() && destSeqNo_ ==target_->seqNo();
\n+
\n+
\n+
\n+
1478 template<
typename T,
typename A>
\n+
1479 template<
bool mode,
bool send>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1486 sourceSeqNo_ = source_->seqNo();
\n+
1487 destSeqNo_ = target_->seqNo();
\n+
\n+
1489 typename RemoteIndexMap::iterator found = remoteIndices_.find(process);
\n+
\n+
1491 if(found == remoteIndices_.end())
\n+
\n+
1493 if(source_ != target_)
\n+
1494 found = remoteIndices_.
insert(found, std::make_pair(process,
\n+
\n+
\n+
\n+
\n+
1499 found = remoteIndices_.insert(found,
\n+
1500 std::make_pair(process,
\n+
1501 std::make_pair(rlist, rlist)));
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1513 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1517 return remoteIndices_.find(proc);
\n+
\n+
\n+
\n+
1520 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1524 return remoteIndices_.begin();
\n+
\n+
\n+
\n+
1527 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1531 return remoteIndices_.end();
\n+
\n+
\n+
\n+
\n+
1535 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1541 const auto rend = remoteIndices_.end();
\n+
\n+
1543 for(
auto rindex = remoteIndices_.begin(), rindex1=ri.remoteIndices_.begin(); rindex!=rend; ++rindex, ++rindex1) {
\n+
1544 if(rindex->first != rindex1->first)
\n+
\n+
1546 if(*(rindex->second.first) != *(rindex1->second.first))
\n+
\n+
1548 if(*(rindex->second.second) != *(rindex1->second.second))
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1554 template<
class T,
class A,
bool mode>
\n+
\n+
1556 RemoteIndexList& rList)
\n+
1557 : rList_(&rList), indexSet_(&indexSet), iter_(rList.beginModify()), end_(rList.end()), first_(true)
\n+
\n+
1559 if(MODIFYINDEXSET) {
\n+
\n+
1561 for(ConstIterator iter=iter_; iter != end_; ++iter)
\n+
1562 glist_.push_back(iter->localIndexPair().global());
\n+
1563 giter_ = glist_.beginModify();
\n+
\n+
\n+
\n+
1567 template<
typename T,
typename A,
bool mode>
\n+
\n+
\n+
1569 : rList_(other.rList_), indexSet_(other.indexSet_),
\n+
1570 glist_(other.glist_), iter_(other.iter_), giter_(other.giter_), end_(other.end_),
\n+
1571 first_(other.first_), last_(other.last_)
\n+
\n+
\n+
\n+
1574 template<
typename T,
typename A,
bool mode>
\n+
\n+
\n+
\n+
1577 if(MODIFYINDEXSET) {
\n+
\n+
1579#ifdef DUNE_ISTL_WITH_CHECKING \n+
1580 if(indexSet_->state()!=
GROUND)
\n+
\n+
\n+
1583 auto giter = glist_.begin();
\n+
1584 auto index = indexSet_->begin();
\n+
\n+
1586 for(
auto iter=rList_->begin(); iter != end_; ++iter) {
\n+
1587 while(index->global()<*giter) {
\n+
\n+
1589#ifdef DUNE_ISTL_WITH_CHECKING \n+
1590 if(index == indexSet_->end())
\n+
\n+
\n+
\n+
\n+
1595#ifdef DUNE_ISTL_WITH_CHECKING \n+
1596 if(index->global() != *giter)
\n+
\n+
\n+
1599 iter->localIndex_ = &(*index);
\n+
\n+
\n+
\n+
\n+
\n+
1604 template<
typename T,
typename A,
bool mode>
\n+
\n+
\n+
\n+
1607 static_assert(!mode,
"Not allowed if the mode indicates that new indices" \n+
1608 "might be added to the underlying index set. Use " \n+
1609 "insert(const RemoteIndex&, const GlobalIndex&) instead");
\n+
\n+
1611#ifdef DUNE_ISTL_WITH_CHECKING \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1622 iter_.insert(index);
\n+
\n+
\n+
\n+
\n+
\n+
1627 template<
typename T,
typename A,
bool mode>
\n+
\n+
\n+
\n+
1630 static_assert(mode,
"Not allowed if the mode indicates that no new indices" \n+
1631 "might be added to the underlying index set. Use " \n+
1632 "insert(const RemoteIndex&) instead");
\n+
1633#ifdef DUNE_ISTL_WITH_CHECKING \n+
1634 if(!first_ && global<last_)
\n+
\n+
\n+
\n+
1638 while(iter_ != end_ && *giter_ < global) {
\n+
\n+
\n+
\n+
\n+
\n+
1644 assert(iter_->localIndexPair().global() != global);
\n+
1645 iter_.insert(index);
\n+
1646 giter_.insert(global);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1652 template<
typename T,
typename A,
bool mode>
\n+
\n+
\n+
\n+
1655#ifdef DUNE_ISTL_WITH_CHECKING \n+
1656 if(!first_ && global<last_)
\n+
\n+
\n+
\n+
\n+
\n+
1662 if(MODIFYINDEXSET) {
\n+
\n+
1664 while(iter_!=end_ && *giter_< global) {
\n+
\n+
\n+
\n+
1668 if(*giter_ == global) {
\n+
\n+
\n+
\n+
\n+
\n+
1674 while(iter_!=end_ && iter_->localIndexPair().global() < global)
\n+
\n+
\n+
1677 if(iter_->localIndexPair().global()==global) {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1688 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
1695 template<
typename T,
typename A>
\n+
\n+
\n+
1702 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1706 const auto end = pmap.end();
\n+
1707 for(
auto process = pmap.begin(); process != end; ++process) {
\n+
1708 const RemoteIndexList* list = send ? process->second.first : process->second.second;
\n+
\n+
1710 map_.insert(std::make_pair(process->first,
\n+
1711 std::pair<ri_iterator, const ri_iterator>(list->
begin(), list->
end())));
\n+
\n+
\n+
\n+
\n+
1715 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
1718 const auto end = map_.end();
\n+
\n+
1720 for(
auto iter = map_.begin(); iter != end;) {
\n+
\n+
\n+
\n+
\n+
\n+
1726 remoteIndex = *current;
\n+
\n+
1728 while(iter->second.first!=iter->second.second && iter->second.first->localIndexPair().global()<index)
\n+
1729 ++(iter->second.first);
\n+
\n+
\n+
1732 if(iter->second.first == iter->second.second)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1742 template<
typename T,
typename A>
\n+
\n+
\n+
1744 const Attribute& attribute)
\n+
\n+
1746 const auto end = map_.end();
\n+
\n+
1748 for(
auto iter = map_.begin(); iter != end;) {
\n+
\n+
\n+
\n+
\n+
\n+
1754 remoteIndex = *current;
\n+
\n+
\n+
1757 while(iter->second.first!=iter->second.second && iter->second.first->localIndexPair().global()<index)
\n+
1758 ++(iter->second.first);
\n+
\n+
\n+
1761 while(iter->second.first!=iter->second.second
\n+
1762 && iter->second.first->localIndexPair().global()==index
\n+
1763 && iter->second.first->localIndexPair().local().attribute()<attribute)
\n+
1764 ++(iter->second.first);
\n+
\n+
\n+
1767 if(iter->second.first == iter->second.second)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1774 attribute_=attribute;
\n+
\n+
\n+
\n+
\n+
1778 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
1781 const auto end = map_.
end();
\n+
\n+
1783 for(
auto iter = map_.begin(); iter != end;) {
\n+
\n+
1785 auto current = iter->second.first;
\n+
1786 auto rend = iter->second.second;
\n+
\n+
\n+
1789 if(iter->second.first->localIndexPair().global()==index_ &&
\n+
1790 (noattribute || iter->second.first->localIndexPair().local().attribute() == attribute_))
\n+
1791 ++(iter->second.first);
\n+
\n+
\n+
1794 if(iter->second.first == iter->second.second)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1803 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
1806 return map_.empty();
\n+
\n+
\n+
\n+
1809 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
\n+
1814 return iterator(map_.begin(), map_.end(), index_);
\n+
\n+
1816 return iterator(map_.begin(), map_.end(), index_,
\n+
\n+
\n+
\n+
\n+
1820 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1824 return iterator(map_.end(), map_.end(), index_);
\n+
\n+
\n+
\n+
1827 template<
typename TG,
typename TA>
\n+
\n+
\n+
1834 template<
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
1838 MPI_Comm_rank(indices.comm_, &rank);
\n+
1839 const auto rend = indices.remoteIndices_.end();
\n+
\n+
1841 for(
auto rindex = indices.remoteIndices_.begin(); rindex!=rend; ++rindex) {
\n+
1842 os<<rank<<
": Process "<<rindex->first<<
":";
\n+
\n+
1844 if(!rindex->second.first->empty()) {
\n+
\n+
\n+
1847 const auto send= rindex->second.first->end();
\n+
\n+
1849 for(
auto index = rindex->second.first->begin();
\n+
1850 index != send; ++index)
\n+
\n+
\n+
\n+
1854 if(!rindex->second.second->empty()) {
\n+
1855 os<<rank<<
": Process "<<rindex->first<<
": "<<
"receive: ";
\n+
\n+
1857 for(
const auto& index : *(rindex->second.second))
\n+
\n+
\n+
1860 os<<std::endl<<std::flush;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
Provides a map between global and local indices.
\n+
Traits classes for mapping types onto MPI_Datatype.
\n+
Provides classes for use as the local index in ParallelIndexSet for distributed computing.
\n+
Implements a singly linked list together with the necessary iterators.
\n+
Standard Dune debug streams.
\n+
A few common exception classes.
\n+
iterator end()
Get an iterator pointing to the end of the list.
Definition sllist.hh:774
\n+
SLListConstIterator< RemoteIndex, Allocator > const_iterator
The constant iterator of the list.
Definition sllist.hh:74
\n+
SLListModifyIterator< GlobalIndex, Allocator > ModifyIterator
The type of the iterator capable of deletion and insertion.
Definition sllist.hh:103
\n+
iterator begin()
Get an iterator pointing to the first element in the list.
Definition sllist.hh:762
\n+
std::ostream & operator<<(std::ostream &s, const bigunsignedint< k > &x)
Definition bigunsignedint.hh:278
\n+
#define DUNE_THROW(E, m)
Definition exceptions.hh:218
\n+
iterator begin()
Get an iterator over the indices positioned at the first index.
\n+
iterator end()
Get an iterator over the indices positioned after the last index.
\n+
TL LocalIndex
The type of the local index, e.g. ParallelLocalIndex.
Definition indexset.hh:239
\n+
const GlobalIndex & global() const
Get the global index.
\n+
LocalIndex & local()
Get the local index.
\n+
TG GlobalIndex
the type of the global index. This type has to provide at least a operator< for sorting.
Definition indexset.hh:226
\n+
@ GROUND
The default mode. Indicates that the index set is ready to be used.
Definition indexset.hh:186
\n+
DVVerbType dvverb(std::cout)
stream for very verbose output.
Definition stdstreams.hh:95
\n+
\n
Dune namespace.
Definition alignedallocator.hh:13
\n-
constexpr size_type cols() const
number of columns
Definition densematrix.hh:715
\n-
constexpr size_type rows() const
number of rows
Definition densematrix.hh:709
\n-
static constexpr int blocklevel
The number of block levels we contain. This is the leaf, that is, 1.
Definition densematrix.hh:178
\n-
Traits::row_type row_type
The type used to represent a row (must fulfill the Dune::DenseVector interface)
Definition densematrix.hh:169
\n-
Traits::size_type size_type
The type used for the index access and size operation.
Definition densematrix.hh:166
\n-
Traits::const_row_reference const_row_reference
The type used to represent a reference to a constant row (usually const row_type &)
Definition densematrix.hh:175
\n-
Traits::row_reference row_reference
The type used to represent a reference to a row (usually row_type &)
Definition densematrix.hh:172
\n-
T type
Definition typetraits.hh:501
\n+
A traits class describing the mapping of types onto MPI_Datatypes.
Definition mpitraits.hh:41
\n+
static MPI_Datatype getType()
Definition mpitraits.hh:48
\n+
Default exception class for range errors.
Definition exceptions.hh:254
\n+
A pair consisting of a global and local index.
Definition indexset.hh:85
\n+
Exception indicating that the index set is not in the expected state.
Definition indexset.hh:205
\n+
Manager class for the mapping between local indices and globally unique indices.
Definition indexset.hh:218
\n+
Class for recomputing missing indices of a distributed index set.
Definition indicessyncer.hh:41
\n+
Base class of all classes representing a communication interface.
Definition parallel/interface.hh:35
\n+
An index present on the local process with an additional attribute flag.
Definition plocalindex.hh:49
\n+
The indices present on remote processes.
Definition remoteindices.hh:189
\n+
const std::set< int > & getNeighbours() const
Definition remoteindices.hh:307
\n+
Dune::RemoteIndex< GlobalIndex, Attribute > RemoteIndex
Type of the remote indices we manage.
Definition remoteindices.hh:231
\n+
RemoteIndices()
Definition remoteindices.hh:977
\n+
friend void fillIndexSetHoles(const G &graph, Dune::OwnerOverlapCopyCommunication< T1, T2 > &oocomm)
\n+
void setIndexSets(const ParallelIndexSet &source, const ParallelIndexSet &destination, const MPI_Comm &comm, const std::vector< int > &neighbours=std::vector< int >())
Set the index sets and communicator we work with.
Definition remoteindices.hh:984
\n+
void free()
Free the index lists.
Definition remoteindices.hh:1429
\n+
friend void repairLocalIndexPointers(std::map< int, SLList< std::pair< typename T1::GlobalIndex, typename T1::LocalIndex::Attribute >, A2 > > &, RemoteIndices< T1, A1 > &, const T1 &)
\n+
ParallelIndexSet::GlobalIndex GlobalIndex
The type of the global index.
Definition remoteindices.hh:215
\n+
void rebuild()
Rebuilds the set of remote indices.
Definition remoteindices.hh:1453
\n+
T ParallelIndexSet
Type of the index set we use, e.g. ParallelLocalIndexSet.
Definition remoteindices.hh:206
\n+
MPI_Comm communicator() const
Get the mpi communicator used.
Definition remoteindices.hh:1696
\n+
LocalIndex::Attribute Attribute
The type of the attribute.
Definition remoteindices.hh:226
\n+
CollectiveIteratorT iterator() const
Get an iterator for colletively iterating over the remote indices of all remote processes.
Definition remoteindices.hh:1690
\n+
void setIncludeSelf(bool includeSelf)
Tell whether sending from indices of the processor to other indices on the same processor is enabled ...
Definition remoteindices.hh:971
\n+
const_iterator end() const
Get an iterator over all remote index lists.
Definition remoteindices.hh:1529
\n+
bool operator==(const RemoteIndices &ri) const
Definition remoteindices.hh:1536
\n+
std::map< int, std::pair< RemoteIndexList *, RemoteIndexList * > > RemoteIndexMap
The type of the map from rank to remote index list.
Definition remoteindices.hh:245
\n+
void setNeighbours(const C &neighbours)
Definition remoteindices.hh:300
\n+
RemoteIndexListModifier< T, A, mode > getModifier(int process)
Get a modifier for a remote index list.
Definition remoteindices.hh:1480
\n+
const ParallelIndexSet & sourceIndexSet() const
Get the index set at the source.
Definition remoteindices.hh:999
\n+
~RemoteIndices()
Destructor.
Definition remoteindices.hh:1014
\n+
Dune::SLList< RemoteIndex, Allocator > RemoteIndexList
The type of the remote index list.
Definition remoteindices.hh:241
\n+
int neighbours() const
Get the number of processors we share indices with.
Definition remoteindices.hh:1446
\n+
CollectiveIterator< T, A > CollectiveIteratorT
The type of the collective iterator over all remote indices.
Definition remoteindices.hh:210
\n+
const ParallelIndexSet & destinationIndexSet() const
Get the index set at destination.
Definition remoteindices.hh:1007
\n+
typename std::allocator_traits< A >::template rebind_alloc< RemoteIndex > Allocator
The type of the allocator for the remote index list.
Definition remoteindices.hh:237
\n+
const_iterator find(int proc) const
Find an iterator over the remote index lists of a specific process.
Definition remoteindices.hh:1515
\n+
bool isSynced() const
Checks whether the remote indices are synced with the indexsets.
Definition remoteindices.hh:1473
\n+
const_iterator begin() const
Get an iterator over all remote index lists.
Definition remoteindices.hh:1522
\n+
ParallelIndexSet::LocalIndex LocalIndex
The type of the local index.
Definition remoteindices.hh:221
\n+
RemoteIndexMap::const_iterator const_iterator
Definition remoteindices.hh:247
\n+
Information about an index residing on another processor.
Definition remoteindices.hh:73
\n+
const Attribute attribute() const
Get the attribute of the index on the remote process.
Definition remoteindices.hh:946
\n+
friend void repairLocalIndexPointers(std::map< int, SLList< std::pair< typename T::GlobalIndex, typename T::LocalIndex::Attribute >, A > > &, RemoteIndices< T, A1 > &, const T &)
\n+
bool operator==(const RemoteIndex &ri) const
Definition remoteindices.hh:934
\n+
T1 GlobalIndex
the type of the global index. This type has to provide at least a operator< for sorting.
Definition remoteindices.hh:90
\n+
T2 Attribute
The type of the attributes. Normally this will be an enumeration like.
Definition remoteindices.hh:99
\n+
IndexPair< GlobalIndex, ParallelLocalIndex< Attribute > > PairType
The type of the index pair.
Definition remoteindices.hh:105
\n+
const PairType & localIndexPair() const
Get the corresponding local index pair.
Definition remoteindices.hh:952
\n+
RemoteIndex()
Parameterless Constructor.
Definition remoteindices.hh:930
\n+
bool operator!=(const RemoteIndex &ri) const
Definition remoteindices.hh:940
\n+
Modifier for adding and/or deleting remote indices from the remote index list.
Definition remoteindices.hh:551
\n+
void repairLocalIndexPointers()
Repair the pointers to the local index pairs.
Definition remoteindices.hh:1575
\n+
Dune::SLList< RemoteIndex, Allocator > RemoteIndexList
The type of the remote index list.
Definition remoteindices.hh:602
\n+
A Allocator
The type of the allocator for the remote index list.
Definition remoteindices.hh:598
\n+
void insert(const RemoteIndex &index)
Insert an index to the list.
Definition remoteindices.hh:1605
\n+
ParallelIndexSet::GlobalIndex GlobalIndex
The type of the global index.
Definition remoteindices.hh:578
\n+
ParallelIndexSet::LocalIndex LocalIndex
The type of the local index.
Definition remoteindices.hh:583
\n+
RemoteIndexList::const_iterator ConstIterator
The type of the remote index list iterator.
Definition remoteindices.hh:612
\n+
SLListModifyIterator< RemoteIndex, Allocator > ModifyIterator
The type of the modifying iterator of the remote index list.
Definition remoteindices.hh:607
\n+
bool remove(const GlobalIndex &global)
Remove a remote index.
Definition remoteindices.hh:1653
\n+
T ParallelIndexSet
Type of the index set we use.
Definition remoteindices.hh:573
\n+
RemoteIndexListModifier()
Default constructor.
Definition remoteindices.hh:676
\n+
LocalIndex::Attribute Attribute
The type of the attribute.
Definition remoteindices.hh:588
\n+
Dune::RemoteIndex< GlobalIndex, Attribute > RemoteIndex
Type of the remote indices we manage.
Definition remoteindices.hh:593
\n+
static constexpr bool MODIFYINDEXSET
If true the index set corresponding to the remote indices might get modified.
Definition remoteindices.hh:568
\n+
A collective iterator for moving over the remote indices for all processes collectively.
Definition remoteindices.hh:708
\n+
CollectiveIterator & operator++()
Definition remoteindices.hh:1779
\n+
iterator end()
Definition remoteindices.hh:1822
\n+
CollectiveIterator(const RemoteIndexMap &map_, bool send)
Constructor.
Definition remoteindices.hh:1703
\n+
bool empty() const
Checks whether there are still iterators in the map.
Definition remoteindices.hh:1804
\n+
void advance(const GlobalIndex &global)
Advances all underlying iterators.
Definition remoteindices.hh:1716
\n+
std::map< int, std::pair< RemoteIndexList *, RemoteIndexList * > > RemoteIndexMap
The type of the map from rank to remote index list.
Definition remoteindices.hh:748
\n+
iterator begin()
Definition remoteindices.hh:1811
\n+
Definition remoteindices.hh:167
\n+
Definition remoteindices.hh:558
\n+
Iterator over the valid underlying iterators.
Definition remoteindices.hh:792
\n+
iterator(const RealIterator &iter, const ConstRealIterator &end, GlobalIndex &index)
Definition remoteindices.hh:799
\n+
iterator(const iterator &other)
Definition remoteindices.hh:817
\n+
const RemoteIndex & operator*() const
Definition remoteindices.hh:838
\n+
Map::iterator ConstRealIterator
Definition remoteindices.hh:795
\n+
iterator & operator++()
Definition remoteindices.hh:822
\n+
const RemoteIndex * operator->() const
Definition remoteindices.hh:850
\n+
bool operator==(const iterator &other) const
Definition remoteindices.hh:856
\n+
int process() const
Definition remoteindices.hh:844
\n+
iterator(const RealIterator &iter, const ConstRealIterator &end, GlobalIndex index, Attribute attribute)
Definition remoteindices.hh:807
\n+
bool operator!=(const iterator &other) const
Definition remoteindices.hh:862
\n+
Map::iterator RealIterator
Definition remoteindices.hh:794
\n+
A constant iterator for the SLList.
Definition sllist.hh:371
\n+
A mutable iterator for the SLList.
Definition sllist.hh:429
\n+
A single linked list.
Definition sllist.hh:44
\n
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,40 +1,48 @@\n dune-common\u00a02.9.0\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-shared_ptr.hh File Reference\n-This file implements several utilities related to std::shared_ptr. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include ![\"$a^H](\"form_2_dark.png\")
![\"$a^T](\"form_3_dark.png\")