3 #ifndef DUNE_BASEARRAY_HH
4 #define DUNE_BASEARRAY_HH
13 #include <dune/common/iteratorfacades.hh>
39 template<
class B,
class A=std::allocator<B> >
61 #ifdef DUNE_ISTL_WITH_CHECKING
62 if (i>=
n) DUNE_THROW(
ISTLError,
"index out of range");
70 #ifdef DUNE_ISTL_WITH_CHECKING
71 if (i>=
n) DUNE_THROW(
ISTLError,
"index out of range");
79 :
public RandomAccessIteratorFacade<RealIterator<T>, T>
141 B& dereference ()
const
146 void advance(std::ptrdiff_t d)
270 template<
class B,
class A=std::allocator<B> >
360 template<
class B,
class A=std::allocator<B> >
398 new (this->
p) B[this->
n];
414 new (this->
p) B[this->
n];
434 new (this->
p) B[this->
n];
460 if (this->
n==_n)
return;
471 new (this->
p) B[this->
n];
496 new (this->
p) B[this->
n];
512 return this->
operator=(static_cast<const base_array&>(a));
542 template<
class B,
class A=std::allocator<B> >
571 DUNE_THROW(
ISTLError,
"index "<<i<<
" not in compressed array");
587 DUNE_THROW(
ISTLError,
"index "<<i<<
" not in compressed array");
595 :
public BidirectionalIteratorFacade<RealIterator<T>, T>
613 : p(_p), j(_j), i(_i)
620 : p(it.p), j(it.j), i(it.i)
677 B& dereference ()
const