summaryrefslogtreecommitdiffstats
path: root/kig/objects/cubic_type.cc
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-11 04:44:41 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-11 04:44:41 +0000
commita374efce3a207b39514be3c52264091400ce297e (patch)
tree77bdf654b55826d4f59b53a5621310206bcaead1 /kig/objects/cubic_type.cc
parentf81a494f3957d5cf38c787973415597941934727 (diff)
downloadtdeedu-a374efce3a207b39514be3c52264091400ce297e.tar.gz
tdeedu-a374efce3a207b39514be3c52264091400ce297e.zip
TQt4 port kdeedu
This enables compilation under both Qt3 and Qt4 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdeedu@1236073 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'kig/objects/cubic_type.cc')
-rw-r--r--kig/objects/cubic_type.cc12
1 files changed, 6 insertions, 6 deletions
diff --git a/kig/objects/cubic_type.cc b/kig/objects/cubic_type.cc
index c322b8c3..1878128a 100644
--- a/kig/objects/cubic_type.cc
+++ b/kig/objects/cubic_type.cc
@@ -112,12 +112,12 @@ const CubicNodeB6PType* CubicNodeB6PType::instance()
return &t;
}
-ObjectImp* CubicNodeB6PType::calc( const Args& parents, const KigDocument& ) const
+ObjectImp* CubicNodeB6PType::calc( const Args& tqparents, const KigDocument& ) const
{
- if ( ! margsparser.checkArgs( parents, 2 ) ) return new InvalidImp;
+ if ( ! margsparser.checkArgs( tqparents, 2 ) ) return new InvalidImp;
std::vector<Coordinate> points;
- for ( Args::const_iterator i = parents.begin(); i != parents.end(); ++i )
+ for ( Args::const_iterator i = tqparents.begin(); i != tqparents.end(); ++i )
points.push_back( static_cast<const PointImp*>( *i )->coordinate() );
CubicCartesianData d = calcCubicNodeThroughPoints( points );
@@ -156,12 +156,12 @@ const CubicCuspB4PType* CubicCuspB4PType::instance()
return &t;
}
-ObjectImp* CubicCuspB4PType::calc( const Args& parents, const KigDocument& ) const
+ObjectImp* CubicCuspB4PType::calc( const Args& tqparents, const KigDocument& ) const
{
- if ( ! margsparser.checkArgs( parents, 2 ) ) return new InvalidImp;
+ if ( ! margsparser.checkArgs( tqparents, 2 ) ) return new InvalidImp;
std::vector<Coordinate> points;
- for ( Args::const_iterator i = parents.begin(); i != parents.end(); ++i )
+ for ( Args::const_iterator i = tqparents.begin(); i != tqparents.end(); ++i )
points.push_back( static_cast<const PointImp*>( *i )->coordinate() );
CubicCartesianData d = calcCubicCuspThroughPoints( points );