// Created on: 1992-05-27
// Created by: Laurent BUCHARD
// Copyright (c) 1992-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 "StdFail_NotDone.hxx"
#include "Standard_OutOfRange.hxx"

inline bool IntRes2d_Intersection::IsDone() const
{
  return done;
}

//----------------------------------------------------------------------
inline IntRes2d_Intersection::IntRes2d_Intersection()
{
  done = reverse = false;
}

//----------------------------------------------------------------------
inline IntRes2d_Intersection::IntRes2d_Intersection(const IntRes2d_Intersection& Other)
{
  done = reverse = false;
  lpnt           = Other.lpnt;
  lseg           = Other.lseg;
}

//----------------------------------------------------------------------
inline bool IntRes2d_Intersection::IsEmpty() const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return ((lpnt.Length() == 0) && (lseg.Length() == 0));
}

//----------------------------------------------------------------------
inline int IntRes2d_Intersection::NbPoints() const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lpnt.Length();
}

//----------------------------------------------------------------------
inline const IntRes2d_IntersectionPoint& IntRes2d_Intersection::Point(const int N) const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lpnt(N);
}

//----------------------------------------------------------------------
inline int IntRes2d_Intersection::NbSegments() const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lseg.Length();
}

//----------------------------------------------------------------------
inline const IntRes2d_IntersectionSegment& IntRes2d_Intersection::Segment(const int N) const
{
  if (!done)
  {
    throw StdFail_NotDone();
  }
  return lseg(N);
}

//----------------------------------------------------------------------
inline void IntRes2d_Intersection::Append(const IntRes2d_IntersectionSegment& Seg)
{
  lseg.Append(Seg);
}

//----------------------------------------------------------------------
inline void IntRes2d_Intersection::Append(const IntRes2d_IntersectionPoint& Pnt)
{
  lpnt.Append(Pnt);
}

//----------------------------------------------------------------------
inline void IntRes2d_Intersection::ResetFields()
{
  if (done)
  {
    lseg.Clear();
    lpnt.Clear();
    done = false;
  }
}

//----------------------------------------------------------------------
inline void IntRes2d_Intersection::SetReversedParameters(const bool flag)
{
  reverse = flag;
}

//----------------------------------------------------------------------
inline bool IntRes2d_Intersection::ReversedParameters() const
{
  return (reverse);
}