3#ifndef DUNE_INDEXSET_HH
4#define DUNE_INDEXSET_HH
29 template<
class TG,
class TL>
37 template<
class TG,
class TL>
38 std::ostream&
operator<<(std::ostream& os,
const IndexPair<TG,TL>& pair);
40 template<
class TG,
class TL>
41 bool operator==(
const IndexPair<TG,TL>&,
const IndexPair<TG,TL>&);
43 template<
class TG,
class TL>
44 bool operator!=(
const IndexPair<TG,TL>&,
const IndexPair<TG,TL>&);
46 template<
class TG,
class TL>
47 bool operator<(
const IndexPair<TG,TL>&,
const IndexPair<TG,TL>&);
49 template<
class TG,
class TL>
50 bool operator>(
const IndexPair<TG,TL>&,
const IndexPair<TG,TL>&);
52 template<
class TG,
class TL>
53 bool operator<=(
const IndexPair<TG,TL>&,
const IndexPair<TG,TL>&);
55 template<
class TG,
class TL>
56 bool operator >=(
const IndexPair<TG,TL>&,
const IndexPair<TG,TL>&);
58 template<
class TG,
class TL>
59 bool operator==(
const IndexPair<TG,TL>&,
const TG&);
61 template<
class TG,
class TL>
62 bool operator!=(
const IndexPair<TG,TL>&,
const TG&);
64 template<
class TG,
class TL>
65 bool operator<(
const IndexPair<TG,TL>&,
const TG&);
67 template<
class TG,
class TL>
68 bool operator>(
const IndexPair<TG,TL>&,
const TG&);
70 template<
class TG,
class TL>
71 bool operator<=(
const IndexPair<TG,TL>&,
const TG&);
73 template<
class TG,
class TL>
74 bool operator >=(
const IndexPair<TG,TL>&,
const TG&);
82 template<
class TG,
class TL>
215 template<
typename TG,
typename TL,
int N=100>
264 :
Father(father), indexSet_(&indexSet)
268 :
Father(other), indexSet_(other.indexSet_)
273 Father::operator==(other);
274 indexSet_ = other.indexSet_;
288 if(indexSet_->state_ !=
RESIZE)
290 <<
"while in RESIZE state!");
482 bool deletedEntries_;
496 template<class TG, class TL,
int N>
566 pair(
const std::size_t& local)
const;
607 std::vector<const IndexPair*> indices_;
615 static bool compare(
const T& t1,
const T& t2){
622 template<
class TG,
class TL>
635 template<
class TG,
class TL>
638 os<<
"{global="<<pair.global_<<
", local="<<pair.local_<<
"}";
642 template<
class TG,
class TL,
int N>
646 Iterator
end = indexSet.
end();
648 for(Iterator index = indexSet.
begin(); index !=
end; ++index)
655 template<
class TG,
class TL>
658 return a.global_==b.global_;
661 template<
class TG,
class TL>
664 return a.global_!=b.global_;
667 template<
class TG,
class TL>
670 return a.global_<b.global_;
673 template<
class TG,
class TL>
676 return a.global_>b.global_;
679 template<
class TG,
class TL>
682 return a.global_<=b.global_;
685 template<
class TG,
class TL>
688 return a.global_>=b.global_;
691 template<
class TG,
class TL>
697 template<
class TG,
class TL>
703 template<
class TG,
class TL>
709 template<
class TG,
class TL>
715 template<
class TG,
class TL>
721 template<
class TG,
class TL>
729 template<
class TG,
class TL>
731 : global_(global), local_(local){}
733 template<
class TG,
class TL>
735 : global_(global), local_(){}
737 template<
class TG,
class TL>
739 : global_(), local_(){}
741 template<
class TG,
class TL>
746 template<
class TG,
class TL>
751 template<
class TG,
class TL>
756 template<
class TG,
class TL>
761 template<
class TG,
class TL,
int N>
763 : state_(
GROUND), seqNo_(0)
766 template<
class TG,
class TL,
int N>
774 "IndexSet has to be in GROUND state, when "
775 <<
"beginResize() is called!");
779 deletedEntries_ =
false;
782 template<
class TG,
class TL,
int N>
784 throw(InvalidIndexSetState)
789 DUNE_THROW(InvalidIndexSetState,
"Indices can only be added "
790 <<
"while in RESIZE state!");
792 newIndices_.push_back(IndexPair(global));
795 template<
class TG,
class TL,
int N>
797 throw(InvalidIndexSetState)
802 DUNE_THROW(InvalidIndexSetState,
"Indices can only be added "
803 <<
"while in RESIZE state!");
805 newIndices_.push_back(IndexPair(global,local));
808 template<
class TG,
class TL,
int N>
810 throw(InvalidIndexSetState){
814 DUNE_THROW(InvalidIndexSetState,
"Indices can only be removed "
815 <<
"while in RESIZE state!");
817 deletedEntries_ =
true;
819 global.markAsDeleted();
822 template<
class TG,
class TL,
int N>
827 DUNE_THROW(InvalidIndexSetState,
"endResize called while not "
828 <<
"in RESIZE state!");
831 std::sort(newIndices_.begin(), newIndices_.end(), IndexSetSortFunctor<TG,TL>());
838 template<
class TG,
class TL,
int N>
839 inline void ParallelIndexSet<TG,TL,N>::merge(){
840 if(localIndices_.size()==0)
842 localIndices_=newIndices_;
845 else if(newIndices_.size()>0 || deletedEntries_)
847 ArrayList<IndexPair,N> tempPairs;
851 iterator old=localIndices_.begin();
852 iterator added=newIndices_.begin();
853 const const_iterator endold=localIndices_.end();
854 const const_iterator endadded=newIndices_.end();
856 while(old != endold && added!= endadded)
858 if(old->local().state()==
DELETED) {
863 if(old->global() < added->global() ||
864 (old->global() == added->global()
867 tempPairs.push_back(*old);
872 tempPairs.push_back(*added);
880 if(old->local().state()!=
DELETED) {
881 tempPairs.push_back(*old);
886 while(added!= endadded)
888 tempPairs.push_back(*added);
891 localIndices_ = tempPairs;
896 template<
class TG,
class TL,
int N>
897 inline const IndexPair<TG,TL>&
901 int low=0, high=localIndices_.size()-1, probe=-1;
905 probe = (high + low) / 2;
906 if(global <= localIndices_[probe].global())
915 if( localIndices_[low].global() != global)
916 DUNE_THROW(RangeError,
"Could not find entry of "<<global);
918 return localIndices_[low];
921 template<
class TG,
class TL,
int N>
922 inline const IndexPair<TG,TL>&
926 int low=0, high=localIndices_.size()-1, probe=-1;
930 probe = (high + low) / 2;
931 if(global <= localIndices_[probe].global())
937 return localIndices_[low];
939 template<
class TG,
class TL,
int N>
943 int low=0, high=localIndices_.size()-1, probe=-1;
947 probe = (high + low) / 2;
948 if(localIndices_[probe].global() >= global)
957 if( localIndices_[low].global() != global)
958 DUNE_THROW(RangeError,
"Could not find entry of "<<global);
960 return localIndices_[low];
963 template<
class TG,
class TL,
int N>
967 int low=0, high=localIndices_.size()-1, probe=-1;
971 probe = (high + low) / 2;
972 if(localIndices_[probe].global() >= global)
978 return localIndices_[low];
980 template<
class TG,
class TL,
int N>
981 inline typename ParallelIndexSet<TG,TL,N>::iterator
984 return iterator(*
this, localIndices_.begin());
988 template<
class TG,
class TL,
int N>
989 inline typename ParallelIndexSet<TG,TL,N>::iterator
992 return iterator(*
this,localIndices_.end());
995 template<
class TG,
class TL,
int N>
996 inline typename ParallelIndexSet<TG,TL,N>::const_iterator
999 return localIndices_.begin();
1003 template<
class TG,
class TL,
int N>
1004 inline typename ParallelIndexSet<TG,TL,N>::const_iterator
1007 return localIndices_.end();
1010 template<
class TG,
class TL,
int N>
1014 DUNE_THROW(InvalidIndexSetState,
"IndexSet has to be in "
1015 <<
"GROUND state for renumberLocal()");
1019 const const_iterator end_ = end();
1022 for(iterator pair=begin(); pair!=end_; index++, ++pair)
1023 pair->local()=index;
1026 template<
class TG,
class TL,
int N>
1032 template<
class TG,
class TL,
int N>
1035 return localIndices_.size();
1041 : indexSet_(indexset), size_(
size),
1042 indices_(size_, static_cast<const IndexPair*>(0))
1044 const_iterator end_ = indexSet_.end();
1046 for(const_iterator pair = indexSet_.begin(); pair!=end_; ++pair) {
1047 assert(pair->local()<size_);
1048 indices_[pair->local()] = &(*pair);
1054 : indexSet_(indexset), size_(0)
1056 const_iterator end_ = indexSet_.end();
1057 for(const_iterator pair = indexSet_.begin(); pair!=end_; ++pair)
1058 size_=std::max(size_,
static_cast<std::size_t
>(pair->local()));
1060 indices_.resize(++size_, 0);
1062 for(const_iterator pair = indexSet_.begin(); pair!=end_; ++pair)
1063 indices_[pair->local()] = &(*pair);
1071 inline const IndexPair<typename I::GlobalIndex, typename I::LocalIndex>*
1074 return indices_[local];
1078 inline const IndexPair<typename I::GlobalIndex, typename I::LocalIndex>&
1081 return indexSet_[global];
1087 return indexSet_.begin();
1093 return indexSet_.end();
1105 return indexSet_.seqNo();
1108 template<
typename TG,
typename TL,
int N,
typename TG1,
typename TL1,
int N1>
1109 bool operator==(
const ParallelIndexSet<TG,TL,N>& idxset,
1110 const ParallelIndexSet<TG1,TL1,N1>& idxset1)
1112 if(idxset.size()!=idxset1.size())
1114 typedef typename ParallelIndexSet<TG,TL,N>::const_iterator Iter;
1116 Iter iter=idxset.begin();
1117 for(Iter1 iter1=idxset1.begin(); iter1 != idxset1.end(); ++iter, ++iter1) {
1118 if(iter1->global()!=iter->global())
1120 typedef typename ParallelIndexSet<TG,TL,N>::LocalIndex PI;
1121 const PI& pi=iter->local(), pi1=iter1->local();
1129 template<
typename TG,
typename TL,
int N,
typename TG1,
typename TL1,
int N1>
1130 bool operator!=(
const ParallelIndexSet<TG,TL,N>& idxset,
1131 const ParallelIndexSet<TG1,TL1,N1>& idxset1)
1133 return !(idxset==idxset1);
Implements a random-access container that can efficiently change size (similar to std::deque)
Provides classes for use as the local index in ParallelIndexSet.
A few common exception classes.
Definition of the DUNE_UNUSED macro for the case that config.h is not available.
#define DUNE_UNUSED_PARAMETER(parm)
A macro to mark intentionally unused function parameters with.
Definition unused.hh:18
std::ostream & operator<<(std::ostream &s, const std::array< T, N > &e)
Output operator for array.
Definition array.hh:28
#define DUNE_THROW(E, m)
Definition exceptions.hh:216
EnableIfInterOperable< T1, T2, bool >::type operator<(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:629
EnableIfInterOperable< T1, T2, bool >::type operator>(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:675
EnableIfInterOperable< T1, T2, bool >::type operator<=(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:652
EnableIfInterOperable< T1, T2, bool >::type operator==(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for equality.
Definition iteratorfacades.hh:233
EnableIfInterOperable< T1, T2, bool >::type operator>=(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:697
EnableIfInterOperable< T1, T2, bool >::type operator!=(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for inequality.
Definition iteratorfacades.hh:255
IndexPair & operator[](const GlobalIndex &global)
Find the index pair with a specific global id.
void beginResize()
Indicate that the index set is to be resized.
ParallelIndexSetState
The states the index set can be in.
Definition indexset.hh:180
void renumberLocal()
Renumbers the local index numbers.
size_t size() const
Get the total number (public and nonpublic) indices.
ArrayList< IndexPair, N >::const_iterator const_iterator
The constant iterator over the pairs.
Definition indexset.hh:305
bool operator()(const IndexPair< TG, TL > &i1, const IndexPair< TG, TL > &i2)
Definition indexset.hh:625
void add(const GlobalIndex &global)
Add an new index to the set.
const_iterator end() const
Get an iterator over the indices positioned after the last index.
const LocalIndex & local() const
Get the local index.
GlobalLookupIndexSet(const ParallelIndexSet &indexset)
Constructor.
TL LocalIndex
the type of the local index.
Definition indexset.hh:119
int seqNo() const
Get the internal sequence number.
static bool compare(const T &t1, const T &t2)
Definition indexset.hh:615
iterator begin()
Get an iterator over the indices positioned at the first index.
Dune::IndexPair< typename I::GlobalIndex, typename I::LocalIndex > IndexPair
Definition indexset.hh:528
iterator end()
Get an iterator over the indices positioned after the last index.
ParallelIndexSet::const_iterator const_iterator
The iterator over the index pairs.
Definition indexset.hh:526
const_iterator begin() const
Get an iterator over the indices positioned at the first index.
const ParallelIndexSetState & state()
Get the state the index set is in.
Definition indexset.hh:316
const IndexPair & operator[](const GlobalIndex &global) const
Find the index pair with a specific global id.
IndexPair()
Construct a new Pair.
I ParallelIndexSet
The type of the index set.
Definition indexset.hh:511
TL LocalIndex
The type of the local index, e.g. ParallelLocalIndex.
Definition indexset.hh:238
void markAsDeleted(const iterator &position)
Mark an index as deleted.
ParallelIndexSet::LocalIndex LocalIndex
The type of the local index.
Definition indexset.hh:516
iterator & operator==(const iterator &other)
Definition indexset.hh:271
IndexPair(const GlobalIndex &global, const LocalIndex &local)
Constructs a new Pair.
void setLocal(int index)
Set the local index.
const GlobalIndex & global() const
Get the global index.
IndexPair & at(const GlobalIndex &global)
Find the index pair with a specific global id.
ParallelIndexSet()
Constructor.
void endResize()
Indicate that the resizing finishes.
~GlobalLookupIndexSet()
Destructor.
const IndexPair * pair(const std::size_t &local) const
Get the index pair corresponding to a local index.
LocalIndex & local()
Get the local index.
size_t size() const
Get the total number (public and nonpublic) indices.
IndexPair(const GlobalIndex &global)
Constructs a new Pair.
TG GlobalIndex
the type of the global index. This type has to provide at least a operator< for sorting.
Definition indexset.hh:225
TG GlobalIndex
the type of the global index.
Definition indexset.hh:106
int seqNo() const
Get the internal sequence number.
iterator(ParallelIndexSet< TG, TL, N > &indexSet, const Father &father)
Definition indexset.hh:263
iterator(const iterator &other)
Definition indexset.hh:267
GlobalLookupIndexSet(const ParallelIndexSet &indexset, std::size_t size)
Constructor.
ParallelIndexSet::GlobalIndex GlobalIndex
The type of the global index.
Definition indexset.hh:521
Dune::IndexPair< GlobalIndex, LocalIndex > IndexPair
The type of the pair stored.
Definition indexset.hh:243
@ RESIZE
Indicates that the index set is currently being resized.
Definition indexset.hh:189
@ GROUND
The default mode. Indicates that the index set is ready to be used.
Definition indexset.hh:185
@ DELETED
Definition localindex.hh:26
@ arraySize
The size of the individual arrays in the underlying ArrayList.
Definition indexset.hh:252
Dune namespace.
Definition alignment.hh:11
constexpr auto size(const Dune::FieldVector< T, i > *, const PriorityTag< 5 > &) -> decltype(std::integral_constant< std::size_t, i >())
Definition hybridutilities.hh:22
A random access iterator for the Dune::ArrayList class.
Definition arraylist.hh:258
A dynamically growing random access list.
Definition arraylist.hh:60
ArrayListIterator< MemberType, N, A > iterator
A random access iterator.
Definition arraylist.hh:106
ConstArrayListIterator< MemberType, N, A > const_iterator
A constant random access iterator.
Definition arraylist.hh:111
A traits class describing the mapping of types onto MPI_Datatypes.
Definition mpitraits.hh:39
Default exception if a function was called while the object is not in a valid state for that function...
Definition exceptions.hh:279
Reference operator*() const
Dereferencing operator.
Definition iteratorfacades.hh:492
A pair consisting of a global and local index.
Definition indexset.hh:84
Exception indicating that the index set is not in the expected state.
Definition indexset.hh:204
Decorates an index set with the possibility to find a global index that is mapped to a specific local...
Definition indexset.hh:506
Manager class for the mapping between local indices and globally unique indices.
Definition indexset.hh:217
The iterator over the pairs.
Definition indexset.hh:258
Definition indexset.hh:614
Definition indexset.hh:624