diff options
Diffstat (limited to 'kig/objects/tests_type.cc')
| -rw-r--r-- | kig/objects/tests_type.cc | 66 |
1 files changed, 33 insertions, 33 deletions
diff --git a/kig/objects/tests_type.cc b/kig/objects/tests_type.cc index a0a072bf..e85c111e 100644 --- a/kig/objects/tests_type.cc +++ b/kig/objects/tests_type.cc @@ -51,11 +51,11 @@ const AreParallelType* AreParallelType::instance() return &t; } -ObjectImp* AreParallelType::calc( const Args& tqparents, const KigDocument& ) const +ObjectImp* AreParallelType::calc( const Args& parents, const KigDocument& ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const LineData& l1 = static_cast<const AbstractLineImp*>( tqparents[0] )->data(); - const LineData& l2 = static_cast<const AbstractLineImp*>( tqparents[1] )->data(); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const LineData& l1 = static_cast<const AbstractLineImp*>( parents[0] )->data(); + const LineData& l2 = static_cast<const AbstractLineImp*>( parents[1] )->data(); if ( l1.isParallelTo( l2 ) ) return new TestResultImp( i18n( "These lines are parallel." ) ); @@ -95,11 +95,11 @@ const AreOrthogonalType* AreOrthogonalType::instance() return &t; } -ObjectImp* AreOrthogonalType::calc( const Args& tqparents, const KigDocument& ) const +ObjectImp* AreOrthogonalType::calc( const Args& parents, const KigDocument& ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const LineData& l1 = static_cast<const AbstractLineImp*>( tqparents[0] )->data(); - const LineData& l2 = static_cast<const AbstractLineImp*>( tqparents[1] )->data(); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const LineData& l1 = static_cast<const AbstractLineImp*>( parents[0] )->data(); + const LineData& l2 = static_cast<const AbstractLineImp*>( parents[1] )->data(); if ( l1.isOrthogonalTo( l2 ) ) return new TestResultImp( i18n( "These lines are orthogonal." ) ); @@ -141,12 +141,12 @@ const AreCollinearType* AreCollinearType::instance() return &t; } -ObjectImp* AreCollinearType::calc( const Args& tqparents, const KigDocument& ) const +ObjectImp* AreCollinearType::calc( const Args& parents, const KigDocument& ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const Coordinate& p1 = static_cast<const PointImp*>( tqparents[0] )->coordinate(); - const Coordinate& p2 = static_cast<const PointImp*>( tqparents[1] )->coordinate(); - const Coordinate& p3 = static_cast<const PointImp*>( tqparents[2] )->coordinate(); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const Coordinate& p1 = static_cast<const PointImp*>( parents[0] )->coordinate(); + const Coordinate& p2 = static_cast<const PointImp*>( parents[1] )->coordinate(); + const Coordinate& p3 = static_cast<const PointImp*>( parents[2] )->coordinate(); if ( areCollinear( p1, p2, p3 ) ) return new TestResultImp( i18n( "These points are collinear." ) ); @@ -184,11 +184,11 @@ const ContainsTestType* ContainsTestType::instance() return &t; } -ObjectImp* ContainsTestType::calc( const Args& tqparents, const KigDocument& doc ) const +ObjectImp* ContainsTestType::calc( const Args& parents, const KigDocument& doc ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const Coordinate& p = static_cast<const PointImp*>( tqparents[0] )->coordinate(); - const CurveImp* c = static_cast<const CurveImp*>( tqparents[1] ); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const Coordinate& p = static_cast<const PointImp*>( parents[0] )->coordinate(); + const CurveImp* c = static_cast<const CurveImp*>( parents[1] ); if ( c->containsPoint( p, doc ) ) return new TestResultImp( i18n( "This curve contains the point." ) ); @@ -230,11 +230,11 @@ const InPolygonTestType* InPolygonTestType::instance() return &t; } -ObjectImp* InPolygonTestType::calc( const Args& tqparents, const KigDocument& ) const +ObjectImp* InPolygonTestType::calc( const Args& parents, const KigDocument& ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const Coordinate& p = static_cast<const PointImp*>( tqparents[0] )->coordinate(); - const PolygonImp* pol = static_cast<const PolygonImp*>( tqparents[1] ); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const Coordinate& p = static_cast<const PointImp*>( parents[0] )->coordinate(); + const PolygonImp* pol = static_cast<const PolygonImp*>( parents[1] ); if ( pol->isInPolygon( p ) ) return new TestResultImp( i18n( "This polygon contains the point." ) ); @@ -274,10 +274,10 @@ const ConvexPolygonTestType* ConvexPolygonTestType::instance() return &t; } -ObjectImp* ConvexPolygonTestType::calc( const Args& tqparents, const KigDocument& ) const +ObjectImp* ConvexPolygonTestType::calc( const Args& parents, const KigDocument& ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const PolygonImp* pol = static_cast<const PolygonImp*>( tqparents[0] ); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const PolygonImp* pol = static_cast<const PolygonImp*>( parents[0] ); if ( pol->isConvex() ) return new TestResultImp( i18n( "This polygon is convex." ) ); @@ -321,12 +321,12 @@ const SameDistanceType* SameDistanceType::instance() return &t; } -ObjectImp* SameDistanceType::calc( const Args& tqparents, const KigDocument& ) const +ObjectImp* SameDistanceType::calc( const Args& parents, const KigDocument& ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const Coordinate& p1 = static_cast<const PointImp*>( tqparents[0] )->coordinate(); - const Coordinate& p2 = static_cast<const PointImp*>( tqparents[1] )->coordinate(); - const Coordinate& p3 = static_cast<const PointImp*>( tqparents[2] )->coordinate(); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const Coordinate& p1 = static_cast<const PointImp*>( parents[0] )->coordinate(); + const Coordinate& p2 = static_cast<const PointImp*>( parents[1] )->coordinate(); + const Coordinate& p3 = static_cast<const PointImp*>( parents[2] )->coordinate(); if ( fabs( ( p1 - p2 ).length() - ( p1 - p3 ).length() ) < 10e-5 ) return new TestResultImp( i18n( "The two distances are the same." ) ); @@ -364,11 +364,11 @@ const VectorEqualityTestType* VectorEqualityTestType::instance() return &t; } -ObjectImp* VectorEqualityTestType::calc( const Args& tqparents, const KigDocument& ) const +ObjectImp* VectorEqualityTestType::calc( const Args& parents, const KigDocument& ) const { - if ( ! margsparser.checkArgs( tqparents ) ) return new InvalidImp; - const Coordinate& v1 = static_cast<const VectorImp*>( tqparents[0] )->dir(); - const Coordinate& v2 = static_cast<const VectorImp*>( tqparents[1] )->dir(); + if ( ! margsparser.checkArgs( parents ) ) return new InvalidImp; + const Coordinate& v1 = static_cast<const VectorImp*>( parents[0] )->dir(); + const Coordinate& v2 = static_cast<const VectorImp*>( parents[1] )->dir(); if ( ( v1 - v2 ).length() < 10e-5 ) return new TestResultImp( i18n( "The two vectors are the same." ) ); |