OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-04 13:13:25 +03:00
Code Activity

Replacing french comments by english one

Browse Source
This commit is contained in:
bugmaster
2011-04-28 16:28:27 +00:00
committed by bugmaster
parent 94354caf54
commit 81bba7173e
140 changed files with 4625 additions and 4701 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/IntTools/IntTools_FClass2d.cxx
View File

@@ -176,7 +176,7 @@
TolVertex=TolVertex1;
}
//
//-- Verification des cas ou on a oublie de coder degenereted
//-- Verification of cases when forgotten to code degenereted
if(!degenerated) {
Standard_Real aR2;
gp_Pnt P3da, P3db;
@@ -243,10 +243,10 @@
}
//
//-- ------------------------------------------------------------
//-- On regarde la distance uv entre le point de debut de l edge
//-- et le dernier point enregistre dans SeqPnt2d
//-- On cherche a eloigner le premier point de l edge courant
//-- du dernier point enregistre
//-- Check distance uv between the start point of the edge
//-- and the last point saved in SeqPnt2d
//-- To to set the first point of the current
//-- afar from the last saved point
Avant = nbpnts;
for(iX=firstpoint; iX<=aNbs1; iX++) {
Standard_Boolean IsRealCurve3d;
@@ -355,7 +355,7 @@
// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
//
if(NbEdges) {
//-- on compte ++ avec un explorateur normal et -- avec le Wire Exploreur
//-- count ++ with normal explorer and -- with Wire Explorer
TColgp_Array1OfPnt2d PClass(1,2);
gp_Pnt2d anInitPnt(0., 0.);
//
@@ -463,7 +463,7 @@
Standard_Integer nbtabclass = TabClass.Length();
//
if(nbtabclass>0) {
//-- Si une erreur sur un wire a ete detecte : On met tous les TabOrien a -1
//-- if an error on a wire was detected : all TabOrien set to -1
if(BadWire) {
TabOrien(1)=-1;
}
@@ -521,7 +521,7 @@
return(TopAbs_IN);
}
//-- U1 est le First Param et U2 ds ce cas est U1+Period
//-- U1 is the First Param and U2 is in this case U1+Period
Standard_Real u, v, uu, vv, uperiod, vperiod;
Standard_Boolean IsUPer, IsVPer, urecadre, vrecadre;
TopAbs_State Status= TopAbs_UNKNOWN;
@@ -618,7 +618,7 @@
}
} // if(TabOrien(1)!=-1) {
else { //-- TabOrien(1)=-1 Wire Faux
else { //-- TabOrien(1)=-1 Wrong Wire
BRepClass_FaceClassifier aClassifier;
aClassifier.Perform(Face,Puv,Toluv);
Status = aClassifier.State();
@@ -677,7 +677,7 @@
return(TopAbs_IN);
}
//-- U1 est le First Param et U2 ds ce cas est U1+Period
//-- U1 is the First Param and U2 in this case is U1+Period
Standard_Real u=_Puv.X();
Standard_Real v=_Puv.Y();
Standard_Real uu = u, vv = v;
@@ -755,7 +755,7 @@
Status = TopAbs_OUT;
}
}
else { //-- TabOrien(1)=-1 Wire Faux
else { //-- TabOrien(1)=-1 Wrong Wire
BRepClass_FaceClassifier aClassifier;
aClassifier.Perform(Face,Puv,Tol);
Status = aClassifier.State();

15
src/IntTools/IntTools_FaceFace.cxx
View File

@@ -852,7 +852,7 @@ void IntTools_FaceFace::SetList(IntSurf_ListOfPntOn2S& aListOfPnts)
} // end of if (!Precision::IsNegativeInfinite(fprm) && !Precision::IsPositiveInfinite(lprm))
else {
// on regarde si on garde
// check if keep
//
Standard_Boolean bFNIt, bLPIt;
Standard_Real aTestPrm, dT=100.;
@@ -1135,7 +1135,7 @@ void IntTools_FaceFace::SetList(IntSurf_ListOfPntOn2S& aListOfPnts)
}// end of if (ok) {
}// end of for (Standard_Integer j=0; j<=17; j++)
}// end of else { on regarde si on garde
}// end of else { check if keep
}// for (i=1; i<=myLConstruct.NbParts(); i++)
}// IntPatch_Circle: IntPatch_Ellipse:
break;
@@ -1462,9 +1462,8 @@ void IntTools_FaceFace::SetList(IntSurf_ListOfPntOn2S& aListOfPnts)
ilprm = (Standard_Integer)lprm;
}
}
//-- lbr :
//-- Si une des surfaces est un plan , on approxime en 2d
//-- sur cette surface et on remonte les points 2d en 3d.
//-- If one of surfaces is a plane , 2D approximation is done on
//-- this surface and 2D points are returned in 3D.
if(typs1 == GeomAbs_Plane) {
theapp3d.Perform(myHS1, myHS2, WL, Standard_False,Standard_True, myApprox2,ifprm,ilprm);
}
@@ -1869,7 +1868,7 @@ void IntTools_FaceFace::SetList(IntSurf_ListOfPntOn2S& aListOfPnts)
S->Bounds(umin, umax, vmin, vmax);
if (S->IsUPeriodic() && !C2d.IsNull()) {
// Recadre dans le domaine UV de la face
// Reframe in domain UV of the face
Standard_Real period, U0, du, aEps;
du =0.0;
@@ -2020,7 +2019,7 @@ Handle(Geom2d_BSplineCurve) MakeBSpline2d(const Handle(IntPatch_WLine)& theWLine
IntTools_SequenceOfCurves aNewCvs;
//
// 1. Treatment of periodic and closed curves
// 1. Processing of periodic and closed curves
aNbCurves=mySeqOfCurve.Length();
for (i=1; i<=aNbCurves; i++) {
const IntTools_Curve& aIC=mySeqOfCurve(i);
@@ -3772,7 +3771,7 @@ Standard_Boolean DecompositionOfWLine(const Handle(IntPatch_WLine)& theWLine,
// ------------------------------------------------------------------------------------------------
// static function: ParameterOutOfBoundary
// purpose: Computes a new parameter for given curve. The corresponding 2d points
// does not lay on any boundary of given faces
// do not lie on any boundary of given faces
// ------------------------------------------------------------------------------------------------
Standard_Boolean ParameterOutOfBoundary(const Standard_Real theParameter,
const Handle(Geom_Curve)& theCurve,

36
src/IntTools/IntTools_LineConstructor.cxx
View File

@@ -63,7 +63,7 @@ static void Recadre(const Handle(GeomAdaptor_HSurface)& myHS1,
}
default:
{
//-- Le cas de biparametrees periodiques est gere en amont
//-- Case of periodic biparameters is processed upstream
myHS1IsUPeriodic = myHS1IsVPeriodic = Standard_False;
break;
}
@@ -87,7 +87,7 @@ static void Recadre(const Handle(GeomAdaptor_HSurface)& myHS1,
}
default:
{
//-- Le cas de biparametrees periodiques est gere en amont
//-- Case of periodic biparameters is processed upstream
myHS2IsUPeriodic = myHS2IsVPeriodic = Standard_False;
break;
}
@@ -216,9 +216,9 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
Pmid.Parameters(u1,v1,u2,v2);
Recadre(myHS1,myHS2,u1,v1,u2,v2);
const TopAbs_State in1 = myDom1->Classify(gp_Pnt2d(u1,v1),Tol);
if(in1 != TopAbs_OUT) { //-- !=ON donne Pb
if(in1 != TopAbs_OUT) {
const TopAbs_State in2 = myDom2->Classify(gp_Pnt2d(u2,v2),Tol);
if(in2 != TopAbs_OUT) { //-- !=ON
if(in2 != TopAbs_OUT) {
seqp.Append(firstp);
seqp.Append(lastp);
}
@@ -371,9 +371,8 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
}
}
if (!intrvtested) {
// on garde a priori. Il faudrait un point 2d sur chaque
// surface pour prendre la decision. Sera fait dans
// l`appelant
// Keep a priori. A point 2d on each
// surface is required to make the decision. Will be done in the caller
seqp.Append(GeomInt_LineTool::FirstParameter(L));
seqp.Append(GeomInt_LineTool::LastParameter(L));
}
@@ -446,9 +445,8 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
done = Standard_False;
seqp.Clear();
nbvtx = GeomInt_LineTool::NbVertex(L);
if (nbvtx == 0) { // on garde a priori. Il faudrait un point 2d sur chaque
// surface pour prendre la decision. Sera fait dans
// l`appelant
if (nbvtx == 0) { // Keep a priori. Point 2d is required on each
// surface to make the decision. Will be done in the caller
seqp.Append(GeomInt_LineTool::FirstParameter(L));
seqp.Append(GeomInt_LineTool::LastParameter(L));
done = Standard_True;
@@ -494,7 +492,7 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
{
if (Abs(prm-seqpss(j).Parameter()) <= Tol)
{
// on cumule
// accumulate
GeomInt_ParameterAndOrientation& valj = seqpss.ChangeValue(j);
if (or1 != TopAbs_INTERNAL) {
if (valj.Orientation1() != TopAbs_INTERNAL) {
@@ -522,7 +520,7 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
}
if (prm < seqpss(j).Parameter()-Tol ) {
// on insere avant la position j
// insert before position j
seqpss.InsertBefore(j,GeomInt_ParameterAndOrientation(prm,or1,or2));
inserted = Standard_True;
break;
@@ -534,7 +532,7 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
}
}
// on determine l`etat en debut de ligne
// determine the state at the beginning of line
Standard_Boolean trim = Standard_False;
Standard_Boolean dansS1 = Standard_False;
Standard_Boolean dansS2 = Standard_False;
@@ -567,7 +565,7 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
break;
}
}
dansS1 = Standard_True; // on garde dans le doute
dansS1 = Standard_True; // Keep in doubt
}
for (i=1; i<= nbvtx; i++)
@@ -596,18 +594,18 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
break;
}
}
dansS2 = Standard_True; // on garde dans le doute
dansS2 = Standard_True; // Keep in doubt
}
if (!trim) { // on a necessairement dansS1 == dansS2 == Standard_True
if (!trim) { // necessarily dansS1 == dansS2 == Standard_True
seqp.Append(GeomInt_LineTool::FirstParameter(L));
seqp.Append(GeomInt_LineTool::LastParameter(L));
done = Standard_True;
return;
}
// On epluche la sequence seqpss pour constituer les bouts valides
// et les stocker dans seqp(2*i+1) et seqp(2*i+2)
// sequence seqpss is peeled to create valid ends
// and store them in seqp(2*i+1) and seqp(2*i+2)
Standard_Real thefirst = GeomInt_LineTool::FirstParameter(L);
Standard_Real thelast = GeomInt_LineTool::LastParameter(L);
@@ -676,7 +674,7 @@ void IntTools_LineConstructor::Perform(const Handle(IntPatch_Line)& L)
}
}
// le petit dernier a rajouter
// finally to add
if (dansS1 && dansS2)
{
lastp = thelast;