A.I.M.S algorithms


polynomial.h
Go to the documentation of this file.
1 /* This software and supporting documentation are distributed by
2  * Institut Federatif de Recherche 49
3  * CEA/NeuroSpin, Batiment 145,
4  * 91191 Gif-sur-Yvette cedex
5  * France
6  *
7  * This software is governed by the CeCILL-B license under
8  * French law and abiding by the rules of distribution of free software.
9  * You can use, modify and/or redistribute the software under the
10  * terms of the CeCILL-B license as circulated by CEA, CNRS
11  * and INRIA at the following URL "http://www.cecill.info".
12  *
13  * As a counterpart to the access to the source code and rights to copy,
14  * modify and redistribute granted by the license, users are provided only
15  * with a limited warranty and the software's author, the holder of the
16  * economic rights, and the successive licensors have only limited
17  * liability.
18  *
19  * In this respect, the user's attention is drawn to the risks associated
20  * with loading, using, modifying and/or developing or reproducing the
21  * software by the user in light of its specific status of free software,
22  * that may mean that it is complicated to manipulate, and that also
23  * therefore means that it is reserved for developers and experienced
24  * professionals having in-depth computer knowledge. Users are therefore
25  * encouraged to load and test the software's suitability as regards their
26  * requirements in conditions enabling the security of their systems and/or
27  * data to be ensured and, more generally, to use and operate it in the
28  * same conditions as regards security.
29  *
30  * The fact that you are presently reading this means that you have had
31  * knowledge of the CeCILL-B license and that you accept its terms.
32  */
33 
34 
35 #ifndef AIMS_RESAMPLING_POLYNOMIAL_H
36 #define AIMS_RESAMPLING_POLYNOMIAL_H
37 
39 #include <aims/vector/vector.h>
41 
44 namespace aimsalgo
45 {
46  template <class T,unsigned D>
47  class Polynomial : Samplable<T,D>
48  {
49  public:
50  Polynomial(std::vector<T> * coefficients, T orderStep = 1);
51  virtual ~Polynomial();
52 
53  virtual void setCoefficients(std::vector<T> * coefficients);
54  virtual std::vector<T> * getCoefficients();
55  virtual void setOrderStep(T orderStep);
56  virtual T getOrderStep();
57  virtual bool contains(AimsVector<T,D> & vector);
58  virtual T resolve(AimsVector<T,D> & vector);
59  virtual void resetDimensionOrders();
60  virtual AimsVector<T,D> getDimensionOrders(unsigned index);
61  virtual T getValue(AimsVector<T,D> & vector, AimsVector<T,D> & dimensionOrders, T coefficient);
62  virtual void displayEquation();
63 
64  private:
65  unsigned _order;
66  unsigned _coefficientsTheoricSize;
67  T _orderStep;
68  std::vector<T> * _coefficients;
69  std::vector<AimsVector<T,D> > * _dimensionOrders;
70  };
71 
72 }
73 
74 #endif
virtual void setOrderStep(T orderStep)
virtual T resolve(AimsVector< T, D > &vector)
virtual std::vector< T > * getCoefficients()
Polynomial(std::vector< T > *coefficients, T orderStep=1)
virtual T getValue(AimsVector< T, D > &vector, AimsVector< T, D > &dimensionOrders, T coefficient)
virtual void displayEquation()
virtual T getOrderStep()
virtual AimsVector< T, D > getDimensionOrders(unsigned index)
virtual void setCoefficients(std::vector< T > *coefficients)
virtual void resetDimensionOrders()
virtual bool contains(AimsVector< T, D > &vector)