mirror of
https://github.com/Open-Cascade-SAS/OCCT.git
synced 2026-09-08 13:48:09 +08:00
Testing - Migrate QA DRAW tests to GTest (#823)
- Deletion of 20 legacy DRAW test files (.tcl format) from tests/bugs/ directories - Addition of 15 new GTest C++ test files across multiple modules - Removal of corresponding QA command implementations from TKQADraw
This commit is contained in:
Pasukhin Dmitry
@@ -5,5 +5,7 @@ set(OCCT_TKG2d_GTests_FILES
|
||||
Geom2d_BSplineCurve_Test.cxx
|
||||
Geom2d_BezierCurve_Test.cxx
|
||||
Geom2d_OffsetCurve_Test.cxx
|
||||
Geom2dAPI_InterCurveCurve_Test.cxx
|
||||
Geom2dGcc_Circ2d2TanOn_Test.cxx
|
||||
Geom2dGcc_Circ2d2TanRad_Test.cxx
|
||||
)
|
||||
|
||||
@@ -0,0 +1,75 @@
|
||||
// Copyright (c) 2025 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 <Geom2d_Circle.hxx>
|
||||
#include <Geom2d_TrimmedCurve.hxx>
|
||||
#include <Geom2dAPI_InterCurveCurve.hxx>
|
||||
#include <IntRes2d_IntersectionPoint.hxx>
|
||||
#include <Precision.hxx>
|
||||
#include <gp_Ax22d.hxx>
|
||||
#include <gp_Dir2d.hxx>
|
||||
#include <gp_Pnt2d.hxx>
|
||||
|
||||
#include <gtest/gtest.h>
|
||||
|
||||
TEST(Geom2dAPI_InterCurveCurve_Test, OCC24889_IntersectionParameterWithinLimits)
|
||||
{
|
||||
// Bug OCC24889: Geom2dAPI_InterCurveCurve produces result with parameter outside the curve limits
|
||||
// This test verifies that intersection parameters are within the curve parameter limits
|
||||
|
||||
// Create two circles
|
||||
Handle(Geom2d_Circle) aCircle1 =
|
||||
new Geom2d_Circle(gp_Ax22d(gp_Pnt2d(25, -25), gp_Dir2d(gp_Dir2d::D::X), gp_Dir2d(-0, 1)), 155);
|
||||
|
||||
Handle(Geom2d_Circle) aCircle2 =
|
||||
new Geom2d_Circle(gp_Ax22d(gp_Pnt2d(25, 25), gp_Dir2d(gp_Dir2d::D::X), gp_Dir2d(-0, 1)), 155);
|
||||
|
||||
// Create trimmed curves
|
||||
Handle(Geom2d_TrimmedCurve) aTrim1 =
|
||||
new Geom2d_TrimmedCurve(aCircle1, 1.57079632679490, 2.97959469729228);
|
||||
Handle(Geom2d_TrimmedCurve) aTrim2 =
|
||||
new Geom2d_TrimmedCurve(aCircle2, 3.30359060633978, 4.71238898038469);
|
||||
|
||||
// Perform intersection
|
||||
constexpr Standard_Real aTol = Precision::Confusion();
|
||||
Geom2dAPI_InterCurveCurve aIntTool(aTrim1, aTrim2, aTol);
|
||||
|
||||
ASSERT_GT(aIntTool.NbPoints(), 0) << "Intersection should find at least one point";
|
||||
|
||||
const IntRes2d_IntersectionPoint& aIntPnt = aIntTool.Intersector().Point(1);
|
||||
|
||||
Standard_Real aParOnC1 = aIntPnt.ParamOnFirst();
|
||||
Standard_Real aParOnC2 = aIntPnt.ParamOnSecond();
|
||||
Standard_Real aFirstPar1 = aTrim1->FirstParameter();
|
||||
Standard_Real aLastPar1 = aTrim1->LastParameter();
|
||||
Standard_Real aFirstPar2 = aTrim2->FirstParameter();
|
||||
Standard_Real aLastPar2 = aTrim2->LastParameter();
|
||||
|
||||
// Verify that intersection parameters are within the curve limits
|
||||
EXPECT_GE(aParOnC1, aFirstPar1) << "IntParameter on curve 1 (" << aParOnC1
|
||||
<< ") should be >= FirstParam (" << aFirstPar1 << ")";
|
||||
EXPECT_LE(aParOnC1, aLastPar1) << "IntParameter on curve 1 (" << aParOnC1
|
||||
<< ") should be <= LastParam (" << aLastPar1 << ")";
|
||||
|
||||
EXPECT_GE(aParOnC2, aFirstPar2) << "IntParameter on curve 2 (" << aParOnC2
|
||||
<< ") should be >= FirstParam (" << aFirstPar2 << ")";
|
||||
EXPECT_LE(aParOnC2, aLastPar2) << "IntParameter on curve 2 (" << aParOnC2
|
||||
<< ") should be <= LastParam (" << aLastPar2 << ")";
|
||||
|
||||
// Verify that both curves evaluate to the same point at the intersection parameters
|
||||
gp_Pnt2d aP1 = aTrim1->Value(aParOnC1);
|
||||
gp_Pnt2d aP2 = aTrim2->Value(aParOnC2);
|
||||
|
||||
Standard_Real aDist2 = aP1.SquareDistance(aP2);
|
||||
EXPECT_LT(aDist2, 1.0e-14) << "Points on both curves at intersection parameters should coincide";
|
||||
}
|
||||
@@ -0,0 +1,75 @@
|
||||
// Copyright (c) 2025 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 <Geom2d_BezierCurve.hxx>
|
||||
#include <Geom2d_Line.hxx>
|
||||
#include <Geom2dAPI_ProjectPointOnCurve.hxx>
|
||||
#include <Geom2dGcc_Circ2d2TanOn.hxx>
|
||||
#include <Geom2dGcc_QualifiedCurve.hxx>
|
||||
#include <Geom2dAdaptor_Curve.hxx>
|
||||
#include <GccEnt.hxx>
|
||||
#include <NCollection_List.hxx>
|
||||
#include <TColgp_Array1OfPnt2d.hxx>
|
||||
#include <gp_Dir2d.hxx>
|
||||
#include <gp_Pnt2d.hxx>
|
||||
#include <gp_Vec2d.hxx>
|
||||
|
||||
#include <gtest/gtest.h>
|
||||
|
||||
TEST(Geom2dGcc_Circ2d2TanOn_Test, OCC27357_NoExceptions)
|
||||
{
|
||||
// Bug OCC27357: Geom2dGcc_Circ2d2TanOn: check status of sub-algorithms to avoid exceptions
|
||||
// This test verifies that the algorithm handles edge cases without throwing exceptions
|
||||
|
||||
TColgp_Array1OfPnt2d aPoles(1, 3);
|
||||
aPoles.SetValue(1, gp_Pnt2d(0., 0.));
|
||||
aPoles.SetValue(2, gp_Pnt2d(0., 1.));
|
||||
aPoles.SetValue(3, gp_Pnt2d(6., 0.));
|
||||
|
||||
Handle(Geom2d_BezierCurve) aCurve1 = new Geom2d_BezierCurve(aPoles);
|
||||
aPoles.SetValue(2, gp_Pnt2d(0., 1.5));
|
||||
Handle(Geom2d_BezierCurve) aCurve2 = new Geom2d_BezierCurve(aPoles);
|
||||
NCollection_List<Standard_Integer> aDummyList;
|
||||
int nP = 100;
|
||||
|
||||
for (int i = 0; i < nP; i++)
|
||||
{
|
||||
Standard_Real u = i / (nP - 1.);
|
||||
gp_Pnt2d aP1;
|
||||
gp_Vec2d aTangent;
|
||||
aCurve1->D1(u, aP1, aTangent);
|
||||
gp_Vec2d aNormal(-aTangent.Y(), aTangent.X());
|
||||
Handle(Geom2d_Line) aNormalLine = new Geom2d_Line(aP1, gp_Dir2d(aNormal));
|
||||
Geom2dGcc_QualifiedCurve aQualifiedC1(Geom2dAdaptor_Curve(aCurve1), GccEnt_unqualified);
|
||||
Geom2dGcc_QualifiedCurve aQualifiedC2(Geom2dAdaptor_Curve(aCurve2), GccEnt_unqualified);
|
||||
|
||||
// This should not throw an exception even in edge cases
|
||||
EXPECT_NO_THROW({
|
||||
Geom2dAPI_ProjectPointOnCurve aProjPc1(aP1, aCurve1);
|
||||
double g1 = aProjPc1.LowerDistanceParameter();
|
||||
Geom2dAPI_ProjectPointOnCurve aProjPc3(aP1, aNormalLine);
|
||||
double g3 = aProjPc3.LowerDistanceParameter();
|
||||
Geom2dGcc_Circ2d2TanOn aCircleBuilder(aQualifiedC1,
|
||||
aQualifiedC2,
|
||||
Geom2dAdaptor_Curve(aNormalLine),
|
||||
1e-9,
|
||||
g1,
|
||||
g1,
|
||||
g3);
|
||||
aDummyList.Append(aCircleBuilder.NbSolutions());
|
||||
});
|
||||
}
|
||||
|
||||
// Test completed without exceptions
|
||||
SUCCEED();
|
||||
}
|
||||
Reference in New Issue
Block a user