diff options
Diffstat (limited to 'tqtinterface/qt4/src/kernel/tqrect.cpp')
| -rw-r--r-- | tqtinterface/qt4/src/kernel/tqrect.cpp | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/tqtinterface/qt4/src/kernel/tqrect.cpp b/tqtinterface/qt4/src/kernel/tqrect.cpp index aa16303..2c9b9f3 100644 --- a/tqtinterface/qt4/src/kernel/tqrect.cpp +++ b/tqtinterface/qt4/src/kernel/tqrect.cpp @@ -130,8 +130,8 @@ void TQRect::coords( int *xp1, int *yp1, int *xp2, int *yp2 ) const moveBottomRight(), etc. You can also add coordinates to a rectangle with addCoords(). - You can test to see if a TQRect tqcontains a specific point with - tqcontains(). You can also test to see if two TQRects intersect with + You can test to see if a TQRect contains a specific point with + contains(). You can also test to see if two TQRects intersect with intersects() (see also intersect()). To get the bounding rectangle of two TQRects use unite(). @@ -789,7 +789,7 @@ void TQRect::setSize( const TQSize &s ) inside (not on the edge). */ -bool TQRect::tqcontains( const TQPoint &p, bool proper ) const +bool TQRect::contains( const TQPoint &p, bool proper ) const { if ( proper ) return p.x() > x1 && p.x() < x2 && @@ -800,7 +800,7 @@ bool TQRect::tqcontains( const TQPoint &p, bool proper ) const } /*! - \overload bool TQRect::tqcontains( int x, int y, bool proper ) const + \overload bool TQRect::contains( int x, int y, bool proper ) const Returns TRUE if the point \a x, \a y is inside this rectangle; otherwise returns FALSE. @@ -810,7 +810,7 @@ bool TQRect::tqcontains( const TQPoint &p, bool proper ) const */ /*! - \overload bool TQRect::tqcontains( int x, int y ) const + \overload bool TQRect::contains( int x, int y ) const Returns TRUE if the point \a x, \a y is inside this rectangle; otherwise returns FALSE. @@ -828,7 +828,7 @@ bool TQRect::tqcontains( const TQPoint &p, bool proper ) const \sa unite(), intersect(), intersects() */ -bool TQRect::tqcontains( const TQRect &r, bool proper ) const +bool TQRect::contains( const TQRect &r, bool proper ) const { if ( proper ) return r.x1 > x1 && r.x2 < x2 && r.y1 > y1 && r.y2 < y2; @@ -862,7 +862,7 @@ TQRect& TQRect::operator&=(const TQRect &r) The bounding rectangle of a nonempty rectangle and an empty or invalid rectangle is defined to be the nonempty rectangle. - \sa operator|=(), operator&(), intersects(), tqcontains() + \sa operator|=(), operator&(), intersects(), contains() */ TQRect TQRect::operator|(const TQRect &r) const @@ -898,7 +898,7 @@ TQRect TQRect::unite( const TQRect &r ) const Returns an empty rectangle if there is no intersection. - \sa operator&=(), operator|(), isEmpty(), intersects(), tqcontains() + \sa operator&=(), operator|(), isEmpty(), intersects(), contains() */ TQRect TQRect::operator&( const TQRect &r ) const @@ -925,7 +925,7 @@ TQRect TQRect::intersect( const TQRect &r ) const (there is at least one pixel that is within both rectangles); otherwise returns FALSE. - \sa intersect(), tqcontains() + \sa intersect(), contains() */ bool TQRect::intersects( const TQRect &r ) const |