/Src/Dependencies/Boost/libs/polygon/doc/gtl_polygon_90_concept.htm

http://hadesmem.googlecode.com/ · HTML · 393 lines · 382 code · 7 blank · 4 comment · 0 complexity · a3f94646bd001ab8be0ef14cd10a35b8 MD5 · raw file 

    

  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
    2. 

  2. <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40"><head><!--
    3. 

  3.     Copyright 2009-2010 Intel Corporation
    4. 

  4.     license banner
    5. 

  5. -->
    6. 

  6. <title>Boost Polygon Library: Polygon 90 Concept</title>
    7. 

  7.     <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
    8. 

  8. <table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
    9. 

  9. <td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top">
    10. 

  10.     <div style="padding: 5px;" align="center">
    11. 

  11.         <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
    12. 

  12.             </a>
    13. 

  13.     </div>
    14. 

  14.     <div style="margin: 5px;">
    15. 

  15.         <h3 class="navbar">Contents</h3>
    16. 

  16.         <ul>
    17. 

  17.             <li><a href="index.htm">Boost.Polygon Main Page</a></li>
    18. 

  18.             <li><a href="gtl_design_overview.htm">Design Overview</a></li>
    19. 

  19.             <li><a href="gtl_isotropy.htm">Isotropy</a></li>
    20. 

  20.             <li><a href="gtl_coordinate_concept.htm">Coordinate Concept</a></li>
    21. 

  21.             <li><a href="gtl_interval_concept.htm">Interval Concept</a></li>
    22. 

  22. 			<li><a href="gtl_point_concept.htm">Point Concept</a></li>
    23. 

  23. 			<li><a href="gtl_rectangle_concept.htm">Rectangle Concept</a></li>
    24. 

  24. 			<li>Polygon 90 Concept</li>
    25. 

  25. 			<li><a href="gtl_polygon_90_with_holes_concept.htm">Polygon 90 With Holes Concept</a></li>
    26. 

  26. 			<li><a href="gtl_polygon_45_concept.htm">Polygon 45 Concept</a></li>
    27. 

  27. 			<li><a href="gtl_polygon_45_with_holes_concept.htm">Polygon 45 With Holes Concept</a></li>
    28. 

  28. 			<li><a href="gtl_polygon_concept.htm">Polygon Concept</a></li>
    29. 

  29. 			<li><a href="gtl_polygon_with_holes_concept.htm">Polygon With Holes Concept</a></li>
    30. 

  30. 			<li><a href="gtl_polygon_90_set_concept.htm">Polygon 90 Set Concept</a></li>
    31. 

  31. 			<li><a href="gtl_polygon_45_set_concept.htm">Polygon 45 Set Concept</a></li>
    32. 

  32. 			<li><a href="gtl_polygon_set_concept.htm">Polygon Set Concept</a></li>
    33. 

  33. 			<li><a href="gtl_connectivity_extraction_90.htm">Connectivity Extraction 90</a></li>
    34. 

  34. 			<li><a href="gtl_connectivity_extraction_45.htm">Connectivity Extraction 45</a></li>
    35. 

  35. 			<li><a href="gtl_connectivity_extraction.htm">Connectivity Extraction</a></li>
    36. 

  36. 			<li><a href="gtl_property_merge_90.htm">Property Merge 90</a></li>
    37. 

  37. 			<li><a href="gtl_property_merge_45.htm">Property Merge 45</a></li>
    38. 

  38. 			<li><a href="gtl_property_merge.htm">Property Merge</a></li>
    39. 

  39.         </ul>
    40. 

  40.         <h3 class="navbar">Other Resources</h3>
    41. 

  41.         <ul>
    42. 

  42.             <li><a href="GTL_boostcon2009.pdf">GTL Boostcon 2009 Paper</a></li>
    43. 

  43.              <li><a href="GTL_boostcon_draft03.pdf">GTL Boostcon 2009 
    44. 

  44. 				Presentation</a></li>
    45. 

  45.              <li><a href="analysis.htm">Performance Analysis</a></li>
    46. 

  46.         	<li><a href="gtl_tutorial.htm">Layout Versus Schematic Tutorial</a></li>
    47. 

  47.         	<li><a href="gtl_minkowski_tutorial.htm">Minkowski Sum Tutorial</a></li>
    48. 

  48.         </ul>
    49. 

  49.     </div>
    50. 

  50.         <h3 class="navbar">Polygon Sponsor</h3>
    51. 

  51.     <div style="padding: 5px;" align="center">
    52. 

  52.         <img border="0" src="images/intlogo.gif" width="127" height="51">
    53. 

  53.     </div>    
    54. 

  54. </td>
    55. 

  55. <td style="padding-left: 10px; padding-right: 10px; padding-bottom: 10px;" valign="top" width="100%">
    56. 

  56. 

  57. <!-- End Header -->
    58. 

  58. 

  59. <br>
    60. 

  60. <p>
    61. 

  61. </p><h1>Polygon 90 Concept</h1>
    62. 

  62. 

  63. <p> 
    64. 

  64. <p>The polygon_90 concept tag is <font face="Courier New">
    65. 

  65. polygon_90_concept</font></p>
    66. 

  66. <p> 
    67. 

  67. To register a user defined type as a model of  
    68. 

  68. <font face="Times New Roman">polygon_90 </font>concept, specialize the 
    69. 

  69. geometry concept meta-function for that type.&nbsp; In the example below CPolygon90 is registered as a model of 
    70. 

  70. polygon_90&nbsp; concept.<p> 
    71. 

  71. <font face="Courier New">template &lt;&gt;<br>
    72. 

  72. struct geometry_concept&lt;CPolygon90&gt; { typedef polygon_90_concept type; };</font><p> 
    73. 

  73. <font face="Times New Roman">The semantic of a polygon_90 is that it can provide 
    74. 

  74. iterators over the x and y coordinates that correspond to its horizontal and 
    75. 

  75. vertical sides, starting with an x coordinate.&nbsp; A mutable polygon_90 must 
    76. 

  76. also be able to set its geometry based on an interator range over such 
    77. 

  77. coordinates.&nbsp; Since most polygons use vertex points in internal storage 
    78. 

  78. iterator adaptors for converting to and from point sequences are provided in 
    79. 

  79. iterator_points_to_compact.hpp and iterator_compact_to_points.hpp to aid in the 
    80. 

  80. specialization of polygon_90_traits.&nbsp; A std::vector&lt;int&gt; or std::list&lt;int&gt; 
    81. 

  81. could be made models of polygon_90_concept by simply providing access to their 
    82. 

  82. iterators through traits.&nbsp; Library functions that create polygon objects 
    83. 

  83. require that those objects provide a default constructor.</font><p> 
    84. 

  84. <font face="Times New Roman">Below is shown the default polygon traits.&nbsp; 
    85. 

  85. Specialization of these traits is required for types that don't conform to the 
    86. 

  86. default behavior.&nbsp; Note that these traits are also used by the 
    87. 

  87. polygon_90_with_holes concept.</font><p><font face="Courier New">template &lt;typename 
    88. 

  88. T&gt;<br>
    89. 

  89. struct polygon_90_traits {<br>
    90. 

  90. &nbsp;&nbsp;&nbsp;&nbsp; typedef typename T::coordinate_type coordinate_type;<br>
    91. 

  91. &nbsp;&nbsp;&nbsp;&nbsp; typedef typename T::compact_iterator_type 
    92. 

  92. compact_iterator_type;<br>
    93. 

  93. &nbsp;&nbsp;&nbsp;&nbsp; static inline compact_iterator_type begin_compact(const 
    94. 

  94. T&amp; t) {<br>
    95. 

  95. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return t.begin_compact();<br>
    96. 

  96. &nbsp;&nbsp;&nbsp;&nbsp; }<br>
    97. 

  97. &nbsp;&nbsp;&nbsp;&nbsp; static inline compact_iterator_type end_compact(const 
    98. 

  98. T&amp; t) {<br>
    99. 

  99. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return t.end_compact();<br>
    100. 

  100. &nbsp;&nbsp;&nbsp;&nbsp; }<br>
    101. 

  101. &nbsp;&nbsp;&nbsp;&nbsp; static inline unsigned int size(const T&amp; t) {<br>
    102. 

  102. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return t.size();<br>
    103. 

  103. &nbsp;&nbsp;&nbsp;&nbsp; }<br>
    104. 

  104. &nbsp;&nbsp;&nbsp;&nbsp; static inline winding_direction winding(const T&amp; t) {<br>
    105. 

  105. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return unknown_winding;<br>
    106. 

  106. &nbsp;&nbsp;&nbsp;&nbsp; }<br>
    107. 

  107. };</font></p>
    108. 

  108. <p><font face="Courier New">template &lt;typename T&gt;<br>
    109. 

  109. struct polygon_90_mutable_traits { <br>
    110. 

  110. &nbsp;&nbsp;&nbsp;&nbsp; template &lt;typename iT&gt;<br>
    111. 

  111. &nbsp;&nbsp;&nbsp;&nbsp; static inline T&amp; set_compact(T&amp; t, iT input_begin, iT 
    112. 

  112. input_end) {<br>
    113. 

  113. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; t.set_compact(input_begin, 
    114. 

  114. input_end);<br>
    115. 

  115. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return t;<br>
    116. 

  116. &nbsp;&nbsp;&nbsp;&nbsp; }</font><br>
    117. 

  117. <font face="Courier New">};</font></p>
    118. 

  118. <p>An object that is a model of <font face="Courier New">
    119. 

  119. polygon_90_concept</font> can be viewed as a model of any of its 
    120. 

  120. refinements if it is determined at runtime to conform to the restriction of 
    121. 

  121. those concepts.&nbsp; This concept casting is accomplished through the
    122. 

  122. <font face="Courier New">view_as&lt;&gt;()</font> function.</p>
    123. 

  123. <p><font face="Courier New">view_as&lt;rectangle_concept&gt;(polygon_90_object)</font></p>
    124. 

  124. <p>The return value of <font face="Courier New">view_as&lt;&gt;()</font> can be 
    125. 

  125. passed into any interface that expects an object of the conceptual type 
    126. 

  126. specified in its template parameter.</p>
    127. 

  127. <h2>Functions</h2>
    128. 

  128. <table border="1" width="100%" id="table1">
    129. 

  129. 	<tr>
    130. 

  130. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    131. 

  131. 		compact_iterator_type <b>begin_compact</b>(const T&amp; polygon)</font></td>
    132. 

  132. 		<td><font face="Times New Roman">Expects a model of polygon_90.&nbsp; 
    133. 

  133. 		Returns the begin iterator over the range of coordinates that correspond 
    134. 

  134. 		to horizontal and vertical edges.</font></td>
    135. 

  135. 	</tr>
    136. 

  136. 	<tr>
    137. 

  137. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    138. 

  138. 		compact_iterator_type <b>end_compact</b>(const T&amp; polygon)</font></td>
    139. 

  139. 		<td><font face="Times New Roman">Expects a model of polygon_90.&nbsp; 
    140. 

  140. 		Returns the end iterator over the range of coordinates that correspond 
    141. 

  141. 		to horizontal and vertical edges.</font></td>
    142. 

  142. 	</tr>
    143. 

  143. 	<tr>
    144. 

  144. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    145. 

  145. 		point_iterator_type <b>begin_points</b>(const T&amp; polygon)</font></td>
    146. 

  146. 		<td><font face="Times New Roman">Expects a model of polygon_90.&nbsp; 
    147. 

  147. 		Returns the begin iterator over the range of points that correspond to 
    148. 

  148. 		vertices of the polygon.</font></td>
    149. 

  149. 	</tr>
    150. 

  150. 	<tr>
    151. 

  151. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    152. 

  152. 		point_iterator_type <b>end_points</b>(const T&amp; polygon)</font></td>
    153. 

  153. 		<td><font face="Times New Roman">Expects a model of polygon_90.&nbsp; 
    154. 

  154. 		Returns the end iterator over the range of points that correspond to 
    155. 

  155. 		vertices of the polygon.</font></td>
    156. 

  156. 	</tr>
    157. 

  157. 	<tr>
    158. 

  158. 		<td width="586"><font face="Courier New">template &lt;typename T, typename 
    159. 

  159. 		iterator&gt;<br>
    160. 

  160. 		void <b>set_compact</b>(T&amp; polygon, iterator b, iterator e)</font></td>
    161. 

  161. 		<td><font face="Times New Roman">Expects a model of polygon_90.&nbsp;&nbsp; 
    162. 

  162. 		Sets the polygon to the coordinate data range [b,e) that corresponds to 
    163. 

  163. 		.horizontal and vertical edges.</font></td>
    164. 

  164. 	</tr>
    165. 

  165. 	<tr>
    166. 

  166. 		<td width="586"><font face="Courier New">template &lt;typename T, typename 
    167. 

  167. 		iterator&gt;<br>
    168. 

  168. 		void <b>set_points</b>(T&amp; polygon, iterator b, iterator e)</font></td>
    169. 

  169. 		<td><font face="Times New Roman">Expects a model of polygon_90.&nbsp;&nbsp; 
    170. 

  170. 		Sets the polygon to the point data range [b,e) that corresponds to 
    171. 

  171. 		vertices of a manhattan polygon.&nbsp; Non-manhattan edges between 
    172. 

  172. 		successive input points results in undefined behavior.</font></td>
    173. 

  173. 	</tr>
    174. 

  174. 	<tr>
    175. 

  175. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    176. 

  176. 		unsigned int <b>size</b>(const T&amp; polygon)</font></td>
    177. 

  177. 		<td><font face="Times New Roman">Returns the number of edges in the 
    178. 

  178. 		polygon.</font></td>
    179. 

  179. 	</tr>
    180. 

  180. 	<tr>
    181. 

  181. 		<td width="586"><font face="Courier New">template &lt;typename T1, typename 
    182. 

  182. 		T2&gt;<br>
    183. 

  183. 		T1&amp; <b>assign</b>(T1&amp; left, const T2&amp; right)</font></td>
    184. 

  184. 		<td>Copies data from right object that models polygon_90 into left object 
    185. 

  185. 		that models polygon_90.</td>
    186. 

  186. 	</tr>
    187. 

  187. 	<tr>
    188. 

  188. 		<td width="586"><font face="Courier New">template &lt;typename T, 
    189. 

  189. 		typename point_type&gt;<br>
    190. 

  190. 		bool <b>contains</b>(const T&amp;, const point_type&amp; point, <br>
    191. 

  191. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
    192. 

  192. 		bool consider_touch=true)</font></td>
    193. 

  193. 		<td>Given an object that models polygon_90 and an object that models 
    194. 

  194. 		point, returns true 
    195. 

  195. 		if the polygon contains the point.&nbsp; If the consider_touch 
    196. 

  196. 		flag is true will return true if the point lies along the boundary of 
    197. 

  197. 		the polygon.&nbsp; Linear wrt. vertices.</td>
    198. 

  198. 	</tr>
    199. 

  199. 	<tr>
    200. 

  200. 		<td width="586"><font face="Courier New">// get the center coordinate<br>
    201. 

  201. 		template &lt;typename T, typename point_type&gt;<br>
    202. 

  202. 		void <b>center</b>(point_type&amp; p, const T&amp; polygon)</font></td>
    203. 

  203. 		<td>Sets object that models point to the center point of the bounding 
    204. 

  204. 		box of an object that models polygon_90.&nbsp; Linear wrt. vertices.</td>
    205. 

  205. 	</tr>
    206. 

  206. 	<tr>
    207. 

  207. 		<td width="586"><font face="Courier New">template &lt;typename T, 
    208. 

  208. 		typename rectangle_type&gt;<br>
    209. 

  209. 		bool <b>extents</b>(rectangle_type&amp; bbox, const T&amp; polygon)</font></td>
    210. 

  210. 		<td>Sets object that models rectangle to the bounding box of an object 
    211. 

  211. 		that models polygon_90 and returns true.&nbsp; Returns false and leaves 
    212. 

  212. 		bbox unchanged if polygon is empty.&nbsp; Linear wrt. vertices.</td>
    213. 

  213. 	</tr>
    214. 

  214. 	<tr>
    215. 

  215. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    216. 

  216. 		manhattan_area_type <b>area</b>(const T&amp; polygon)</font></td>
    217. 

  217. 		<td>Returns the area of an object 
    218. 

  218. 		that models polygon_90.&nbsp; Linear wrt. vertices.</td>
    219. 

  219. 	</tr>
    220. 

  220. 	<tr>
    221. 

  221. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    222. 

  222. 		direction_1d <b>winding</b>(const T&amp; polygon)</font></td>
    223. 

  223. 		<td>Returns the winding direction of an object 
    224. 

  224. 		that models polygon_90, LOW == CLOCKWISE, HIGH = COUNTERCLOCKWISE.&nbsp; 
    225. 

  225. 		Complexity depends upon winding trait.</td>
    226. 

  226. 	</tr>
    227. 

  227. 	<tr>
    228. 

  228. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    229. 

  229. 		coordinate_difference <b>perimeter</b>(const T&amp; polygon)</font></td>
    230. 

  230. 		<td>Returns the perimeter length of an object 
    231. 

  231. 		that models polygon_90.&nbsp; Linear wrt. vertices.</td>
    232. 

  232. 	</tr>
    233. 

  233. 	<tr>
    234. 

  234. 		<td width="586"><font face="Courier New">template &lt;typename T, 
    235. 

  235. 		typename transform_type&gt;<br>
    236. 

  236. 		T&amp; <b>transform</b>(T&amp; polygon, const transform_type&amp;)</font></td>
    237. 

  237. 		<td>Applies transform() on the vertices of polygon and sets the polygon to that described by the result of 
    238. 

  238. 		transforming its vertices.&nbsp; Linear wrt. vertices.</td>
    239. 

  239. 	</tr>
    240. 

  240. 	<tr>
    241. 

  241. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    242. 

  242. 		T&amp; <b>scale_up</b>(T&amp; polygon, unsigned_area_type factor)</font></td>
    243. 

  243. 		<td>Scales up coordinate of an object that models 
    244. 

  244. 		polygon_90 by unsigned factor.&nbsp; Linear wrt. vertices.</td>
    245. 

  245. 	</tr>
    246. 

  246. 	<tr>
    247. 

  247. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    248. 

  248. 		T&amp; <b>scale_down</b>(T&amp; polygon, unsigned_area_type factor)</font></td>
    249. 

  249. 		<td>Scales down coordinates of an object that models 
    250. 

  250. 		polygon_90 by unsigned factor.&nbsp; Linear wrt. vertices.</td>
    251. 

  251. 	</tr>
    252. 

  252. 	<tr>
    253. 

  253. 		<td width="586"><font face="Courier New">template &lt;typename T, scaling_type&gt;<br>
    254. 

  254. 		T&amp; <b>scale</b>(T&amp; rectangle, double scaling) </font></td>
    255. 

  255. 		<td>Scales coordinates of an object that models polygon_90 by floating 
    256. 

  256. 		point factor.&nbsp; Linear wrt. vertices.</td>
    257. 

  257. 	</tr>
    258. 

  258. 	<tr>
    259. 

  259. 		<td width="586"><font face="Courier New">template &lt;typename T&gt;<br>
    260. 

  260. 		T&amp; <b>move</b>(T&amp; polygon, orientation_2d,<br>
    261. 

  261. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; coordinate_difference displacement)</font></td>
    262. 

  262. 		<td>Adds displacement value to coordinate indicated by orientation_2d of 
    263. 

  263. 		vertices of an object that models polygon_90 .&nbsp; Linear wrt. 
    264. 

  264. 		vertices.</td>
    265. 

  265. 	</tr>
    266. 

  266. 	<tr>
    267. 

  267. 		<td width="586"><font face="Courier New">template &lt;typename polygon_type, typename point_type&gt;<br>
    268. 

  268. 		polygon_type&amp; <b>convolve</b>(polygon_type&amp; polygon,<br>
    269. 

  269. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
    270. 

  270. 		const point_type&amp; point)</font></td>
    271. 

  271. 		<td>Convolves coordinate values of point with vertices of an 
    272. 

  272. 		object that models polygon_90.&nbsp; Linear wrt. vertices.</td>
    273. 

  273. 	</tr>
    274. 

  274. 	</table>
    275. 

  275. 	<h1>Polygon 90 Data</h1>
    276. 

  276. 

  277. <p> 
    278. 

  278. <p>The library provides a model of polygon 90 concept declared
    279. 

  279. <font face="Courier New">
    280. 

  280. template&lt;typename T&gt; polygon_90_data </font>where T is the coordinate type.</p>
    281. 

  281. <p>This data type is used internally when a Manhattan polygon is needed and is 
    282. 

  282. available to the library user who finds it convenient to use a library polygon 
    283. 

  283. data type instead of providing their own.&nbsp; The data type is implemented to 
    284. 

  284. be convenient to use with the library traits.</p>
    285. 

  285. <h2>Members</h2>
    286. 

  286. <table border="1" width="100%" id="table2">
    287. 

  287. 	<tr>
    288. 

  288. 		<td width="586"><b><font face="Courier New">geometry_type</font></b></td>
    289. 

  289. 		<td><font face="Times New Roman">polygon_90_concept</font></td>
    290. 

  290. 	</tr>
    291. 

  291. 	<tr>
    292. 

  292. 		<td width="586"><b><font face="Courier New">coordinate_type</font></b></td>
    293. 

  293. 		<td><font face="Times New Roman">T</font></td>
    294. 

  294. 	</tr>
    295. 

  295. 	<tr>
    296. 

  296. 		<td width="586"><b><font face="Courier New">iterator_type</font></b></td>
    297. 

  297. 		<td>Iterator over vertices point_data&lt;T&gt; vertices of polygon</td>
    298. 

  298. 	</tr>
    299. 

  299. 	<tr>
    300. 

  300. 		<td width="586"><b><font face="Courier New">compact_iterator_type</font></b></td>
    301. 

  301. 		<td><font face="Times New Roman">Iterator over non-redundant coordinates 
    302. 

  302. 		of the polygon, alternating x, y, x, y starting with an x, where each x 
    303. 

  303. 		corresponds to a vertical edge and each y corresponds to a horizontal 
    304. 

  304. 		edge.</font></td>
    305. 

  305. 	</tr>
    306. 

  306. 	<tr>
    307. 

  307. 		<td width="586"><font face="Courier New"><b>polygon_90_data</b>()</font></td>
    308. 

  308. 		<td><font face="Times New Roman">Default constructs the </font>polygon.</td>
    309. 

  309. 	</tr>
    310. 

  310. 	<tr>
    311. 

  311. 		<td width="586"><font face="Courier New"><b>polygon_90_data</b>(const 
    312. 

  312. 		polygon_90_data&amp; that)</font></td>
    313. 

  313. 		<td><font face="Times New Roman">Copy construct</font></td>
    314. 

  314. 	</tr>
    315. 

  315. 	<tr>
    316. 

  316. 		<td width="586"><font face="Courier New">polygon_90_data&amp; <b>operator=</b>(const 
    317. 

  317. 		polygon_90_data&amp; that)</font></td>
    318. 

  318. 		<td>Assignment operator.</td>
    319. 

  319. 	</tr>
    320. 

  320. 	<tr>
    321. 

  321. 		<td width="586"><font face="Courier New">template &lt;typename T2&gt;<b>&nbsp; 
    322. 

  322. 		<br> </b>polygon_90_data&amp; <b>operator=</b>(const T2&amp; that) const</font></td>
    323. 

  323. 		<td>Assign from an object that is a model of polygon 90.</td>
    324. 

  324. 	</tr>
    325. 

  325. 	<tr>
    326. 

  326. 		<td width="586"><font face="Courier New">iterator_type <b>begin</b>() 
    327. 

  327. 		const</font></td>
    328. 

  328. 		<td>Get the begin iterator over vertices of the polygon.</td>
    329. 

  329. 	</tr>
    330. 

  330. 	<tr>
    331. 

  331. 		<td width="586"><font face="Courier New">iterator_type <b>end</b>() 
    332. 

  332. 		const</font></td>
    333. 

  333. 		<td>Get the end iterator over vertices of the polygon.</td>
    334. 

  334. 	</tr>
    335. 

  335. 	<tr>
    336. 

  336. 		<td width="586"><font face="Courier New">compact_iterator_type <b>
    337. 

  337. 		begin_compact</b>() const</font></td>
    338. 

  338. 		<td>Get the begin compact iterator over non-redundant coordinates of the 
    339. 

  339. 		polygon.</td>
    340. 

  340. 	</tr>
    341. 

  341. 	<tr>
    342. 

  342. 		<td width="586"><font face="Courier New">compact_iterator_type <b>
    343. 

  343. 		end_compact</b>() const</font></td>
    344. 

  344. 		<td>Get the end compact iterator over non-redundant coordinates of the 
    345. 

  345. 		polygon.</td>
    346. 

  346. 	</tr>
    347. 

  347. 	<tr>
    348. 

  348. 		<td width="586"><font face="Courier New">std::size_t <b>size</b>() const</font></td>
    349. 

  349. 		<td>Get the number of elements in the sequence stored to the polygon, 
    350. 

  350. 		usually equal to the number of edges of the polygon.</td>
    351. 

  351. 	</tr>
    352. 

  352. 	<tr>
    353. 

  353. 		<td width="586"><font face="Courier New">template &lt;typename iT&gt;<b>&nbsp; 
    354. 

  354. 		<br> </b>void <b>set</b>(iT begin_points, iT end_points)</font></td>
    355. 

  355. 		<td>Sets the polygon to the iterator range of points.&nbsp; No check is 
    356. 

  356. 		performed to ensure the points describe a Manhattan figure, every other 
    357. 

  357. 		x and y value of the points is used to initialize the polygon.</td>
    358. 

  358. 	</tr>
    359. 

  359. 	<tr>
    360. 

  360. 		<td width="586"><font face="Courier New">template &lt;typename iT&gt;<b>&nbsp; 
    361. 

  361. 		<br> </b>void <b>set_compact</b>(iT begin_coords, iT end_coords)</font></td>
    362. 

  362. 		<td>Sets the polygon to the iterator range of coordinates.&nbsp; These 
    363. 

  363. 		coordinates correspond to the x values of vertical edges and y values of 
    364. 

  364. 		horizontal edges.&nbsp; It is expected that the sequence start with an x 
    365. 

  365. 		value and proceed x then y then x then y.</td>
    366. 

  366. 	</tr>
    367. 

  367. </table>
    368. 

  368. 	<tr>
    369. 

  369. <td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top">
    370. 

  370.     &nbsp;</td>
    371. 

  371. <td style="padding-left: 10px; padding-right: 10px; padding-bottom: 10px;" valign="top" width="100%">
    372. 

  372. 

  373. 

  374. <table class="docinfo" rules="none" frame="void" id="table3">
    375. 

  375. 	<colgroup>
    376. 

  376. 		<col class="docinfo-name"><col class="docinfo-content">
    377. 

  377. 	</colgroup>
    378. 

  378. 	<tbody vAlign="top">
    379. 

  379. 		<tr>
    380. 

  380. 			<th class="docinfo-name">Copyright:</th>
    381. 

  381. 			<td>Copyright Š Intel Corporation 2008-2010.</td>
    382. 

  382. 		</tr>
    383. 

  383. 		<tr class="field">
    384. 

  384. 			<th class="docinfo-name">License:</th>
    385. 

  385. 			<td class="field-body">Distributed under the Boost Software License, 
    386. 

  386. 			Version 1.0. (See accompanying file <tt class="literal">
    387. 

  387. 			<span class="pre">LICENSE_1_0.txt</span></tt> or copy at
    388. 

  388. 			<a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
    389. 

  389. 			http://www.boost.org/LICENSE_1_0.txt</a>)</td>
    390. 

  390. 		</tr>
    391. 

  391. </table>
    392. 

  392. 

  393. </html>
    394.