// Wavelet Analysis Tool
//$Id: Wavelet.hh,v 0.2 2001/08/06 19:37:00 klimenko Exp $
#ifndef WAVELET_HH
#define WAVELET_HH

namespace datacondAPIwat {

//: Lagrange constants
   inline double Lagrange(int, int, double);

//: Polynomial interpolation using Nevill's alghorithm
   double Nevill(int, double*, double*, double);

//: constants which rule the boundary processing
enum BORDER {B_PAD_ZERO, 
	     B_CYCLE, 
	     B_MIRROR, 
	     B_PAD_EDGE, 
	     B_POLYNOM};


//: wavelet types
enum WAVETYPE {HAAR, 
	       DAUBECHIES, 
	       BIORTHOGONAL,
	       DMEYER};

class Wavelet 			// Wavelet base class
{
   public:

// constructors

      //: constructor
      Wavelet(int mH=1, int mL=1, int tree=0, enum BORDER border=B_CYCLE);

      //: copy constructor
      Wavelet(const Wavelet &);

      //: Virtual destructor
      virtual ~Wavelet();

      //: duplicate on heap
      //!return: Wavelet* - duplicate of *this, allocated on heap
      virtual Wavelet* Clone() const;

// access functions

      //: get array index of the first sample for (level,layer)
      virtual int getOffset(int,int);             
      //: get frequency index for (level,layer)
      virtual int convertL2F(int,int);
      //: get layer index for (level,frequency index)
      virtual int convertF2L(int,int);

// mutators

      //: set level
//      virtual void setLevel(int);

      //: check type of wavelet tree
      inline bool BinaryTree(){ return (m_TreeType) ? false : true; }

// data members

      //: wavelet type
      enum WAVETYPE m_WaveType;

      //: borders handling: see BORDER constants definitions above
      enum BORDER m_Border;

      //: wavelet tree type: 0-diadic, 1-binary tree
      int m_TreeType;

      //: current level of decomposition
      int m_Level;              

      //: number of highpass wavelet filter coefficients
      int m_H;

      //: number of lowpass wavelet filter coefficients
      int m_L;

}; // class Wavelet

}; // namespace datacondAPIwat

#endif // WAVELET_HH