WaveletD

class description - source file - inheritance tree

class WaveletD : public WaveDWT

    private:

      void Init(int)

    public:

             WaveletD WaveletD(int order = 2, int tree = 0)
             WaveletD WaveletD(int n, int ord, int tree)
             WaveletD WaveletD(int n, int ord, int tree, int brd)
             WaveletD WaveletD(WaveletD&)
         virtual void ~WaveletD()
       static TClass* Class()
         virtual void decompose(int, int)
      virtual TClass* IsA() const
         virtual void reconstruct(int, int)
         virtual void ShowMembers(TMemberInspector& insp, char* parent)
         virtual void Streamer(TBuffer& b)

  Data Members
    private:

      wavereal* h  pointer to array of Daubechies filter coefficients.

Class Description

void decompose(int level,int layer)

 Does one step of the Daubechies decomposition transform.

void reconstruct(int level,int layer)

 Does one step of the Daubechies reconstruction transform.

~WaveletD()

 Destructor.

WaveletD(int ndw, int ist):WaveDWT(1,ist)

 Same as WaveletD(int ndw), 'ist' selects the type of transformation:
 wavelet tree or wavelet binary tree.

WaveletD(int m, int ndw, int ist):WaveDWT(m,ist)

 Two last parameters are the same as for the constructor with two parameters.
 First parameter is the number of samples in the wavelet domain series.

WaveletD(int m,int ndw,int ist,int brd):WaveDWT(m,ist,brd)

 First three parameters are the same as for the constructor with
 three parameters. The fourth parameter selects type of data
 boundaries processing.

void Init(int ndw)

Inline Functions

            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)
           WaveletD WaveletD(WaveletD&)

ROOT page - Class index - Top of the page

This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.