summaryrefslogtreecommitdiffstats
path: root/doc/html/tqregion.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/tqregion.html')
-rw-r--r--doc/html/tqregion.html44
1 files changed, 22 insertions, 22 deletions
diff --git a/doc/html/tqregion.html b/doc/html/tqregion.html
index b228ec3c3..f0ea4bd48 100644
--- a/doc/html/tqregion.html
+++ b/doc/html/tqregion.html
@@ -40,7 +40,7 @@ body { background: #ffffff; color: black; }
<li class=fn><a href="#TQRegion"><b>TQRegion</b></a> ()</li>
<li class=fn><a href="#TQRegion-2"><b>TQRegion</b></a> ( int&nbsp;x, int&nbsp;y, int&nbsp;w, int&nbsp;h, RegionType&nbsp;t = Rectangle )</li>
<li class=fn><a href="#TQRegion-3"><b>TQRegion</b></a> ( const&nbsp;TQRect&nbsp;&amp;&nbsp;r, RegionType&nbsp;t = Rectangle )</li>
-<li class=fn><a href="#TQRegion-4"><b>TQRegion</b></a> ( const&nbsp;TQPointArray&nbsp;&amp;&nbsp;a, bool&nbsp;winding = FALSE )</li>
+<li class=fn><a href="#TQRegion-4"><b>TQRegion</b></a> ( const&nbsp;TQPointArray&nbsp;&amp;&nbsp;a, bool&nbsp;winding = false )</li>
<li class=fn><a href="#TQRegion-5"><b>TQRegion</b></a> ( const&nbsp;TQRegion&nbsp;&amp;&nbsp;r )</li>
<li class=fn><a href="#TQRegion-6"><b>TQRegion</b></a> ( const&nbsp;TQBitmap&nbsp;&amp;&nbsp;bm )</li>
<li class=fn><a href="#~TQRegion"><b>~TQRegion</b></a> ()</li>
@@ -145,10 +145,10 @@ This is an overloaded member function, provided for convenience. It behaves esse
<p> If the rectangle is invalid a null region will be created.
<p> <p>See also <a href="#RegionType-enum">TQRegion::RegionType</a>.
-<h3 class=fn><a name="TQRegion-4"></a>TQRegion::TQRegion ( const&nbsp;<a href="tqpointarray.html">TQPointArray</a>&nbsp;&amp;&nbsp;a, bool&nbsp;winding = FALSE )
+<h3 class=fn><a name="TQRegion-4"></a>TQRegion::TQRegion ( const&nbsp;<a href="tqpointarray.html">TQPointArray</a>&nbsp;&amp;&nbsp;a, bool&nbsp;winding = false )
</h3>
Constructs a polygon region from the point array <em>a</em>.
-<p> If <em>winding</em> is TRUE, the polygon region is filled using the
+<p> If <em>winding</em> is true, the polygon region is filled using the
winding algorithm, otherwise the default even-odd fill algorithm
is used.
<p> This constructor may create complex regions that will slow down
@@ -178,14 +178,14 @@ gives a rectangle that is <a href="tqrect.html#isNull">TQRect::isNull</a>().
<h3 class=fn>bool <a name="contains"></a>TQRegion::contains ( const&nbsp;<a href="tqpoint.html">TQPoint</a>&nbsp;&amp;&nbsp;p ) const
</h3>
-Returns TRUE if the region contains the point <em>p</em>; otherwise
-returns FALSE.
+Returns true if the region contains the point <em>p</em>; otherwise
+returns false.
<h3 class=fn>bool <a name="contains-2"></a>TQRegion::contains ( const&nbsp;<a href="tqrect.html">TQRect</a>&nbsp;&amp;&nbsp;r ) const
</h3>
This is an overloaded member function, provided for convenience. It behaves essentially like the above function.
-<p> Returns TRUE if the region overlaps the rectangle <em>r</em>; otherwise
-returns FALSE.
+<p> Returns true if the region overlaps the rectangle <em>r</em>; otherwise
+returns false.
<h3 class=fn><a href="tqregion.html">TQRegion</a> <a name="eor"></a>TQRegion::eor ( const&nbsp;<a href="tqregion.html">TQRegion</a>&nbsp;&amp;&nbsp;r ) const
</h3>
@@ -207,31 +207,31 @@ Returns a region which is the intersection of this region and <em>r</em>.
<h3 class=fn>bool <a name="isEmpty"></a>TQRegion::isEmpty () const
</h3>
-Returns TRUE if the region is empty; otherwise returns FALSE. An
+Returns true if the region is empty; otherwise returns false. An
empty region is a region that contains no points.
<p> Example:
<pre>
TQRegion r1( 10, 10, 20, 20 );
TQRegion r2( 40, 40, 20, 20 );
TQRegion r3;
- r1.<a href="#isNull">isNull</a>(); // FALSE
- r1.<a href="#isEmpty">isEmpty</a>(); // FALSE
- r3.<a href="#isNull">isNull</a>(); // TRUE
- r3.<a href="#isEmpty">isEmpty</a>(); // TRUE
+ r1.<a href="#isNull">isNull</a>(); // false
+ r1.<a href="#isEmpty">isEmpty</a>(); // false
+ r3.<a href="#isNull">isNull</a>(); // true
+ r3.<a href="#isEmpty">isEmpty</a>(); // true
r3 = r1.<a href="#intersect">intersect</a>( r2 ); // r3 = intersection of r1 and r2
- r3.<a href="#isNull">isNull</a>(); // FALSE
- r3.<a href="#isEmpty">isEmpty</a>(); // TRUE
+ r3.<a href="#isNull">isNull</a>(); // false
+ r3.<a href="#isEmpty">isEmpty</a>(); // true
r3 = r1.<a href="#unite">unite</a>( r2 ); // r3 = union of r1 and r2
- r3.<a href="#isNull">isNull</a>(); // FALSE
- r3.<a href="#isEmpty">isEmpty</a>(); // FALSE
+ r3.<a href="#isNull">isNull</a>(); // false
+ r3.<a href="#isEmpty">isEmpty</a>(); // false
</pre>
<p> <p>See also <a href="#isNull">isNull</a>().
<h3 class=fn>bool <a name="isNull"></a>TQRegion::isNull () const
</h3>
-Returns TRUE if the region is a null region; otherwise returns
-FALSE.
+Returns true if the region is a null region; otherwise returns
+false.
<p> A null region is a region that has not been initialized. A null
region is always empty.
<p> <p>See also <a href="#isEmpty">isEmpty</a>().
@@ -239,8 +239,8 @@ region is always empty.
<h3 class=fn>bool <a name="operator!-eq"></a>TQRegion::operator!= ( const&nbsp;<a href="tqregion.html">TQRegion</a>&nbsp;&amp;&nbsp;r ) const
</h3>
-<p> Returns TRUE if the region is different from <em>r</em>; otherwise
-returns FALSE.
+<p> Returns true if the region is different from <em>r</em>; otherwise
+returns false.
<h3 class=fn>const&nbsp;<a href="tqregion.html">TQRegion</a> <a name="operator-and"></a>TQRegion::operator&amp; ( const&nbsp;<a href="tqregion.html">TQRegion</a>&nbsp;&amp;&nbsp;r ) const
</h3>
@@ -284,8 +284,8 @@ Assigns <em>r</em> to this region and returns a reference to the region.
<h3 class=fn>bool <a name="operator-eq-eq"></a>TQRegion::operator== ( const&nbsp;<a href="tqregion.html">TQRegion</a>&nbsp;&amp;&nbsp;r ) const
</h3>
-Returns TRUE if the region is equal to <em>r</em>; otherwise returns
-FALSE.
+Returns true if the region is equal to <em>r</em>; otherwise returns
+false.
<h3 class=fn>const&nbsp;<a href="tqregion.html">TQRegion</a> <a name="operator^"></a>TQRegion::operator^ ( const&nbsp;<a href="tqregion.html">TQRegion</a>&nbsp;&amp;&nbsp;r ) const
</h3>