//  Cartesian Point and Distance implementation
//  -------------------------------------------

#include "global.hpp"
#include "Cartesian.hpp"
/*
  template<int DIM>

   Distance<DIM>::Distance<DIM>()  {for (int dm = 0; dm < DIM; ++dm) value[dm]=0;} 

   Distance<1>::Distance<1> (DOUBLE x)         
                {value[0] = x;}
   Distance<2>::Distance<2> (DOUBLE x, DOUBLE y)
                {value[0] = x; value[1] = y;}
   Distance<3>::Distance<3> (DOUBLE x, DOUBLE y, DOUBLE z)
                {value[0] = x; value[1] = y; value[2] = z;}

*/
   DISTANCE<3> Distance<3>::ZERO(0,0,0);
   DISTANCE<2> Distance<2>::ZERO(0,0); 
   DISTANCE<1> Distance<1>::ZERO(0);

   DISTANCE<3> Distance<3>::ONE(1,1,1);
   DISTANCE<2> Distance<2>::ONE(1,1); 
   DISTANCE<1> Distance<1>::ONE(1);

   POINT<3>  Point<3>::ORIGIN(0,0,0);
   POINT<2>  Point<2>::ORIGIN(0,0);
   POINT<1>  Point<1>::ORIGIN(0);
/*
   Point<1>::Point<1> (DOUBLE x) 
               {value[0] = x;}    
   Point<2>::Point<2> (DOUBLE x, DOUBLE y) 
               {value[0] = x; value[1] = y;}    
   Point<3>::Point<3> (DOUBLE x, DOUBLE y, DOUBLE z) 
               {value[0] = x; value[1] = y; value[2] = z;}    
*/