mirror of
https://github.com/boostorg/geometry.git
synced 2025-05-12 14:01:47 +00:00
368 lines
31 KiB
HTML
368 lines
31 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||
<html>
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
|
||
<title>Boost.Geometry (aka GGL, Generic Geometry Library)</title>
|
||
<link href="doxygen.css" rel="stylesheet" type="text/css">
|
||
<link href="tabs.css" rel="stylesheet" type="text/css">
|
||
</head>
|
||
|
||
<table cellpadding="2" width="100%">
|
||
<tbody>
|
||
<tr>
|
||
<td valign="top">
|
||
<img alt="Boost.Geometry" src="images/ggl-logo-big.png" height="80" width="200">
|
||
|
||
</td>
|
||
<td valign="top" align="right">
|
||
<a href="http://www.boost.org">
|
||
<img alt="Boost C++ Libraries" src="images/accepted_by_boost.png" height="80" width="230" border="0">
|
||
</a>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
<!-- Generated by Doxygen 1.5.9 -->
|
||
<div class="navigation" id="top">
|
||
<div class="tabs">
|
||
<ul>
|
||
<li><a href="index.html"><span>Main Page</span></a></li>
|
||
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
||
<li><a href="modules.html"><span>Modules</span></a></li>
|
||
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
||
<li><a href="annotated.html"><span>Classes</span></a></li>
|
||
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
||
<li><a href="examples.html"><span>Examples</span></a></li>
|
||
</ul>
|
||
</div>
|
||
<div class="tabs">
|
||
<ul>
|
||
<li><a href="files.html"><span>File List</span></a></li>
|
||
<li><a href="globals.html"><span>File Members</span></a></li>
|
||
</ul>
|
||
</div>
|
||
<h1>boost/geometry/algorithms/equals.hpp</h1><a href="equals_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Boost.Geometry (aka GGL, Generic Geometry Library)</span>
|
||
<a name="l00002"></a>00002 <span class="comment">//</span>
|
||
<a name="l00003"></a>00003 <span class="comment">// Copyright Barend Gehrels 2007-2009, Geodan, Amsterdam, the Netherlands.</span>
|
||
<a name="l00004"></a>00004 <span class="comment">// Copyright Bruno Lalande 2008, 2009</span>
|
||
<a name="l00005"></a>00005 <span class="comment">// Use, modification and distribution is subject to the Boost Software License,</span>
|
||
<a name="l00006"></a>00006 <span class="comment">// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at</span>
|
||
<a name="l00007"></a>00007 <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span>
|
||
<a name="l00008"></a>00008
|
||
<a name="l00009"></a>00009 <span class="preprocessor">#ifndef BOOST_GEOMETRY_ALGORITHMS_EQUALS_HPP</span>
|
||
<a name="l00010"></a>00010 <span class="preprocessor"></span><span class="preprocessor">#define BOOST_GEOMETRY_ALGORITHMS_EQUALS_HPP</span>
|
||
<a name="l00011"></a>00011 <span class="preprocessor"></span>
|
||
<a name="l00030"></a>00030 <span class="preprocessor">#include <cstddef></span>
|
||
<a name="l00031"></a>00031 <span class="preprocessor">#include <deque></span>
|
||
<a name="l00032"></a>00032
|
||
<a name="l00033"></a>00033 <span class="preprocessor">#include <boost/static_assert.hpp></span>
|
||
<a name="l00034"></a>00034 <span class="preprocessor">#include <boost/range/functions.hpp></span>
|
||
<a name="l00035"></a>00035 <span class="preprocessor">#include <boost/range/metafunctions.hpp></span>
|
||
<a name="l00036"></a>00036
|
||
<a name="l00037"></a>00037 <span class="preprocessor">#include <<a class="code" href="access_8hpp.html">boost/geometry/core/access.hpp</a>></span>
|
||
<a name="l00038"></a>00038 <span class="preprocessor">#include <<a class="code" href="coordinate__dimension_8hpp.html">boost/geometry/core/coordinate_dimension.hpp</a>></span>
|
||
<a name="l00039"></a>00039 <span class="preprocessor">#include <<a class="code" href="core_2is__multi_8hpp.html">boost/geometry/core/is_multi.hpp</a>></span>
|
||
<a name="l00040"></a>00040 <span class="preprocessor">#include <<a class="code" href="interior__rings_8hpp.html">boost/geometry/core/interior_rings.hpp</a>></span>
|
||
<a name="l00041"></a>00041
|
||
<a name="l00042"></a>00042 <span class="preprocessor">#include <<a class="code" href="detail_2disjoint_8hpp.html">boost/geometry/algorithms/detail/disjoint.hpp</a>></span>
|
||
<a name="l00043"></a>00043 <span class="preprocessor">#include <<a class="code" href="not_8hpp.html">boost/geometry/algorithms/detail/not.hpp</a>></span>
|
||
<a name="l00044"></a>00044 <span class="preprocessor">#include <<a class="code" href="algorithms_2area_8hpp.html">boost/geometry/algorithms/area.hpp</a>></span>
|
||
<a name="l00045"></a>00045 <span class="preprocessor">#include <<a class="code" href="get__intersection__points_8hpp.html">boost/geometry/algorithms/overlay/get_intersection_points.hpp</a>></span>
|
||
<a name="l00046"></a>00046 <span class="preprocessor">#include <<a class="code" href="merge__intersection__points_8hpp.html">boost/geometry/algorithms/overlay/merge_intersection_points.hpp</a>></span>
|
||
<a name="l00047"></a>00047 <span class="preprocessor">#include <<a class="code" href="geometries_2concepts_2check_8hpp.html">boost/geometry/geometries/concepts/check.hpp</a>></span>
|
||
<a name="l00048"></a>00048 <span class="preprocessor">#include <<a class="code" href="math_8hpp.html">boost/geometry/util/math.hpp</a>></span>
|
||
<a name="l00049"></a>00049
|
||
<a name="l00050"></a>00050
|
||
<a name="l00051"></a>00051
|
||
<a name="l00052"></a>00052 <span class="keyword">namespace </span>boost { <span class="keyword">namespace </span>geometry
|
||
<a name="l00053"></a>00053 {
|
||
<a name="l00054"></a>00054
|
||
<a name="l00055"></a>00055 <span class="preprocessor">#ifndef DOXYGEN_NO_DETAIL</span>
|
||
<a name="l00056"></a>00056 <span class="preprocessor"></span><span class="keyword">namespace </span>detail { <span class="keyword">namespace </span><a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a> {
|
||
<a name="l00057"></a>00057
|
||
<a name="l00058"></a>00058
|
||
<a name="l00059"></a>00059 <span class="keyword">template</span>
|
||
<a name="l00060"></a>00060 <
|
||
<a name="l00061"></a>00061 <span class="keyword">typename</span> Box1,
|
||
<a name="l00062"></a>00062 <span class="keyword">typename</span> Box2,
|
||
<a name="l00063"></a>00063 std::size_t Dimension,
|
||
<a name="l00064"></a>00064 std::size_t DimensionCount
|
||
<a name="l00065"></a>00065 >
|
||
<a name="l00066"></a>00066 <span class="keyword">struct </span>box_box
|
||
<a name="l00067"></a>00067 {
|
||
<a name="l00068"></a>00068 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(Box1 <span class="keyword">const</span>& box1, Box2 <span class="keyword">const</span>& box2)
|
||
<a name="l00069"></a>00069 {
|
||
<a name="l00070"></a>00070 <span class="keywordflow">if</span> (!<a class="code" href="group__utility.html#g8d2104edb28c2cecaa93e0a7e6308b77" title="returns true if both arguments are equal.">geometry::math::equals</a>(get<min_corner, Dimension>(box1), get<min_corner, Dimension>(box2))
|
||
<a name="l00071"></a>00071 || !<a class="code" href="group__utility.html#g8d2104edb28c2cecaa93e0a7e6308b77" title="returns true if both arguments are equal.">geometry::math::equals</a>(get<max_corner, Dimension>(box1), get<max_corner, Dimension>(box2)))
|
||
<a name="l00072"></a>00072 {
|
||
<a name="l00073"></a>00073 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||
<a name="l00074"></a>00074 }
|
||
<a name="l00075"></a>00075 <span class="keywordflow">return</span> box_box<Box1, Box2, Dimension + 1, DimensionCount>::apply(box1, box2);
|
||
<a name="l00076"></a>00076 }
|
||
<a name="l00077"></a>00077 };
|
||
<a name="l00078"></a>00078
|
||
<a name="l00079"></a>00079 <span class="keyword">template</span> <<span class="keyword">typename</span> Box1, <span class="keyword">typename</span> Box2, std::<span class="keywordtype">size_t</span> DimensionCount>
|
||
<a name="l00080"></a>00080 <span class="keyword">struct </span>box_box<Box1, Box2, DimensionCount, DimensionCount>
|
||
<a name="l00081"></a>00081 {
|
||
<a name="l00082"></a>00082 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(Box1 <span class="keyword">const</span>& , Box2 <span class="keyword">const</span>& )
|
||
<a name="l00083"></a>00083 {
|
||
<a name="l00084"></a>00084 <span class="keywordflow">return</span> <span class="keyword">true</span>;
|
||
<a name="l00085"></a>00085 }
|
||
<a name="l00086"></a>00086 };
|
||
<a name="l00087"></a>00087
|
||
<a name="l00088"></a>00088
|
||
<a name="l00089"></a>00089 <span class="keyword">template</span> <<span class="keyword">typename</span> Ring1, <span class="keyword">typename</span> Ring2>
|
||
<a name="l00090"></a>00090 <span class="keyword">struct </span>ring_ring
|
||
<a name="l00091"></a>00091 {
|
||
<a name="l00092"></a>00092 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(Ring1 <span class="keyword">const</span>& ring1, Ring2 <span class="keyword">const</span>& ring2, <span class="keywordtype">bool</span> check_area = <span class="keyword">true</span>)
|
||
<a name="l00093"></a>00093 {
|
||
<a name="l00094"></a>00094 <span class="comment">// Note: this implementation makes use of getting interections</span>
|
||
<a name="l00095"></a>00095 <span class="comment">// and merge them. If all IP's disappear, the ring should be the same</span>
|
||
<a name="l00096"></a>00096 <span class="comment">// (because merging removes collinear or non-collinear</span>
|
||
<a name="l00097"></a>00097 <span class="comment">// IP's following the same path)</span>
|
||
<a name="l00098"></a>00098 <span class="comment">// However, this implementation should be redone using</span>
|
||
<a name="l00099"></a>00099 <span class="comment">// a linear time algorithm (getting left-most points of both</span>
|
||
<a name="l00100"></a>00100 <span class="comment">// and follow them using circular iterator and distance/side)</span>
|
||
<a name="l00101"></a>00101
|
||
<a name="l00102"></a>00102 <span class="comment">// obvious check, area's should be the same.</span>
|
||
<a name="l00103"></a>00103 <span class="keywordflow">if</span> (check_area && <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">geometry::area</a>(ring1) != <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">geometry::area</a>(ring2))
|
||
<a name="l00104"></a>00104 {
|
||
<a name="l00105"></a>00105 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||
<a name="l00106"></a>00106 }
|
||
<a name="l00107"></a>00107 <span class="comment">// We could check more (perimeter,centroid,envelope)</span>
|
||
<a name="l00108"></a>00108 <span class="comment">// For now we go directly to intersection points</span>
|
||
<a name="l00109"></a>00109
|
||
<a name="l00110"></a>00110 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<Ring1>::type point_type;
|
||
<a name="l00111"></a>00111 <span class="keyword">typedef</span> detail::intersection::intersection_point<point_type> ip_type;
|
||
<a name="l00112"></a>00112 <span class="keyword">typedef</span> std::deque<ip_type> container_type;
|
||
<a name="l00113"></a>00113
|
||
<a name="l00114"></a>00114 container_type ips;
|
||
<a name="l00115"></a>00115
|
||
<a name="l00116"></a>00116
|
||
<a name="l00117"></a>00117 <a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">geometry::get_intersection_points</a>(ring1, ring2, ips);
|
||
<a name="l00118"></a>00118 <span class="keywordflow">if</span> (ips.size() == 0)
|
||
<a name="l00119"></a>00119 {
|
||
<a name="l00120"></a>00120 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||
<a name="l00121"></a>00121 }
|
||
<a name="l00122"></a>00122 geometry::merge_intersection_points(ips);
|
||
<a name="l00123"></a>00123 <span class="keywordflow">if</span> (ips.size() == 0)
|
||
<a name="l00124"></a>00124 {
|
||
<a name="l00125"></a>00125 <span class="comment">// All IP's are merged. Meaning collinear / path can be followed</span>
|
||
<a name="l00126"></a>00126 <span class="keywordflow">return</span> <span class="keyword">true</span>;
|
||
<a name="l00127"></a>00127 }
|
||
<a name="l00128"></a>00128
|
||
<a name="l00129"></a>00129 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||
<a name="l00130"></a>00130 }
|
||
<a name="l00131"></a>00131 };
|
||
<a name="l00132"></a>00132
|
||
<a name="l00133"></a>00133
|
||
<a name="l00134"></a>00134 <span class="keyword">template</span> <<span class="keyword">typename</span> Polygon1, <span class="keyword">typename</span> Polygon2>
|
||
<a name="l00135"></a>00135 <span class="keyword">struct </span>polygon_polygon
|
||
<a name="l00136"></a>00136 {
|
||
<a name="l00137"></a>00137
|
||
<a name="l00138"></a>00138 <span class="keyword">struct </span>sortable
|
||
<a name="l00139"></a>00139 {
|
||
<a name="l00140"></a>00140 <span class="keywordtype">int</span> index;
|
||
<a name="l00141"></a>00141 <span class="keywordtype">double</span> <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">area</a>;
|
||
<a name="l00142"></a>00142 <span class="keywordtype">bool</span> counterpart_found;
|
||
<a name="l00143"></a>00143 <span class="keyword">inline</span> sortable(<span class="keywordtype">int</span> i, <span class="keywordtype">double</span> a)
|
||
<a name="l00144"></a>00144 : index(i)
|
||
<a name="l00145"></a>00145 , <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">area</a>(a)
|
||
<a name="l00146"></a>00146 , counterpart_found(false)
|
||
<a name="l00147"></a>00147 {}
|
||
<a name="l00148"></a>00148
|
||
<a name="l00149"></a>00149 <span class="keyword">inline</span> <span class="keywordtype">bool</span> operator<(sortable <span class="keyword">const</span>& other)<span class="keyword"> const</span>
|
||
<a name="l00150"></a>00150 <span class="keyword"> </span>{
|
||
<a name="l00151"></a>00151 <span class="keywordflow">return</span> <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">area</a> < other.area;
|
||
<a name="l00152"></a>00152 }
|
||
<a name="l00153"></a>00153 };
|
||
<a name="l00154"></a>00154
|
||
<a name="l00155"></a>00155
|
||
<a name="l00156"></a>00156 <span class="keyword">template</span> <<span class="keyword">typename</span> Poly>
|
||
<a name="l00157"></a>00157 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> fill_sortable(Poly <span class="keyword">const</span>& polygon, std::vector<sortable>& v)
|
||
<a name="l00158"></a>00158 {
|
||
<a name="l00159"></a>00159 <span class="keywordtype">int</span> i = 0;
|
||
<a name="l00160"></a>00160 <span class="keywordflow">for</span> (<span class="keyword">typename</span> boost::range_const_iterator
|
||
<a name="l00161"></a>00161 <
|
||
<a name="l00162"></a>00162 <span class="keyword">typename</span> interior_type<Poly>::type
|
||
<a name="l00163"></a>00163 >::type it = boost::begin(<a class="code" href="group__access.html#g5af585b056bb80bf3dfe7c07ad30d84a" title="Function to get the interior rings of a polygon (non const version).">interior_rings</a>(polygon));
|
||
<a name="l00164"></a>00164 it != boost::end(<a class="code" href="group__access.html#g5af585b056bb80bf3dfe7c07ad30d84a" title="Function to get the interior rings of a polygon (non const version).">interior_rings</a>(polygon));
|
||
<a name="l00165"></a>00165 ++it, ++i)
|
||
<a name="l00166"></a>00166 {
|
||
<a name="l00167"></a>00167 v.push_back(sortable(i, <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">geometry::area</a>(*it)));
|
||
<a name="l00168"></a>00168 }
|
||
<a name="l00169"></a>00169 std::sort(v.begin(), v.end());
|
||
<a name="l00170"></a>00170
|
||
<a name="l00171"></a>00171 <span class="comment">/***</span>
|
||
<a name="l00172"></a>00172 <span class="comment"> for (typename std::vector<sortable>::iterator it = v.begin();</span>
|
||
<a name="l00173"></a>00173 <span class="comment"> it != v.end();</span>
|
||
<a name="l00174"></a>00174 <span class="comment"> ++it)</span>
|
||
<a name="l00175"></a>00175 <span class="comment"> {</span>
|
||
<a name="l00176"></a>00176 <span class="comment"> std::cout << "Ring: " << it->index << " area: " << it->area << std::endl;</span>
|
||
<a name="l00177"></a>00177 <span class="comment"> }</span>
|
||
<a name="l00178"></a>00178 <span class="comment"> ***/</span>
|
||
<a name="l00179"></a>00179 }
|
||
<a name="l00180"></a>00180
|
||
<a name="l00181"></a>00181 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(Polygon1 <span class="keyword">const</span>& polygon1, Polygon2 <span class="keyword">const</span>& polygon2)
|
||
<a name="l00182"></a>00182 {
|
||
<a name="l00183"></a>00183 <span class="comment">// Check number of rings (area check is done in exterior ring check)</span>
|
||
<a name="l00184"></a>00184 <span class="keywordflow">if</span> (<a class="code" href="group__access.html#gfed6b5ddd56682edff7b3b123bd26992" title="Function to get the number of interior rings of a polygon.">geometry::num_interior_rings</a>(polygon1) != <a class="code" href="group__access.html#gfed6b5ddd56682edff7b3b123bd26992" title="Function to get the number of interior rings of a polygon.">geometry::num_interior_rings</a>(polygon2))
|
||
<a name="l00185"></a>00185 {
|
||
<a name="l00186"></a>00186 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||
<a name="l00187"></a>00187 }
|
||
<a name="l00188"></a>00188
|
||
<a name="l00189"></a>00189 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::ring_type<Polygon1>::type ring_type1;
|
||
<a name="l00190"></a>00190 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::ring_type<Polygon2>::type ring_type2;
|
||
<a name="l00191"></a>00191 <span class="keyword">typedef</span> ring_ring<ring_type1, ring_type2> compare;
|
||
<a name="l00192"></a>00192
|
||
<a name="l00193"></a>00193 <span class="comment">// Check exterior ring</span>
|
||
<a name="l00194"></a>00194 <span class="keywordflow">if</span> (! compare::apply(<a class="code" href="group__access.html#gd96ba07cd3c6c3216bd5ab69adc9ccb5" title="Function to get the exterior_ring ring of a polygon.">exterior_ring</a>(polygon1), <a class="code" href="group__access.html#gd96ba07cd3c6c3216bd5ab69adc9ccb5" title="Function to get the exterior_ring ring of a polygon.">exterior_ring</a>(polygon2)))
|
||
<a name="l00195"></a>00195 {
|
||
<a name="l00196"></a>00196 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||
<a name="l00197"></a>00197 }
|
||
<a name="l00198"></a>00198
|
||
<a name="l00199"></a>00199 <span class="comment">// Check interior rings -> first sort them on area ,</span>
|
||
<a name="l00200"></a>00200 <span class="comment">// for performance reasons (area is not re-calculated in ring-compare)</span>
|
||
<a name="l00201"></a>00201 std::vector<sortable> int1, int2;
|
||
<a name="l00202"></a>00202
|
||
<a name="l00203"></a>00203 fill_sortable(polygon1, int1);
|
||
<a name="l00204"></a>00204 fill_sortable(polygon2, int2);
|
||
<a name="l00205"></a>00205
|
||
<a name="l00206"></a>00206 std::size_t n = 0;
|
||
<a name="l00207"></a>00207
|
||
<a name="l00208"></a>00208 <span class="keyword">typename</span> interior_type<Polygon1>::type <span class="keyword">const</span>& rings1
|
||
<a name="l00209"></a>00209 = <a class="code" href="group__access.html#g5af585b056bb80bf3dfe7c07ad30d84a" title="Function to get the interior rings of a polygon (non const version).">interior_rings</a>(polygon1);
|
||
<a name="l00210"></a>00210 <span class="keyword">typename</span> interior_type<Polygon2>::type <span class="keyword">const</span>& rings2
|
||
<a name="l00211"></a>00211 = <a class="code" href="group__access.html#g5af585b056bb80bf3dfe7c07ad30d84a" title="Function to get the interior rings of a polygon (non const version).">interior_rings</a>(polygon2);
|
||
<a name="l00212"></a>00212
|
||
<a name="l00213"></a>00213 <span class="comment">// Compare all rings (having equal area)</span>
|
||
<a name="l00214"></a>00214 <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<sortable>::iterator it1 = int1.begin();
|
||
<a name="l00215"></a>00215 it1 != int1.end();
|
||
<a name="l00216"></a>00216 ++it1)
|
||
<a name="l00217"></a>00217 {
|
||
<a name="l00218"></a>00218 <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<sortable>::iterator it2 = int2.begin();
|
||
<a name="l00219"></a>00219 ! it1->counterpart_found
|
||
<a name="l00220"></a>00220 && it2 != int2.end()
|
||
<a name="l00221"></a>00221 && it2->area <= it1->area; <span class="comment">//+epsilon</span>
|
||
<a name="l00222"></a>00222 ++it2)
|
||
<a name="l00223"></a>00223 {
|
||
<a name="l00224"></a>00224 <span class="keywordflow">if</span> (! it2->counterpart_found
|
||
<a name="l00225"></a>00225 && <a class="code" href="group__utility.html#g8d2104edb28c2cecaa93e0a7e6308b77" title="returns true if both arguments are equal.">geometry::math::equals</a>(it1->area, it2->area))
|
||
<a name="l00226"></a>00226 {
|
||
<a name="l00227"></a>00227 <span class="keywordflow">if</span> (compare::apply(rings1[it1->index],
|
||
<a name="l00228"></a>00228 rings2[it2->index], <span class="keyword">false</span>))
|
||
<a name="l00229"></a>00229 {
|
||
<a name="l00230"></a>00230 it1->counterpart_found = <span class="keyword">true</span>;
|
||
<a name="l00231"></a>00231 it2->counterpart_found = <span class="keyword">true</span>;
|
||
<a name="l00232"></a>00232 n++;
|
||
<a name="l00233"></a>00233 }
|
||
<a name="l00234"></a>00234 }
|
||
<a name="l00235"></a>00235 }
|
||
<a name="l00236"></a>00236 }
|
||
<a name="l00237"></a>00237
|
||
<a name="l00238"></a>00238 <span class="keywordflow">return</span> n == <a class="code" href="group__access.html#gfed6b5ddd56682edff7b3b123bd26992" title="Function to get the number of interior rings of a polygon.">geometry::num_interior_rings</a>(polygon1);
|
||
<a name="l00239"></a>00239 }
|
||
<a name="l00240"></a>00240 };
|
||
<a name="l00241"></a>00241
|
||
<a name="l00242"></a>00242
|
||
<a name="l00243"></a>00243 }} <span class="comment">// namespace detail::equals</span>
|
||
<a name="l00244"></a>00244 <span class="preprocessor">#endif // DOXYGEN_NO_DETAIL</span>
|
||
<a name="l00245"></a>00245 <span class="preprocessor"></span>
|
||
<a name="l00246"></a>00246
|
||
<a name="l00247"></a>00247 <span class="preprocessor">#ifndef DOXYGEN_NO_DISPATCH</span>
|
||
<a name="l00248"></a>00248 <span class="preprocessor"></span><span class="keyword">namespace </span>dispatch
|
||
<a name="l00249"></a>00249 {
|
||
<a name="l00250"></a>00250
|
||
<a name="l00251"></a>00251 <span class="keyword">template</span>
|
||
<a name="l00252"></a>00252 <
|
||
<a name="l00253"></a>00253 <span class="keyword">typename</span> Tag1, <span class="keyword">typename</span> Tag2,
|
||
<a name="l00254"></a>00254 <span class="keywordtype">bool</span> IsMulti1, <span class="keywordtype">bool</span> IsMulti2,
|
||
<a name="l00255"></a>00255 <span class="keyword">typename</span> Geometry1,
|
||
<a name="l00256"></a>00256 <span class="keyword">typename</span> Geometry2,
|
||
<a name="l00257"></a>00257 std::size_t DimensionCount
|
||
<a name="l00258"></a>00258 >
|
||
<a name="l00259"></a>00259 <span class="keyword">struct </span><a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a>
|
||
<a name="l00260"></a>00260 {};
|
||
<a name="l00261"></a>00261
|
||
<a name="l00262"></a>00262
|
||
<a name="l00263"></a>00263 <span class="keyword">template</span> <<span class="keyword">typename</span> P1, <span class="keyword">typename</span> P2, std::<span class="keywordtype">size_t</span> DimensionCount>
|
||
<a name="l00264"></a>00264 <span class="keyword">struct </span><a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a><point_tag, point_tag, false, false, P1, P2, DimensionCount>
|
||
<a name="l00265"></a>00265 : geometry::detail::not_
|
||
<a name="l00266"></a>00266 <
|
||
<a name="l00267"></a>00267 P1,
|
||
<a name="l00268"></a>00268 P2,
|
||
<a name="l00269"></a>00269 detail::disjoint::point_point<P1, P2, 0, DimensionCount>
|
||
<a name="l00270"></a>00270 >
|
||
<a name="l00271"></a>00271 {};
|
||
<a name="l00272"></a>00272
|
||
<a name="l00273"></a>00273
|
||
<a name="l00274"></a>00274 <span class="keyword">template</span> <<span class="keyword">typename</span> Box1, <span class="keyword">typename</span> Box2, std::<span class="keywordtype">size_t</span> DimensionCount>
|
||
<a name="l00275"></a>00275 <span class="keyword">struct </span><a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a><box_tag, box_tag, false, false, Box1, Box2, DimensionCount>
|
||
<a name="l00276"></a>00276 : detail::<a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a>::box_box<Box1, Box2, 0, DimensionCount>
|
||
<a name="l00277"></a>00277 {};
|
||
<a name="l00278"></a>00278
|
||
<a name="l00279"></a>00279
|
||
<a name="l00280"></a>00280 <span class="keyword">template</span> <<span class="keyword">typename</span> Ring1, <span class="keyword">typename</span> Ring2>
|
||
<a name="l00281"></a>00281 <span class="keyword">struct </span><a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a><ring_tag, ring_tag, false, false, Ring1, Ring2, 2>
|
||
<a name="l00282"></a>00282 : detail::<a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a>::ring_ring<Ring1, Ring2>
|
||
<a name="l00283"></a>00283 {};
|
||
<a name="l00284"></a>00284
|
||
<a name="l00285"></a>00285 <span class="keyword">template</span> <<span class="keyword">typename</span> Polygon1, <span class="keyword">typename</span> Polygon2>
|
||
<a name="l00286"></a>00286 <span class="keyword">struct </span><a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a><polygon_tag, polygon_tag, false, false, Polygon1, Polygon2, 2>
|
||
<a name="l00287"></a>00287 : detail::<a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a>::polygon_polygon<Polygon1, Polygon2>
|
||
<a name="l00288"></a>00288 {};
|
||
<a name="l00289"></a>00289
|
||
<a name="l00290"></a>00290 } <span class="comment">// namespace dispatch</span>
|
||
<a name="l00291"></a>00291 <span class="preprocessor">#endif // DOXYGEN_NO_DISPATCH</span>
|
||
<a name="l00292"></a>00292 <span class="preprocessor"></span>
|
||
<a name="l00293"></a>00293
|
||
<a name="l00303"></a>00303 <span class="keyword">template</span> <<span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2>
|
||
<a name="l00304"></a><a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc">00304</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">equals</a>(Geometry1 <span class="keyword">const</span>& geometry1, Geometry2 <span class="keyword">const</span>& geometry2)
|
||
<a name="l00305"></a>00305 {
|
||
<a name="l00306"></a>00306 <a class="code" href="group__concepts.html#g31ca9fa53e22c078cd006a2ae52b345e" title="Checks, in compile-time, the concept of two geometries, and if they have equal dimensions...">concept::check_concepts_and_equal_dimensions</a>
|
||
<a name="l00307"></a>00307 <
|
||
<a name="l00308"></a>00308 <span class="keyword">const</span> Geometry1,
|
||
<a name="l00309"></a>00309 <span class="keyword">const</span> Geometry2
|
||
<a name="l00310"></a>00310 >();
|
||
<a name="l00311"></a>00311
|
||
<a name="l00312"></a>00312
|
||
<a name="l00313"></a>00313 <span class="keywordflow">return</span> <a class="code" href="group__equals.html#ge18e3cb2ad5b7fbc8f0ce9e0f92397bc" title="Detect if two geometries are spatially equal.">dispatch::equals</a>
|
||
<a name="l00314"></a>00314 <
|
||
<a name="l00315"></a>00315 <span class="keyword">typename</span> <a class="code" href="structboost_1_1geometry_1_1geometry__not__recognized__tag.html" title="&quot;default&quot; tag">tag<Geometry1>::type</a>,
|
||
<a name="l00316"></a>00316 <span class="keyword">typename</span> <a class="code" href="structboost_1_1geometry_1_1geometry__not__recognized__tag.html" title="&quot;default&quot; tag">tag<Geometry2>::type</a>,
|
||
<a name="l00317"></a>00317 <a class="code" href="structboost_1_1geometry_1_1is__multi.html" title="Meta-function defining &quot;true&quot; for multi geometries (multi_point, etc).">is_multi<Geometry1>::type::value</a>,
|
||
<a name="l00318"></a>00318 <a class="code" href="structboost_1_1geometry_1_1is__multi.html" title="Meta-function defining &quot;true&quot; for multi geometries (multi_point, etc).">is_multi<Geometry2>::type::value</a>,
|
||
<a name="l00319"></a>00319 Geometry1,
|
||
<a name="l00320"></a>00320 Geometry2,
|
||
<a name="l00321"></a>00321 <a class="code" href="structboost_1_1geometry_1_1dimension.html" title="Meta-function which defines coordinate dimensions, i.e. the number of axes of any...">dimension<Geometry1>::type::value</a>
|
||
<a name="l00322"></a>00322 >::apply(geometry1, geometry2);
|
||
<a name="l00323"></a>00323 }
|
||
<a name="l00324"></a>00324
|
||
<a name="l00325"></a>00325 }} <span class="comment">// namespace boost::geometry</span>
|
||
<a name="l00326"></a>00326
|
||
<a name="l00327"></a>00327 <span class="preprocessor">#endif // BOOST_GEOMETRY_ALGORITHMS_EQUALS_HPP</span>
|
||
<a name="l00328"></a>00328 <span class="preprocessor"></span>
|
||
</pre></div></div>
|
||
<hr size="1">
|
||
<table width="100%">
|
||
<tbody>
|
||
<tr>
|
||
<td align="left"><small>
|
||
<p>December 1, 2009</p>
|
||
</small></td>
|
||
<td align="right">
|
||
<small>Copyright <20> 1995-2009 Barend Gehrels, Geodan, Amsterdam<br>
|
||
Copyright <20> 2008-2009 Bruno Lalande, Paris<br>
|
||
Copyright <20> 2009 Mateusz Loskot, Cadcorp, London<br>
|
||
</small>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
|
||
<address style="text-align: right;"><small>
|
||
Documentation is generated by <a href="http://www.doxygen.org/index.html">Doxygen</a>
|
||
</small></address>
|
||
</body>
|
||
</html>
|