/*
----
This file is part of SECONDO.

Copyright (C) 2004, University in Hagen, Department of Computer Science,
Database Systems for New Applications.

SECONDO is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

SECONDO is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with SECONDO; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
----

//[_] [\_]
//characters   [1]  verbatim:  [$]  [$]
//characters   [2]  formula:  [$]  [$]
//characters   [3]  capital:  [\textsc{] [}]
//characters   [4]  teletype:  [\texttt{] [}]

1 Header file "DistFunction.h"[4]

March-October 2014, Marius Haug

1.1 Overview

This file contains the implementation of the distance function needed by the
MMMTree.
The classes ~DistCount~, ~IntDist~, ~PointDist~ and ~StringDist~ are orginally
from "MMRTreeAlgebra.cpp".

1.2 Includes

*/
#include <limits>
#include "Algebras/Spatial/Point.h"
#include "StandardTypes.h"
#include "StringUtils.h"
#include "Algebras/TupleIdentifier/TupleIdentifier.h"
#include "Algebras/GeneralTree/DistfunReg.h"
#include "Algebras/Picture/PictureAlgebra.h"
#include "Algebras/Temporal/TemporalAlgebra.h"

namespace clusterdbscanalg {

/*
1.3 Declarations and definition of the class ~DistCount~

*/
 class DistCount
 {
  public: 
   DistCount() { cnt = 0; }
      
   void reset() const { cnt =0; }

   size_t getCount() const{ return cnt; }

  protected:
   mutable size_t cnt;
 };
 
/*
1.4 Declarations and definition of the class ~IntDist~

*/
 class IntDist: public DistCount
 {
  public:

   double operator()(const std::pair<CcInt*,TupleId>& p1
    ,const std::pair<CcInt*,TupleId>& p2)
   {
    DistCount::cnt++;
    assert(p1.first);
    assert(p2.first);
  
    if(!p1.first->IsDefined() && !p2.first->IsDefined())
    {
     return 0;
    }
   
    if(!p1.first->IsDefined() || !p2.first->IsDefined())
    {
     return std::numeric_limits<double>::max();
    }
   
    int i1 = p1.first->GetValue();
    int i2 = p2.first->GetValue();
    int c = i1-i2;
   
    return c<0?-c:c;
   }

   std::ostream& print(const std::pair<CcInt*,TupleId>& p, std::ostream& o)
   {
    o << *(p.first);
    return o;
   }
 };
 
/*
1.5 Declarations and definition of the class ~RealDist~

*/
 class RealDist: public DistCount
 {
  public:

   double operator()(const std::pair<CcReal*,TupleId>& p1
    ,const std::pair<CcReal*,TupleId>& p2)
   {
    DistCount::cnt++;
    assert(p1.first);
    assert(p2.first);
  
    if(!p1.first->IsDefined() && !p2.first->IsDefined())
    {
     return 0;
    }
   
    if(!p1.first->IsDefined() || !p2.first->IsDefined())
    {
     return std::numeric_limits<double>::max();
    }
   
    int i1 = p1.first->GetValue();
    int i2 = p2.first->GetValue();
    int c = i1-i2;
   
    return c<0?-c:c;
   }

   std::ostream& print(const std::pair<CcReal*,TupleId>& p, std::ostream& o)
   {
    o << *(p.first);
    return o;
   }
 };
 
/*
1.6 Declarations and definition of the class ~PointDist~

*/
 template<bool useGeoid>
 class PointDist: public DistCount
 {
  public:
  
   double operator()(const std::pair<Point*,TupleId>& p1
    ,const std::pair<Point*,TupleId>& p2)
   {
    cnt++;
    assert(p1.first);
    assert(p2.first);
    
    if(!p1.first->IsDefined() && !p2.first->IsDefined())
    {
     return 0;
    }
    
    if(!p1.first->IsDefined() || !p2.first->IsDefined())
    {
     return std::numeric_limits<double>::max();
    }
    Geoid* geoid = (useGeoid ? new Geoid(true) : 0);
    double result = p1.first->Distance(*(p2.first), geoid);
    if (geoid) {
       geoid->DeleteIfAllowed();
     }
    return result;
   }
     
   std::ostream& print(const std::pair<Point*,TupleId>& p, std::ostream& o)
   {
    o << *(p.first);
    return o;
   }
 };
 
/*
1.7 Declarations and definition of the class ~StringDist~

*/
 class StringDist: public DistCount
 {
  public:
  
