mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-08-29 14:00:49 +03:00
b9280b8b27
Removed unused exception classes OSD_Exception_FLT_DIVIDE_BY_ZERO, OSD_Exception_INT_DIVIDE_BY_ZERO, OSD_Exception_FLT_DENORMAL_OPERAND, OSD_Exception_FLT_INEXACT_RESULT, OSD_Exception_FLT_INVALID_OPERATION, OSD_Exception_FLT_OVERFLOW, OSD_Exception_FLT_STACK_CHECK, OSD_Exception_FLT_UNDERFLOW.
134 lines
4.1 KiB
C++
134 lines
4.1 KiB
C++
// Created on: 1992-05-06
|
|
// 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.
|
|
|
|
#ifndef IntCurve_IntConicConic_Tool_HeaderFile
|
|
#define IntCurve_IntConicConic_Tool_HeaderFile
|
|
|
|
|
|
#include <IntCurve_IntImpConicParConic.hxx>
|
|
// #include <IntCurve_IConicPConicTool.hxx>
|
|
#include <IntRes2d_Domain.hxx>
|
|
#include <IntRes2d_Transition.hxx>
|
|
#include <IntRes2d_Position.hxx>
|
|
|
|
|
|
static Standard_Real PIpPI = M_PI + M_PI;
|
|
|
|
//======================================================================
|
|
//========== P R O T O T Y P E S ============
|
|
//======================================================================
|
|
|
|
void Determine_Transition_LC(const IntRes2d_Position,
|
|
gp_Vec2d&,
|
|
const gp_Vec2d&,
|
|
IntRes2d_Transition&,
|
|
const IntRes2d_Position,
|
|
gp_Vec2d&,
|
|
const gp_Vec2d&,
|
|
IntRes2d_Transition&,
|
|
const Standard_Real);
|
|
//======================================================================
|
|
Standard_Real NormalizeOnCircleDomain(const Standard_Real Param,const IntRes2d_Domain& Domain);
|
|
//=====================================================================
|
|
//==== C l a s s e I n t e r v a l !! Specifique !! ========
|
|
//=====================================================================
|
|
class Interval {
|
|
public:
|
|
Standard_Real Binf;
|
|
Standard_Real Bsup;
|
|
Standard_Boolean HasFirstBound;
|
|
Standard_Boolean HasLastBound;
|
|
Standard_Boolean IsNull;
|
|
|
|
Interval();
|
|
Interval(const Standard_Real a,const Standard_Real b);
|
|
Interval(const IntRes2d_Domain& Domain);
|
|
Interval( const Standard_Real a,const Standard_Boolean hf
|
|
,const Standard_Real b,const Standard_Boolean hl);
|
|
Standard_Real Length();
|
|
Interval IntersectionWithBounded(const Interval& Inter);
|
|
};
|
|
|
|
|
|
|
|
//======================================================================
|
|
//== C L A S S E P E R I O D I C I N T E R V A L (Specifique)
|
|
//======================================================================
|
|
class PeriodicInterval {
|
|
public:
|
|
Standard_Real Binf;
|
|
Standard_Real Bsup;
|
|
Standard_Boolean isnull;
|
|
|
|
void SetNull() { isnull=Standard_True; }
|
|
Standard_Boolean IsNull() { return(isnull); }
|
|
|
|
void Complement() { if(!isnull) {
|
|
Standard_Real t=Binf; Binf=Bsup; Bsup=t+PIpPI;
|
|
if(Binf>PIpPI) {
|
|
Binf-=PIpPI;
|
|
Bsup-=PIpPI;
|
|
}
|
|
}
|
|
}
|
|
|
|
Standard_Real Length() { return((isnull)? -100.0: Abs(Bsup-Binf)); }
|
|
|
|
|
|
PeriodicInterval(const IntRes2d_Domain& Domain) {
|
|
isnull=Standard_False;
|
|
if(Domain.HasFirstPoint())
|
|
Binf=Domain.FirstParameter();
|
|
else
|
|
Binf=-1.0;
|
|
if(Domain.HasLastPoint())
|
|
Bsup=Domain.LastParameter();
|
|
else
|
|
Bsup=20.0;
|
|
}
|
|
PeriodicInterval() { isnull=Standard_True; Binf=Bsup=0.0; }
|
|
PeriodicInterval(const Standard_Real a,const Standard_Real b)
|
|
{
|
|
isnull=Standard_False;
|
|
Binf=a;
|
|
Bsup=b;
|
|
if((b-a) < PIpPI)
|
|
this->Normalize();
|
|
}
|
|
void SetValues(const Standard_Real a,const Standard_Real b)
|
|
{
|
|
isnull=Standard_False;
|
|
Binf=a;
|
|
Bsup=b;
|
|
if((b-a) < PIpPI)
|
|
this->Normalize();
|
|
}
|
|
void Normalize() {
|
|
if(!isnull) {
|
|
while(Binf>PIpPI) Binf-=PIpPI;
|
|
while(Binf<0.0) Binf+=PIpPI;
|
|
while(Bsup<Binf) Bsup+=PIpPI;
|
|
while(Bsup>=(Binf+PIpPI)) Bsup-=PIpPI;
|
|
}
|
|
}
|
|
|
|
PeriodicInterval FirstIntersection(PeriodicInterval& I1);
|
|
PeriodicInterval SecondIntersection(PeriodicInterval& I2);
|
|
};
|
|
|
|
|
|
#endif
|