// Created on: 1993-04-16
// Created by: Laurent BUCHARD
// Copyright (c) 1993-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.

#include <IntCurveSurface_Intersection.hxx>
#include <IntCurveSurface_IntersectionPoint.hxx>
#include <IntCurveSurface_IntersectionSegment.hxx>
#include <IntCurveSurface_TransitionOnCurve.hxx>
#include <StdFail_NotDone.hxx>

#define PARAMEQUAL(a, b) (std::abs((a) - (b)) < (1e-8))

//================================================================================
IntCurveSurface_Intersection::IntCurveSurface_Intersection()
    : done(false),
      myIsParallel(false)
{
}

//================================================================================
bool IntCurveSurface_Intersection::IsDone() const
{
  return (done);
}

//================================================================================
bool IntCurveSurface_Intersection::IsParallel() const
{
  return (myIsParallel);
}

//================================================================================
int IntCurveSurface_Intersection::NbPoints() const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lpnt.Length();
}

//================================================================================
int IntCurveSurface_Intersection::NbSegments() const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lseg.Length();
}

//================================================================================
const IntCurveSurface_IntersectionPoint& IntCurveSurface_Intersection::Point(const int N) const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lpnt.Value(N);
}

//================================================================================
const IntCurveSurface_IntersectionSegment& IntCurveSurface_Intersection::Segment(const int N) const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lseg.Value(N);
}

//================================================================================
void IntCurveSurface_Intersection::SetValues(const IntCurveSurface_Intersection& Other)
{
  if (Other.done)
  {
    lseg.Clear();
    lpnt.Clear();
    int N = Other.lpnt.Length();
    int i;
    for (i = 1; i <= N; i++)
    {
      lpnt.Append(Other.lpnt.Value(i));
    }
    N = Other.lseg.Length();
    for (i = 1; i <= N; i++)
    {
      lseg.Append(Other.lseg.Value(i));
    }
    done         = true;
    myIsParallel = Other.myIsParallel;
  }
  else
  {
    done         = false;
    myIsParallel = false;
  }
}

//================================================================================
void IntCurveSurface_Intersection::Append(const IntCurveSurface_Intersection& Other,
                                          //					  const double a,
                                          const double,
                                          //					  const double b)
                                          const double)
{
  int i, ni;
  if (Other.done)
  {
    ni = Other.lpnt.Length();
    for (i = 1; i <= ni; i++)
    {
      Append(Other.Point(i));
    }
    ni = Other.lseg.Length();
    for (i = 1; i <= ni; i++)
    {
      Append(Other.Segment(i));
    }
  }
}

//================================================================================
void IntCurveSurface_Intersection::Append(const IntCurveSurface_IntersectionPoint& OtherPoint)
{
  int                               i, ni;
  double                            anu, anv, anw, u, v, w;
  IntCurveSurface_TransitionOnCurve TrOnCurve, anTrOnCurve;
  gp_Pnt                            P, anP;
  ni = lpnt.Length();
  for (i = 1; i <= ni; i++)
  {
    OtherPoint.Values(P, u, v, w, TrOnCurve);
    lpnt(i).Values(anP, anu, anv, anw, anTrOnCurve);
    if (PARAMEQUAL(u, anu))
    {
      if (PARAMEQUAL(v, anv))
      {
        if (PARAMEQUAL(w, anw))
        {
          if (anTrOnCurve == TrOnCurve)
          {
            return;
          }
        }
      }
    }
  }
  lpnt.Append(OtherPoint);
}

//================================================================================
void IntCurveSurface_Intersection::Append(const IntCurveSurface_IntersectionSegment& OtherSegment)
{
  lseg.Append(OtherSegment);
}

//================================================================================
void IntCurveSurface_Intersection::ResetFields()
{
  if (done)
  {
    lseg.Clear();
    lpnt.Clear();
    done         = false;
    myIsParallel = false;
  }
}

//================================================================================
void IntCurveSurface_Intersection::Dump() const
{
  if (done)
  {
    int i, ni;
    ni = lpnt.Length();
    for (i = 1; i <= ni; i++)
    {
      Point(i).Dump();
    }
    ni = lseg.Length();
    for (i = 1; i <= ni; i++)
    {
      Segment(i).Dump();
    }
  }
  else
  {
    std::cout << " Intersection NotDone" << '\n';
  }
}