   double operator()(const std::pair<CcString*,TupleId>& p1
    ,const std::pair<CcString*,TupleId>& p2)
   {
    cnt++;
    assert(p1.first);
    assert(p2.first);
   
    if(!p1.first->IsDefined() && !p2.first->IsDefined())
    {
     return 0;
    }
    
    if(!p1.first->IsDefined() || !p2.first->IsDefined())
    {
     return std::numeric_limits<double>::max();
    }
    
    return stringutils::ld(p1.first->GetValue(), p2.first->GetValue());
   }
     
   std::ostream& print(const std::pair<CcString*,TupleId>& p, std::ostream& o)
   {
    o << *(p.first);
    return o;
   }
 };
 
/*
1.8 Declarations and definition of the class ~CustomDist~

*/ 
 template<class T, class R>
 class CustomDist: public DistCount
 { 
  private:
   QueryProcessor* qp;
   Supplier fun;
 
  public:  
   void initialize(QueryProcessor* queryProcessor, Supplier function)
   {
    qp = queryProcessor;
    fun = function;
   }
   
   double operator()(const std::pair<T,TupleId>& p1
    ,const std::pair<T,TupleId>& p2)
   {
    cnt++;
    assert(p1.first);
    assert(p2.first);
   
    if(!p1.first->IsDefined() && !p2.first->IsDefined())
    {
     return 0;
    }
    
    if(!p1.first->IsDefined() || !p2.first->IsDefined())
    {
     return std::numeric_limits<double>::max();
    }
    
    Word funRes;
    ArgVectorPointer vector;
    vector = qp->Argument(fun);
    ((*vector)[0]).setAddr(p1.first);
    ((*vector)[1]).setAddr(p2.first);
    qp->Request(fun, funRes);
    
    R* result;
    result = (R*) funRes.addr;
        
    double c = result->GetValue();
    return c < 0 ? -c : c;
   }
     
   std::ostream& print(const std::pair<T,TupleId>& p, std::ostream& o)
   {
    o << *(p.first);
    return o;
   }
 };
 
/*
1.8 Declarations and definition of the class ~TupleDist~

*/ 
template<class R>
class TupleDist: public DistCount {
  private:
  QueryProcessor* qp;
  Supplier fun;
 
  public:  
  void initialize(QueryProcessor* queryProcessor, Supplier function) {
    qp = queryProcessor;
    fun = function;
  }

  double operator() (const std::pair<Tuple*, TupleId>& p1,
                     const std::pair<Tuple*, TupleId>& p2) {
    cnt++;
    assert(p1.first);
    assert(p2.first);
    Word funRes;
    ArgVectorPointer vector;
    vector = qp->Argument(fun);
    ((*vector)[0]).setAddr(p1.first);
    ((*vector)[1]).setAddr(p2.first);
    qp->Request(fun, funRes);
    R* result;
    result = (R*)funRes.addr;
    return result->GetValue();
  }

  std::ostream& print(const std::pair<Tuple*, TupleId>& p, std::ostream& o) {
    o << *(p.first);
    return o;
  }
};

/*
1.9 Declarations and definition of the class ~PictureDist~

*/
 class PictureDist: public DistCount
 {
  private:
   bool init;
   gta::DistfunInfo df;
     
  public:
   
   PictureDist()
   {
    init = false;
   };
   
   double operator()(const std::pair<Picture*,TupleId>& p1
    ,const std::pair<Picture*,TupleId>& p2)
   {
    cnt++;
    assert(p1.first);
    assert(p2.first);
   
    if(!p1.first->IsDefined() && !p2.first->IsDefined())
    {
     return 0;
    }
    
    if(!p1.first->IsDefined() || !p2.first->IsDefined())
    {
     return std::numeric_limits<double>::max();
    }
    
    if(!gta::DistfunReg::isInitialized())
    {
     gta::DistfunReg::initialize();
    }
    
    if(!init)
    {
     gta::DistDataId id = gta::DistDataReg::getId(Picture::BasicType()
      ,gta::DistDataReg::defaultName(Picture::BasicType()));
     
     df = gta::DistfunReg::getInfo(gta::DFUN_DEFAULT, id);
     
     init = true;
    }
    
    double distance;
    gta::DistData* dd1 = df.getData(p1.first);
    gta::DistData* dd2 = df.getData(p2.first); 
    df.dist(dd1, dd2, distance);
    delete dd1;
    delete dd2;
    
    return distance;
   }
     
   std::ostream& print(const std::pair<Picture*,TupleId>& p, std::ostream& o)
   {
    o << *(p.first);
    return o;
   }
 };

