Go to the documentation of this file.
6 #ifndef aglowavSpace_hh
7 #define aglowavSpace_hh
27 template<
class F = concepts::Real>
41 template<
class F = concepts::Real>
47 virtual void skip(uint lvl) = 0;
55 template<
class F = concepts::Real>
62 virtual uint
nlvl()
const = 0;
75 template<
class F = concepts::Real>
95 inline bool eos()
const {
return sptr_[0] ? 0 : 1;}
112 template<
class F = concepts::Real>
151 template<
class F = concepts::Real>
174 std::ostream&
info(std::ostream& os)
const;
211 os <<
"aglowav::" <<
concepts::typeOf(*
this)<<
"(dim = " << dim_ <<
", nlevel = " << nlvl_;
212 return os <<
", nElement = " << nelm_ <<
')';
217 #endif // aglowavSpace_hh
~BiHaar3dDFSScan()
Destructor.
Haar3d000< F > ** sptr_
Stack pointer.
Haar3d000< F > ** stk_
Begin of the stack.
Scanner of the Haar3d space ("breadth" first search (bfs)) (1.
BiHaar3dDFSScan(const BiHaar3dDFSScan< F > &sc)
Copy constructor.
virtual Haar3dBFSScan< F > * bfsscan() const =0
Scanner ("breadth" first search (1. parent, 2. children))
Haar3d000< F > & operator++(int)
Next element.
Abstract class for a space.
BiHaar3dDFSScan< F > * dfsscan() const
Scanner (depth first search (1. children, 2. parent))
Haar3d000< F > & operator++(int)
Next element.
BiHaar3dDFSScan(Haar3d000< F > *elm, uint ht)
Constructor.
Scanner of the Haar3d space (depth first search (dfs)) (1.
Agglomerated binary wavelet space.
void destructor_(Haar3d000< F > *elm)
Recursive destructor.
Haar3d000< F > ** sptr_
Stack pointer.
BiHaar3dBFSScan(const BiHaar3dBFSScan< F > &sc)
Copy constructor.
Binary node for the cluster and Haar wavelet agglomeration algorithm.
Abstract space element for the agglomerated wavelets.
Key of the wavelet element.
virtual Haar3dXXX< F > & operator++(int)=0
Next element.
std::ostream & info(std::ostream &os) const
Information about the space.
uint nlvl() const
Maximal number of levels.
virtual Haar3dDFSScan< F > * dfsscan() const =0
Scanner (depth first search (1. children, 2. parent))
Binary space element for the agglomerated wavelets.
An abstract class for scanning a mesh (a set of cells) or a space (a set of elements).
uint dim() const
Dimenstion of the space.
~BiHaar3dBFSScan()
Destructor.
Agglomerated wavelet space.
Haar3d000< F > ** stk_
Begin of the stack.
bool eos() const
End of scan.
Scanner of the BiHaar3d space ("breadth" first search (bfs)) (1.
uint nelm_
Space elements.
uint dim_
Space dimension.
void skip(uint lvl)
Skips the levels l > lvl of the subtree.
BiHaar3d(BiTree< BiClNode00< F > > &tree)
Constructor.
uint ht_
Height of the stack.
virtual Haar3dXXX< F > & operator++(int)=0
Next element.
uint ht_
Height of the stack.
Used for the aglowav classes for the boundary element method.
std::string typeOf(const T &t)
Return the typeid name of a class object.
BiHaar3dBFSScan< F > * scan() const
Scanner (same as bfsscan())
bool eos() const
End of scan.
BiHaar3dDFSScan< F > * clone() const
New scanner.
uint nelm() const
Number of elements.
virtual uint nlvl() const =0
Maximal number of levels.
Haar3d000< F > * elm_
Root of the wavelet tree.
BiHaar3dBFSScan< F > * bfsscan() const
Scanner ("breadth" first search (1. parent, 2. children))
BiHaar3dBFSScan(Haar3d000< F > *elm, uint ht)
Constructor.
Scanner of the BiHaar3d space (depth first search (dfs)) (1.
BiHaar3dBFSScan * clone() const
New scanner.
double Real
Type normally used for a floating point number.
virtual ~Haar3d()
Destructor.
uint nlvl_
Maximal number of levels.
Haar3d000< F > * constructor_(BiClNode00< F > *nd, concepts::Real *m, typename Haar3dXXX< F, 2 >::Key &key)
Recursive constructor.
virtual void skip(uint lvl)=0
Skips the levels of the subtree.