<?xml version="1.0"?>
<?xml-stylesheet type="text/css" href="http://mitov.com/wiki/skins/common/feed.css?301"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://mitov.com/wiki/index.php?action=history&amp;feed=atom&amp;title=IGPGraphicsPathIterator.HasCurve</id>
		<title>IGPGraphicsPathIterator.HasCurve - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://mitov.com/wiki/index.php?action=history&amp;feed=atom&amp;title=IGPGraphicsPathIterator.HasCurve"/>
		<link rel="alternate" type="text/html" href="http://mitov.com/wiki/index.php?title=IGPGraphicsPathIterator.HasCurve&amp;action=history"/>
		<updated>2026-04-11T03:01:03Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.17.0</generator>

	<entry>
		<id>http://mitov.com/wiki/index.php?title=IGPGraphicsPathIterator.HasCurve&amp;diff=1646&amp;oldid=prev</id>
		<title>David Alm: Automated Syncronization with Documentation</title>
		<link rel="alternate" type="text/html" href="http://mitov.com/wiki/index.php?title=IGPGraphicsPathIterator.HasCurve&amp;diff=1646&amp;oldid=prev"/>
				<updated>2011-11-22T00:15:49Z</updated>
		
		<summary type="html">&lt;p&gt;Automated Syncronization with Documentation&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;lt;b&amp;gt;&amp;lt;span style=&amp;quot;color:red&amp;quot;&amp;gt;&lt;br /&gt;
This is a Beta Read Only version of this page. &lt;br /&gt;
Please review and send recommendations to [mailto:mitov@mitov.com mitov@mitov.com]. &lt;br /&gt;
We will enable the editing as soon as we are happy with the overall Wiki site.&lt;br /&gt;
&amp;lt;/span&amp;gt;&amp;lt;/b&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Description ==&lt;br /&gt;
Call this method to determine whether the path has any&lt;br /&gt;
curves.&lt;br /&gt;
Remarks&lt;br /&gt;
All curves in a path are stored as sequences of BÃ©zier&lt;br /&gt;
splines. For example, when you add an ellipse to a path, you&lt;br /&gt;
specify the upper-left corner, the width, and the height of&lt;br /&gt;
the ellipse's bounding rectangle. Those numbers (upper-left&lt;br /&gt;
corner, width, and height) are not stored in the path;&lt;br /&gt;
instead; the ellipse is converted to a sequence of four&lt;br /&gt;
BÃ©zier splines. The path stores the endpoints and control&lt;br /&gt;
points of those BÃ©zier splines.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A path stores an array of data points, each of which belongs&lt;br /&gt;
to a line or a BÃ©zier spline. If some of the points in the&lt;br /&gt;
array belong to BÃ©zier splines, then HasCurve returns TRUE.&lt;br /&gt;
If all points in the array belong to lines, then HasCurve&lt;br /&gt;
returns FALSE.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Certain methods flatten a path, which means that all the&lt;br /&gt;
curves in the path are converted to sequences of lines. After&lt;br /&gt;
a path has been flattened, HasCurve will always return FALSE.&lt;br /&gt;
Flattening happens when you call the TGPGraphicsPath.Flatten,&lt;br /&gt;
TGPGraphicsPath.Widen, or TGPGraphicsPath.Warp method of the&lt;br /&gt;
GraphicsPath class.&lt;/div&gt;</summary>
		<author><name>David Alm</name></author>	</entry>

	</feed>