 template <unsigned int dim>
 class RectDist: public DistCount{
    public:
      double operator()(const Rectangle<dim>* r1, const Rectangle<dim>* r2){
         DistCount::cnt++;
         if(!r1->IsDefined() && !r2->IsDefined()){
           return 0;
         }
         if(!r1->IsDefined() || !r2->IsDefined()){
           return std::numeric_limits<double>::max();
         }
         return r1->Distance(*r2);
      } 
      double operator()(const std::pair<Rectangle<dim>*, TupleId>& p1,
                        const std::pair<Rectangle<dim>*, TupleId>& p2){
         return operator()(p1.first, p2.first);
      }   
 }; 


/*
1.6 Declarations and definition of the class ~MPointDist~

*/
template<bool useGeoid>
class MPointDist: public DistCount {
 public:

  double operator()(const std::pair<temporalalgebra::MPoint*, TupleId>& mp1,
                    const std::pair<temporalalgebra::MPoint*, TupleId>& mp2) {
    cnt++;
    assert(mp1.first);
    assert(mp2.first);
    if (!mp1.first->IsDefined() && !mp2.first->IsDefined()) {
      return 0;
    }
    if (!mp1.first->IsDefined() || !mp2.first->IsDefined()) {
      return std::numeric_limits<double>::max();
    }
    Geoid* geoid = (useGeoid ? new Geoid(true) : 0);
    datetime::DateTime duration(0, 3600000, datetime::durationtype);
    double result =temporalalgebra::DistanceComputation<temporalalgebra::MPoint,
       temporalalgebra::UPoint>::DistanceAvg(*(mp1.first), *(mp2.first), 
                                             duration, true, geoid);
    if (geoid) {
      geoid->DeleteIfAllowed();
    }
    return result;
  }
    
  std::ostream& print(const std::pair<temporalalgebra::MPoint*, TupleId>& mp, 
                      std::ostream& o) {
    o << *(mp.first);
    return o;
  }
};

/*
1.6 Declarations and definition of the class ~CUPointDist~

*/
template<bool useGeoid>
class CUPointDist: public DistCount {
 public:

  double operator()(const std::pair<temporalalgebra::CUPoint*, TupleId>& cup1,
                    const std::pair<temporalalgebra::CUPoint*, TupleId>& cup2) {
    cnt++;
    assert(cup1.first);
    assert(cup2.first);
    if (!cup1.first->IsDefined() && !cup2.first->IsDefined()) {
      return 0;
    }
    if (!cup1.first->IsDefined() || !cup2.first->IsDefined()) {
      return std::numeric_limits<double>::max();
    }
    Geoid* geoid = (useGeoid ? new Geoid(true) : 0);
    datetime::DateTime duration(0, 3600000, datetime::durationtype);
    double result = cup1.first->DistanceAvg(*(cup2.first), duration, true, 
                                            geoid);
    if (geoid) {
      geoid->DeleteIfAllowed();
    }
    return result;
  }
    
  std::ostream& print(const std::pair<temporalalgebra::CUPoint*, TupleId>& cup,
                      std::ostream& o) {
    o << *(cup.first);
    return o;
  }
};

/*
1.6 Declarations and definition of the class ~CMPointDist~

*/
template<bool useGeoid>
class CMPointDist: public DistCount {
 public:

  double operator()(const std::pair<temporalalgebra::CMPoint*, TupleId>& cmp1,
                    const std::pair<temporalalgebra::CMPoint*, TupleId>& cmp2) {
    cnt++;
    assert(cmp1.first);
    assert(cmp2.first);
    if (!cmp1.first->IsDefined() && !cmp2.first->IsDefined()) {
      return 0;
    }
    if (!cmp1.first->IsDefined() || !cmp2.first->IsDefined()) {
      return std::numeric_limits<double>::max();
    }
    Geoid* geoid = (useGeoid ? new Geoid(true) : 0);
    datetime::DateTime duration(0, 3600000, datetime::durationtype);
    double result = temporalalgebra::DistanceComputation<
               temporalalgebra::CMPoint, temporalalgebra::CUPoint>::DistanceAvg(
                           *(cmp1.first), *(cmp2.first), duration, true, geoid);
    if (geoid) {
      geoid->DeleteIfAllowed();
    }
    return result;
  }
    
  std::ostream& print(const std::pair<temporalalgebra::CMPoint*, TupleId>& cmp,
                      std::ostream& o) {
    o << *(cmp.first);
    return o;
  }
};
}