@@ -634,14 +634,14 @@ TRectI is empty if x0>x1 || y0>y1 */
634634 TPointT<T> getP11 () const { return TPointT<T>(x1, y1); };
635635
636636 // ! Returns the union of two source rectangles.
637- // !The union is the smallest rectangle that contains both source rectangles.
637+ // ! The union is the smallest rectangle that contains both source rectangles.
638638 TRectT<T> operator +(const TRectT<T> &rect) const { // unione
639639 if (isEmpty ())
640640 return rect;
641641 else if (rect.isEmpty ())
642642 return *this ;
643643 else
644- return TRectT<T>(std::min ((T)x0, (T)rect.x0 ),
644+ return TRectT<T>(std::min ((T)x0, (T)rect.x0 ),
645645 std::min ((T)y0, (T)rect.y0 ),
646646 std::max ((T)x1, (T)rect.x1 ),
647647 std::max ((T)y1, (T)rect.y1 ));
@@ -653,8 +653,8 @@ TRectI is empty if x0>x1 || y0>y1 */
653653 return *this = *this * rect;
654654 };
655655
656- // !Returns the intersection of two existing rectangles.
657- // The intersection is the largest rectangle contained in both existing rectangles.
656+ // ! Returns the intersection of two existing rectangles.
657+ // ! The intersection is the largest rectangle contained in both existing rectangles.
658658 TRectT<T> operator *(const TRectT<T> &rect) const { // intersezione
659659 if (isEmpty () || rect.isEmpty ())
660660 return TRectT<T>();
@@ -735,7 +735,6 @@ template class DVAPI TRectT<double>;
735735\relates TRectT
736736Convert a TRectD into a TRect
737737*/
738-
739738inline TRect convert (const TRectD &r) {
740739 return TRect ((int )(r.x0 + 0.5 ), (int )(r.y0 + 0.5 ), (int )(r.x1 + 0.5 ),
741740 (int )(r.y1 + 0.5 ));
@@ -752,8 +751,8 @@ inline TRectD convert(const TRect &r) { return TRectD(r.x0, r.y0, r.x1, r.y1); }
752751\relates TPointT
753752*/
754753inline TRectD boundingBox (const TPointD &p0, const TPointD &p1) {
755- return TRectD (std::min (p0.x , p1.x ), std::min (p0.y , p1.y ), // bottom left
756- std::max (p0.x , p1.x ), std::max (p0.y , p1.y )); // top right
754+ return TRectD (std::min (p0.x , p1.x ), std::min (p0.y , p1.y ), // bottom left
755+ std::max (p0.x , p1.x ), std::max (p0.y , p1.y )); // top right
757756}
758757/* !
759758\relates TRectT
@@ -800,8 +799,6 @@ inline void TRectT<int>::empty() {
800799 x0 = y0 = 0 ;
801800 x1 = y1 = -1 ;
802801}
803-
804- // Is the adding of one here to account for the thickness?
805802template <>
806803inline int TRectT<int >::getLx() const {
807804 return x1 >= x0 ? x1 - x0 + 1 : 0 ;
@@ -894,9 +891,9 @@ extern DVVAR const TRectI infiniteRectI;
894891// =============================================================================
895892// ! This is the base class for the affine transformations.
896893/* !
897- This class performs basic manipulations of affine transformations.
898- An affine transformation is a linear transformation followed by a translation.
899-
894+ This class performs basic manipulations of affine transformations.
895+ An affine transformation is a linear transformation followed by a translation.
896+
900897 [a11, a12, a13]
901898 [a21, a22, a23]
902899
0 commit comments