/Users/mourrain/Devel/mmx/shape/include/shape/curve_rational_glue.hpp

Go to the documentation of this file.

/******************************************************************************
* MODULE     : implicit_curve_glue.hpp
* DESCRIPTION: Glue for rational curve
* COPYRIGHT  : (C) 2007 Bernard Mourrain
*******************************************************************************
* This software falls under the GNU general public license and comes WITHOUT
* ANY WARRANTY WHATSOEVER. See the file $TEXMACS_PATH/LICENSE for more details.
* If you don't have this file, write to the Free Software Foundation, Inc.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
******************************************************************************/
#ifndef __MMX_SHAPE_RATIONAL_CURVE_GLUE_HPP
#define __MMX_SHAPE_RATIONAL_CURVE_GLUE_HPP
#include <basix/glue.hpp>
#include <basix/tuple.hpp>
#include <realroot/polynomial_sparse_glue.hpp>
#include <shape/MGXK.hpp>
#include <shape/axel_glue.hpp>
#include <shape/bounding_box.hpp>
namespace mmx {
  namespace shape {
    struct curve_rational_def;

    template<> struct use<curve_rational_def,MGXK> {
      typedef polynomial< rational, with<Sparse,DegRevLex> > Polynomial;
    };
  }
}
#include <shape/curve_rational.hpp>

#define shape_curve_rational shape::curve_rational<rational,shape::MGXK> 
#define Polynomial  polynomial< rational, with<Sparse,DegRevLex> >
#define CURVE shape_curve_rational
//====================================================================
namespace mmx {
  namespace shape {

    inline bool operator ==(const CURVE& v1, const CURVE& v2) {return true;}
    inline bool operator !=(const CURVE& v1, const CURVE& v2) {return !(v1==v2);}
    inline bool exact_eq(const CURVE& v1, const CURVE& v2) {return v1==v2;}
    inline bool exact_neq(const CURVE& v1, const CURVE& v2) {return v1!=v2;}
    
    inline unsigned hash (const CURVE& v) 
    {
      register unsigned i, h= 214365, n=1;
      for (i=0; i<n; i++) h= (h<<1) ^ (h<<5) ^ (h>>27) ;//^ hash(v[i]);
      return h;
    }
    inline unsigned exact_hash (const CURVE& m) {return hash(m);}
    inline unsigned soft_hash (const CURVE& m) {return hash(m);}

    inline syntactic flatten (const CURVE& s) 
    {
      using namespace shape;
      
      syntactic res = "RationalCurve";
      return res;

      if(s.dimension()>1)
        return apply(res, mmx::flatten(s.numerator(0)), mmx::flatten(s.numerator(1)), mmx::flatten(s.denominator()));
      else
        return apply(res, mmx::flatten(s.numerator(0)), mmx::flatten(s.denominator()));
    }

  } //namespace shape
  
 //  inline CURVE shape_curve_rational_string (const string& e1,const string& e2, const string& e3)
//   {
//     return CURVE (Polynomial(as_charp(e1)), Polynomial(as_charp(e2)), Polynomial(as_charp(e3)));
//   }

//   inline CURVE shape_curve_rational_string (const string& e1,const string& e2, const string& e3, const string& e4)
//   {
//     return CURVE (Polynomial(as_charp(e1)), Polynomial(as_charp(e2)), Polynomial(as_charp(e3)), Polynomial(as_charp(e4)));
//   }

  inline CURVE create_curve_rational(const Polynomial& e1,const Polynomial& e2, const Polynomial& e3)
  {
    return CURVE(e1,e2,e3);
  }

  inline CURVE create_curve_rational(const interval<double>& I, const Polynomial& e1,const Polynomial& e2, const Polynomial& e3)
  {
    return CURVE(lower(I), upper(I), e1,e2,e3);
  }

  inline CURVE create_curve_rational(const Polynomial& e1,const Polynomial& e2, const Polynomial& e3,const Polynomial& e4)
  {
    return CURVE(e1,e2,e3,e4);
  }

  inline CURVE create_curve_rational(const interval<double>& I, const Polynomial& e1,const Polynomial& e2, const Polynomial& e3, const Polynomial& e4)
  {
    return CURVE(lower(I), upper(I), e1,e2,e3,e4);
  }

//====================================================================
#undef CURVE
#undef Polynomial
//====================================================================
} // namespace mmx
#endif // __MMX_ALGEBRAIC_CURVE_GLUE_HPP