Qt4's qglobal.h defined TRUE and FALSE. Qt5 does not do it anymore. Replace it with true and false.
158f39ec78
This change is Qt4/Qt5 neutral.
This commit is contained in:
committed by
wmayer
parent
db345cb624
commit
7d0e892d36
@@ -459,7 +459,7 @@ inline void MeshFacetGrid::AddFacet (const MeshGeomFacet &rclFacet, unsigned lon
|
||||
{
|
||||
for (ulZ = ulZ1; ulZ <= ulZ2; ulZ++)
|
||||
{
|
||||
if (CMeshFacetFunc::BBoxContainFacet(GetBoundBox(ulX, ulY, ulZ), rclFacet) == TRUE)
|
||||
if (CMeshFacetFunc::BBoxContainFacet(GetBoundBox(ulX, ulY, ulZ), rclFacet) == true)
|
||||
_aulGrid[ulX][ulY][ulZ].insert(ulFacetIndex);
|
||||
}
|
||||
}
|
||||
|
||||
@@ -106,7 +106,7 @@ inline bool MeshHelpPoint::operator < (const MeshHelpPoint &rclObj) const
|
||||
// if (fabs(_clPt.y - rclObj._clPt.y) < MeshDefinitions::_fMinPointDistanceD1)
|
||||
// {
|
||||
// if (fabs(_clPt.z - rclObj._clPt.z) < MeshDefinitions::_fMinPointDistanceD1)
|
||||
// return FALSE;
|
||||
// return false;
|
||||
// else
|
||||
// return _clPt.z < rclObj._clPt.z;
|
||||
// }
|
||||
@@ -136,15 +136,15 @@ inline bool MeshHelpPoint::operator == (const MeshHelpPoint &rclObj) const
|
||||
if (fabs(_clPt.y - rclObj._clPt.y) < (MeshDefinitions::_fMinPointDistanceD1 + 1.0e-2f))
|
||||
{
|
||||
if (fabs(_clPt.z - rclObj._clPt.z) < (MeshDefinitions::_fMinPointDistanceD1 + 1.0e-2f))
|
||||
return TRUE;
|
||||
return true;
|
||||
else
|
||||
return FALSE;
|
||||
return false;
|
||||
}
|
||||
else
|
||||
return FALSE;
|
||||
return false;
|
||||
}
|
||||
else
|
||||
return FALSE;
|
||||
return false;
|
||||
*/
|
||||
}
|
||||
|
||||
|
||||
@@ -2422,9 +2422,9 @@ bool MeshOutput::SaveVRML (std::ostream &rstrOut) const
|
||||
|
||||
rstrOut << " ]\n }\n";
|
||||
if (_material->binding == MeshIO::PER_VERTEX)
|
||||
rstrOut << " colorPerVertex TRUE\n";
|
||||
rstrOut << " colorPerVertex true\n";
|
||||
else
|
||||
rstrOut << " colorPerVertex FALSE\n";
|
||||
rstrOut << " colorPerVertex false\n";
|
||||
}
|
||||
|
||||
// write face index
|
||||
|
||||
@@ -31,7 +31,7 @@
|
||||
if |dv|<EPSILON then dv=0.0;
|
||||
else no check is done (which is less robust)
|
||||
*/
|
||||
#define USE_EPSILON_TEST TRUE
|
||||
#define USE_EPSILON_TEST 1
|
||||
#define EPSILON 0.000001
|
||||
|
||||
|
||||
@@ -237,7 +237,7 @@ int tri_tri_intersect(float V0[3],float V1[3],float V2[3],
|
||||
du2=DOT(N1,U2)+d1;
|
||||
|
||||
/* coplanarity robustness check */
|
||||
#if USE_EPSILON_TEST==TRUE
|
||||
#if USE_EPSILON_TEST
|
||||
if(fabs(du0)<EPSILON) du0=0.0;
|
||||
if(fabs(du1)<EPSILON) du1=0.0;
|
||||
if(fabs(du2)<EPSILON) du2=0.0;
|
||||
@@ -260,7 +260,7 @@ int tri_tri_intersect(float V0[3],float V1[3],float V2[3],
|
||||
dv1=DOT(N2,V1)+d2;
|
||||
dv2=DOT(N2,V2)+d2;
|
||||
|
||||
#if USE_EPSILON_TEST==TRUE
|
||||
#if USE_EPSILON_TEST
|
||||
if(fabs(dv0)<EPSILON) dv0=0.0;
|
||||
if(fabs(dv1)<EPSILON) dv1=0.0;
|
||||
if(fabs(dv2)<EPSILON) dv2=0.0;
|
||||
@@ -371,7 +371,7 @@ int NoDivTriTriIsect(float V0[3],float V1[3],float V2[3],
|
||||
du2=DOT(N1,U2)+d1;
|
||||
|
||||
/* coplanarity robustness check */
|
||||
#if USE_EPSILON_TEST==TRUE
|
||||
#if USE_EPSILON_TEST
|
||||
if(FABS(du0)<EPSILON) du0=0.0;
|
||||
if(FABS(du1)<EPSILON) du1=0.0;
|
||||
if(FABS(du2)<EPSILON) du2=0.0;
|
||||
@@ -394,7 +394,7 @@ int NoDivTriTriIsect(float V0[3],float V1[3],float V2[3],
|
||||
dv1=DOT(N2,V1)+d2;
|
||||
dv2=DOT(N2,V2)+d2;
|
||||
|
||||
#if USE_EPSILON_TEST==TRUE
|
||||
#if USE_EPSILON_TEST
|
||||
if(FABS(dv0)<EPSILON) dv0=0.0;
|
||||
if(FABS(dv1)<EPSILON) dv1=0.0;
|
||||
if(FABS(dv2)<EPSILON) dv2=0.0;
|
||||
@@ -597,7 +597,7 @@ int tri_tri_intersect_with_isectline(float V0[3],float V1[3],float V2[3],
|
||||
du2=DOT(N1,U2)+d1;
|
||||
|
||||
/* coplanarity robustness check */
|
||||
#if USE_EPSILON_TEST==TRUE
|
||||
#if USE_EPSILON_TEST
|
||||
if(fabs(du0)<EPSILON) du0=0.0;
|
||||
if(fabs(du1)<EPSILON) du1=0.0;
|
||||
if(fabs(du2)<EPSILON) du2=0.0;
|
||||
@@ -620,7 +620,7 @@ int tri_tri_intersect_with_isectline(float V0[3],float V1[3],float V2[3],
|
||||
dv1=DOT(N2,V1)+d2;
|
||||
dv2=DOT(N2,V2)+d2;
|
||||
|
||||
#if USE_EPSILON_TEST==TRUE
|
||||
#if USE_EPSILON_TEST
|
||||
if(fabs(dv0)<EPSILON) dv0=0.0;
|
||||
if(fabs(dv1)<EPSILON) dv1=0.0;
|
||||
if(fabs(dv2)<EPSILON) dv2=0.0;
|
||||
|
||||
@@ -38,7 +38,7 @@ public:
|
||||
// Input:
|
||||
// A[iSize][iSize], entries are A[row][col]
|
||||
// Output:
|
||||
// return value is TRUE if successful, FALSE if pivoting failed
|
||||
// return value is true if successful, false if pivoting failed
|
||||
// InvA[iSize][iSize], inverse matrix
|
||||
bool Inverse (const GMatrix<Real>& rkA, GMatrix<Real>& rkInvA);
|
||||
|
||||
@@ -46,7 +46,7 @@ public:
|
||||
// A[iSize][iSize] coefficient matrix, entries are A[row][col]
|
||||
// B[iSize] vector, entries are B[row]
|
||||
// Output:
|
||||
// return value is TRUE if successful, FALSE if pivoting failed
|
||||
// return value is true if successful, false if pivoting failed
|
||||
// X[iSize] is solution X to AX = B
|
||||
bool Solve (const GMatrix<Real>& rkA, const Real* afB, Real* afX);
|
||||
|
||||
@@ -57,7 +57,7 @@ public:
|
||||
// Upper diagonal C[iSize-1]
|
||||
// Right-hand side R[iSize]
|
||||
// Output:
|
||||
// return value is TRUE if successful, FALSE if pivoting failed
|
||||
// return value is true if successful, false if pivoting failed
|
||||
// U[iSize] is solution
|
||||
bool SolveTri (int iSize, Real* afA, Real* afB, Real* afC, Real* afR,
|
||||
Real* afU);
|
||||
@@ -69,7 +69,7 @@ public:
|
||||
// Upper diagonal is constant, C
|
||||
// Right-hand side Rr[iSize]
|
||||
// Output:
|
||||
// return value is TRUE if successful, FALSE if pivoting failed
|
||||
// return value is true if successful, false if pivoting failed
|
||||
// U[iSize] is solution
|
||||
bool SolveConstTri (int iSize, Real fA, Real fB, Real fC, Real* afR,
|
||||
Real* afU);
|
||||
@@ -102,7 +102,7 @@ public:
|
||||
// A, a banded matrix
|
||||
// B[iSize] vector, entries are B[row]
|
||||
// Output:
|
||||
// return value is TRUE if successful, FALSE if pivoting failed
|
||||
// return value is true if successful, false if pivoting failed
|
||||
// X[iSize] is solution X to AX = B
|
||||
bool SolveBanded (const BandedMatrix<Real>& rkA, const Real* afB,
|
||||
Real* afX);
|
||||
@@ -111,7 +111,7 @@ public:
|
||||
// Input:
|
||||
// A, a banded matrix
|
||||
// Output:
|
||||
// return value is TRUE if the inverse exists, FALSE otherwise
|
||||
// return value is true if the inverse exists, false otherwise
|
||||
// InvA, the inverse of A
|
||||
bool Invert (const BandedMatrix<Real>& rkA, GMatrix<Real>& rkInvA);
|
||||
|
||||
|
||||
Reference in New Issue
Block a user