polygon_90_set_view.hpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490
  1. /*
  2. Copyright 2008 Intel Corporation
  3. Use, modification and distribution are subject to the Boost Software License,
  4. Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
  5. http://www.boost.org/LICENSE_1_0.txt).
  6. */
  7. #ifndef BOOST_POLYGON_POLYGON_90_SET_VIEW_HPP
  8. #define BOOST_POLYGON_POLYGON_90_SET_VIEW_HPP
  9. namespace boost { namespace polygon{
  10. struct operator_provides_storage {};
  11. struct operator_requires_copy {};
  12. template <typename value_type, typename arg_type>
  13. inline void insert_into_view_arg(value_type& dest, const arg_type& arg, orientation_2d orient);
  14. template <typename ltype, typename rtype, typename op_type>
  15. class polygon_90_set_view;
  16. template <typename ltype, typename rtype, typename op_type>
  17. struct polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> > {
  18. typedef typename polygon_90_set_view<ltype, rtype, op_type>::coordinate_type coordinate_type;
  19. typedef typename polygon_90_set_view<ltype, rtype, op_type>::iterator_type iterator_type;
  20. typedef typename polygon_90_set_view<ltype, rtype, op_type>::operator_arg_type operator_arg_type;
  21. static inline iterator_type begin(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set);
  22. static inline iterator_type end(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set);
  23. static inline orientation_2d orient(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set);
  24. static inline bool clean(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set);
  25. static inline bool sorted(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set);
  26. };
  27. template <typename value_type, typename ltype, typename rtype, typename op_type>
  28. struct compute_90_set_value {
  29. static
  30. void value(value_type& output_, const ltype& lvalue_, const rtype& rvalue_, orientation_2d orient_) {
  31. value_type linput_(orient_);
  32. value_type rinput_(orient_);
  33. orientation_2d orient_l = polygon_90_set_traits<ltype>::orient(lvalue_);
  34. orientation_2d orient_r = polygon_90_set_traits<rtype>::orient(rvalue_);
  35. //std::cout << "compute_90_set_value-0 orientations (left, right, out):\t" << orient_l.to_int()
  36. // << "," << orient_r.to_int() << "," << orient_.to_int() << std::endl;
  37. insert_into_view_arg(linput_, lvalue_, orient_l);
  38. insert_into_view_arg(rinput_, rvalue_, orient_r);
  39. output_.applyBooleanBinaryOp(linput_.begin(), linput_.end(),
  40. rinput_.begin(), rinput_.end(), boolean_op::BinaryCount<op_type>());
  41. }
  42. };
  43. template <typename value_type, typename lcoord, typename rcoord, typename op_type>
  44. struct compute_90_set_value<value_type, polygon_90_set_data<lcoord>, polygon_90_set_data<rcoord>, op_type> {
  45. static
  46. void value(value_type& output_, const polygon_90_set_data<lcoord>& lvalue_,
  47. const polygon_90_set_data<rcoord>& rvalue_, orientation_2d orient_) {
  48. orientation_2d orient_l = lvalue_.orient();
  49. orientation_2d orient_r = rvalue_.orient();
  50. value_type linput_(orient_);
  51. value_type rinput_(orient_);
  52. //std::cout << "compute_90_set_value-1 orientations (left, right, out):\t" << orient_l.to_int()
  53. // << "," << orient_r.to_int() << "," << orient_.to_int() << std::endl;
  54. if((orient_ == orient_l) && (orient_== orient_r)){ // assume that most of the time this condition is met
  55. lvalue_.sort();
  56. rvalue_.sort();
  57. output_.applyBooleanBinaryOp(lvalue_.begin(), lvalue_.end(),
  58. rvalue_.begin(), rvalue_.end(), boolean_op::BinaryCount<op_type>());
  59. }else if((orient_ != orient_l) && (orient_!= orient_r)){ // both the orientations are not equal to input
  60. // easier way is to ignore the input orientation and use the input data's orientation, but not done so
  61. insert_into_view_arg(linput_, lvalue_, orient_l);
  62. insert_into_view_arg(rinput_, rvalue_, orient_r);
  63. output_.applyBooleanBinaryOp(linput_.begin(), linput_.end(),
  64. rinput_.begin(), rinput_.end(), boolean_op::BinaryCount<op_type>());
  65. }else if(orient_ != orient_l){ // left hand side orientation is different
  66. insert_into_view_arg(linput_, lvalue_, orient_l);
  67. rvalue_.sort();
  68. output_.applyBooleanBinaryOp(linput_.begin(), linput_.end(),
  69. rvalue_.begin(), rvalue_.end(), boolean_op::BinaryCount<op_type>());
  70. } else if(orient_ != orient_r){ // right hand side orientation is different
  71. insert_into_view_arg(rinput_, rvalue_, orient_r);
  72. lvalue_.sort();
  73. output_.applyBooleanBinaryOp(lvalue_.begin(), lvalue_.end(),
  74. rinput_.begin(), rinput_.end(), boolean_op::BinaryCount<op_type>());
  75. }
  76. }
  77. };
  78. template <typename value_type, typename lcoord, typename rtype, typename op_type>
  79. struct compute_90_set_value<value_type, polygon_90_set_data<lcoord>, rtype, op_type> {
  80. static
  81. void value(value_type& output_, const polygon_90_set_data<lcoord>& lvalue_,
  82. const rtype& rvalue_, orientation_2d orient_) {
  83. value_type rinput_(orient_);
  84. lvalue_.sort();
  85. orientation_2d orient_r = polygon_90_set_traits<rtype>::orient(rvalue_);
  86. //std::cout << "compute_90_set_value-2 orientations (right, out):\t" << orient_r.to_int()
  87. // << "," << orient_.to_int() << std::endl;
  88. insert_into_view_arg(rinput_, rvalue_, orient_r);
  89. output_.applyBooleanBinaryOp(lvalue_.begin(), lvalue_.end(),
  90. rinput_.begin(), rinput_.end(), boolean_op::BinaryCount<op_type>());
  91. }
  92. };
  93. template <typename value_type, typename ltype, typename rcoord, typename op_type>
  94. struct compute_90_set_value<value_type, ltype, polygon_90_set_data<rcoord>, op_type> {
  95. static
  96. void value(value_type& output_, const ltype& lvalue_,
  97. const polygon_90_set_data<rcoord>& rvalue_, orientation_2d orient_) {
  98. value_type linput_(orient_);
  99. orientation_2d orient_l = polygon_90_set_traits<ltype>::orient(lvalue_);
  100. insert_into_view_arg(linput_, lvalue_, orient_l);
  101. rvalue_.sort();
  102. //std::cout << "compute_90_set_value-3 orientations (left, out):\t" << orient_l.to_int()
  103. // << "," << orient_.to_int() << std::endl;
  104. output_.applyBooleanBinaryOp(linput_.begin(), linput_.end(),
  105. rvalue_.begin(), rvalue_.end(), boolean_op::BinaryCount<op_type>());
  106. }
  107. };
  108. template <typename ltype, typename rtype, typename op_type>
  109. class polygon_90_set_view {
  110. public:
  111. typedef typename polygon_90_set_traits<ltype>::coordinate_type coordinate_type;
  112. typedef polygon_90_set_data<coordinate_type> value_type;
  113. typedef typename value_type::iterator_type iterator_type;
  114. typedef polygon_90_set_view operator_arg_type;
  115. private:
  116. const ltype& lvalue_;
  117. const rtype& rvalue_;
  118. orientation_2d orient_;
  119. op_type op_;
  120. mutable value_type output_;
  121. mutable bool evaluated_;
  122. polygon_90_set_view& operator=(const polygon_90_set_view&);
  123. public:
  124. polygon_90_set_view(const ltype& lvalue,
  125. const rtype& rvalue,
  126. orientation_2d orient,
  127. op_type op) :
  128. lvalue_(lvalue), rvalue_(rvalue), orient_(orient), op_(op), output_(orient), evaluated_(false) {}
  129. // get iterator to begin vertex data
  130. private:
  131. const value_type& value() const {
  132. if(!evaluated_) {
  133. evaluated_ = true;
  134. compute_90_set_value<value_type, ltype, rtype, op_type>::value(output_, lvalue_, rvalue_, orient_);
  135. }
  136. return output_;
  137. }
  138. public:
  139. iterator_type begin() const { return value().begin(); }
  140. iterator_type end() const { return value().end(); }
  141. orientation_2d orient() const { return orient_; }
  142. bool dirty() const { return false; } //result of a boolean is clean
  143. bool sorted() const { return true; } //result of a boolean is sorted
  144. // template <typename input_iterator_type>
  145. // void set(input_iterator_type input_begin, input_iterator_type input_end,
  146. // orientation_2d orient) const {
  147. // orient_ = orient;
  148. // output_.clear();
  149. // output_.insert(output_.end(), input_begin, input_end);
  150. // polygon_sort(output_.begin(), output_.end());
  151. // }
  152. void sort() const {} //is always sorted
  153. };
  154. template <typename ltype, typename rtype, typename op_type>
  155. struct geometry_concept<polygon_90_set_view<ltype, rtype, op_type> > {
  156. typedef polygon_90_set_concept type;
  157. };
  158. template <typename ltype, typename rtype, typename op_type>
  159. typename polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::iterator_type
  160. polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::
  161. begin(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set) {
  162. return polygon_set.begin();
  163. }
  164. template <typename ltype, typename rtype, typename op_type>
  165. typename polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::iterator_type
  166. polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::
  167. end(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set) {
  168. return polygon_set.end();
  169. }
  170. // template <typename ltype, typename rtype, typename op_type>
  171. // template <typename input_iterator_type>
  172. // void polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::
  173. // set(polygon_90_set_view<ltype, rtype, op_type>& polygon_set,
  174. // input_iterator_type input_begin, input_iterator_type input_end,
  175. // orientation_2d orient) {
  176. // polygon_set.set(input_begin, input_end, orient);
  177. // }
  178. template <typename ltype, typename rtype, typename op_type>
  179. orientation_2d polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::
  180. orient(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set) {
  181. return polygon_set.orient(); }
  182. template <typename ltype, typename rtype, typename op_type>
  183. bool polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::
  184. clean(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set) {
  185. return !polygon_set.dirty(); }
  186. template <typename ltype, typename rtype, typename op_type>
  187. bool polygon_90_set_traits<polygon_90_set_view<ltype, rtype, op_type> >::
  188. sorted(const polygon_90_set_view<ltype, rtype, op_type>& polygon_set) {
  189. return polygon_set.sorted(); }
  190. template <typename value_type, typename arg_type>
  191. inline void insert_into_view_arg(value_type& dest, const arg_type& arg, orientation_2d orient) {
  192. typedef typename polygon_90_set_traits<arg_type>::iterator_type literator;
  193. literator itr1, itr2;
  194. itr1 = polygon_90_set_traits<arg_type>::begin(arg);
  195. itr2 = polygon_90_set_traits<arg_type>::end(arg);
  196. dest.insert(itr1, itr2, orient);
  197. dest.sort();
  198. }
  199. template <typename T>
  200. template <typename ltype, typename rtype, typename op_type>
  201. inline polygon_90_set_data<T>& polygon_90_set_data<T>::operator=(const polygon_90_set_view<ltype, rtype, op_type>& that) {
  202. set(that.begin(), that.end(), that.orient());
  203. dirty_ = false;
  204. unsorted_ = false;
  205. return *this;
  206. }
  207. template <typename T>
  208. template <typename ltype, typename rtype, typename op_type>
  209. inline polygon_90_set_data<T>::polygon_90_set_data(const polygon_90_set_view<ltype, rtype, op_type>& that) :
  210. orient_(that.orient()), data_(that.begin(), that.end()), dirty_(false), unsorted_(false) {}
  211. template <typename geometry_type_1, typename geometry_type_2>
  212. struct self_assign_operator_lvalue {
  213. typedef geometry_type_1& type;
  214. };
  215. template <typename type_1, typename type_2>
  216. struct by_value_binary_operator {
  217. typedef type_1 type;
  218. };
  219. template <typename geometry_type_1, typename geometry_type_2, typename op_type>
  220. geometry_type_1& self_assignment_boolean_op(geometry_type_1& lvalue_, const geometry_type_2& rvalue_) {
  221. typedef geometry_type_1 ltype;
  222. typedef geometry_type_2 rtype;
  223. typedef typename polygon_90_set_traits<ltype>::coordinate_type coordinate_type;
  224. typedef polygon_90_set_data<coordinate_type> value_type;
  225. orientation_2d orient_ = polygon_90_set_traits<ltype>::orient(lvalue_);
  226. //BM: rvalue_ data set may have its own orientation for scanline
  227. orientation_2d orient_r = polygon_90_set_traits<rtype>::orient(rvalue_);
  228. //std::cout << "self-assignment boolean-op (left, right, out):\t" << orient_.to_int()
  229. // << "," << orient_r.to_int() << "," << orient_.to_int() << std::endl;
  230. value_type linput_(orient_);
  231. // BM: the rinput_ set's (that stores the rvalue_ dataset polygons) scanline orientation is *forced*
  232. // to be same as linput
  233. value_type rinput_(orient_);
  234. //BM: The output dataset's scanline orient is set as equal to first input dataset's (lvalue_) orientation
  235. value_type output_(orient_);
  236. insert_into_view_arg(linput_, lvalue_, orient_);
  237. // BM: The last argument orient_r is the user initialized scanline orientation for rvalue_ data set.
  238. // But since rinput (see above) is initialized to scanline orientation consistent with the lvalue_
  239. // data set, this insertion operation will change the incoming rvalue_ dataset's scanline orientation
  240. insert_into_view_arg(rinput_, rvalue_, orient_r);
  241. // BM: boolean operation and output uses lvalue_ dataset's scanline orientation.
  242. output_.applyBooleanBinaryOp(linput_.begin(), linput_.end(),
  243. rinput_.begin(), rinput_.end(), boolean_op::BinaryCount<op_type>());
  244. polygon_90_set_mutable_traits<geometry_type_1>::set(lvalue_, output_.begin(), output_.end(), orient_);
  245. return lvalue_;
  246. }
  247. namespace operators {
  248. struct y_ps90_b : gtl_yes {};
  249. template <typename geometry_type_1, typename geometry_type_2>
  250. typename enable_if< typename gtl_and_3< y_ps90_b,
  251. typename is_polygon_90_set_type<geometry_type_1>::type,
  252. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  253. polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryOr> >::type
  254. operator|(const geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  255. return polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryOr>
  256. (lvalue, rvalue,
  257. polygon_90_set_traits<geometry_type_1>::orient(lvalue),
  258. boolean_op::BinaryOr());
  259. }
  260. struct y_ps90_p : gtl_yes {};
  261. template <typename geometry_type_1, typename geometry_type_2>
  262. typename enable_if<
  263. typename gtl_and_3< y_ps90_p,
  264. typename gtl_if<typename is_polygon_90_set_type<geometry_type_1>::type>::type,
  265. typename gtl_if<typename is_polygon_90_set_type<geometry_type_2>::type>::type>::type,
  266. polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryOr> >::type
  267. operator+(const geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  268. return polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryOr>
  269. (lvalue, rvalue,
  270. polygon_90_set_traits<geometry_type_1>::orient(lvalue),
  271. boolean_op::BinaryOr());
  272. }
  273. struct y_ps90_s : gtl_yes {};
  274. template <typename geometry_type_1, typename geometry_type_2>
  275. typename enable_if< typename gtl_and_3< y_ps90_s,
  276. typename is_polygon_90_set_type<geometry_type_1>::type,
  277. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  278. polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryAnd> >::type
  279. operator*(const geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  280. return polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryAnd>
  281. (lvalue, rvalue,
  282. polygon_90_set_traits<geometry_type_1>::orient(lvalue),
  283. boolean_op::BinaryAnd());
  284. }
  285. struct y_ps90_a : gtl_yes {};
  286. template <typename geometry_type_1, typename geometry_type_2>
  287. typename enable_if< typename gtl_and_3< y_ps90_a,
  288. typename is_polygon_90_set_type<geometry_type_1>::type,
  289. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  290. polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryAnd> >::type
  291. operator&(const geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  292. return polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryAnd>
  293. (lvalue, rvalue,
  294. polygon_90_set_traits<geometry_type_1>::orient(lvalue),
  295. boolean_op::BinaryAnd());
  296. }
  297. struct y_ps90_x : gtl_yes {};
  298. template <typename geometry_type_1, typename geometry_type_2>
  299. typename enable_if< typename gtl_and_3< y_ps90_x,
  300. typename is_polygon_90_set_type<geometry_type_1>::type,
  301. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  302. polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryXor> >::type
  303. operator^(const geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  304. return polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryXor>
  305. (lvalue, rvalue,
  306. polygon_90_set_traits<geometry_type_1>::orient(lvalue),
  307. boolean_op::BinaryXor());
  308. }
  309. struct y_ps90_m : gtl_yes {};
  310. template <typename geometry_type_1, typename geometry_type_2>
  311. typename enable_if< typename gtl_and_3< y_ps90_m,
  312. typename gtl_if<typename is_polygon_90_set_type<geometry_type_1>::type>::type,
  313. typename gtl_if<typename is_polygon_90_set_type<geometry_type_2>::type>::type>::type,
  314. polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryNot> >::type
  315. operator-(const geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  316. return polygon_90_set_view<geometry_type_1, geometry_type_2, boolean_op::BinaryNot>
  317. (lvalue, rvalue,
  318. polygon_90_set_traits<geometry_type_1>::orient(lvalue),
  319. boolean_op::BinaryNot());
  320. }
  321. struct y_ps90_pe : gtl_yes {};
  322. template <typename coordinate_type_1, typename geometry_type_2>
  323. typename enable_if< typename gtl_and< y_ps90_pe, typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  324. polygon_90_set_data<coordinate_type_1> >::type &
  325. operator+=(polygon_90_set_data<coordinate_type_1>& lvalue, const geometry_type_2& rvalue) {
  326. lvalue.insert(polygon_90_set_traits<geometry_type_2>::begin(rvalue), polygon_90_set_traits<geometry_type_2>::end(rvalue),
  327. polygon_90_set_traits<geometry_type_2>::orient(rvalue));
  328. return lvalue;
  329. }
  330. struct y_ps90_be : gtl_yes {};
  331. //
  332. template <typename coordinate_type_1, typename geometry_type_2>
  333. typename enable_if< typename gtl_and< y_ps90_be, typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  334. polygon_90_set_data<coordinate_type_1> >::type &
  335. operator|=(polygon_90_set_data<coordinate_type_1>& lvalue, const geometry_type_2& rvalue) {
  336. return lvalue += rvalue;
  337. }
  338. struct y_ps90_pe2 : gtl_yes {};
  339. //normal self assignment boolean operations
  340. template <typename geometry_type_1, typename geometry_type_2>
  341. typename enable_if< typename gtl_and_3< y_ps90_pe2, typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  342. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  343. geometry_type_1>::type &
  344. operator+=(geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  345. return self_assignment_boolean_op<geometry_type_1, geometry_type_2, boolean_op::BinaryOr>(lvalue, rvalue);
  346. }
  347. struct y_ps90_be2 : gtl_yes {};
  348. template <typename geometry_type_1, typename geometry_type_2>
  349. typename enable_if< typename gtl_and_3<y_ps90_be2, typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  350. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  351. geometry_type_1>::type &
  352. operator|=(geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  353. return self_assignment_boolean_op<geometry_type_1, geometry_type_2, boolean_op::BinaryOr>(lvalue, rvalue);
  354. }
  355. struct y_ps90_se : gtl_yes {};
  356. template <typename geometry_type_1, typename geometry_type_2>
  357. typename enable_if< typename gtl_and_3<y_ps90_se, typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  358. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  359. geometry_type_1>::type &
  360. operator*=(geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  361. return self_assignment_boolean_op<geometry_type_1, geometry_type_2, boolean_op::BinaryAnd>(lvalue, rvalue);
  362. }
  363. struct y_ps90_ae : gtl_yes {};
  364. template <typename geometry_type_1, typename geometry_type_2>
  365. typename enable_if< typename gtl_and_3<y_ps90_ae, typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  366. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  367. geometry_type_1>::type &
  368. operator&=(geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  369. return self_assignment_boolean_op<geometry_type_1, geometry_type_2, boolean_op::BinaryAnd>(lvalue, rvalue);
  370. }
  371. struct y_ps90_xe : gtl_yes {};
  372. template <typename geometry_type_1, typename geometry_type_2>
  373. typename enable_if< typename gtl_and_3<y_ps90_xe, typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  374. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  375. geometry_type_1>::type &
  376. operator^=(geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  377. return self_assignment_boolean_op<geometry_type_1, geometry_type_2, boolean_op::BinaryXor>(lvalue, rvalue);
  378. }
  379. struct y_ps90_me : gtl_yes {};
  380. template <typename geometry_type_1, typename geometry_type_2>
  381. typename enable_if< typename gtl_and_3< y_ps90_me, typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  382. typename is_polygon_90_set_type<geometry_type_2>::type>::type,
  383. geometry_type_1>::type &
  384. operator-=(geometry_type_1& lvalue, const geometry_type_2& rvalue) {
  385. return self_assignment_boolean_op<geometry_type_1, geometry_type_2, boolean_op::BinaryNot>(lvalue, rvalue);
  386. }
  387. struct y_ps90_rpe : gtl_yes {};
  388. template <typename geometry_type_1, typename coordinate_type_1>
  389. typename enable_if< typename gtl_and_3<y_ps90_rpe,
  390. typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  391. typename gtl_same_type<typename geometry_concept<coordinate_type_1>::type, coordinate_concept>::type>::type,
  392. geometry_type_1>::type &
  393. operator+=(geometry_type_1& lvalue, coordinate_type_1 rvalue) {
  394. return resize(lvalue, rvalue);
  395. }
  396. struct y_ps90_rme : gtl_yes {};
  397. template <typename geometry_type_1, typename coordinate_type_1>
  398. typename enable_if< typename gtl_and_3<y_ps90_rme,
  399. typename is_mutable_polygon_90_set_type<geometry_type_1>::type,
  400. typename gtl_same_type<typename geometry_concept<coordinate_type_1>::type, coordinate_concept>::type>::type,
  401. geometry_type_1>::type &
  402. operator-=(geometry_type_1& lvalue, coordinate_type_1 rvalue) {
  403. return resize(lvalue, -rvalue);
  404. }
  405. struct y_ps90_rp : gtl_yes {};
  406. template <typename geometry_type_1, typename coordinate_type_1>
  407. typename enable_if< typename gtl_and_3<y_ps90_rp,
  408. typename gtl_if<typename is_mutable_polygon_90_set_type<geometry_type_1>::type>::type,
  409. typename gtl_if<typename gtl_same_type<typename geometry_concept<coordinate_type_1>::type, coordinate_concept>::type>::type>::type,
  410. geometry_type_1>::type
  411. operator+(const geometry_type_1& lvalue, coordinate_type_1 rvalue) {
  412. geometry_type_1 retval(lvalue);
  413. retval += rvalue;
  414. return retval;
  415. }
  416. struct y_ps90_rm : gtl_yes {};
  417. template <typename geometry_type_1, typename coordinate_type_1>
  418. typename enable_if< typename gtl_and_3<y_ps90_rm,
  419. typename gtl_if<typename is_mutable_polygon_90_set_type<geometry_type_1>::type>::type,
  420. typename gtl_if<typename gtl_same_type<typename geometry_concept<coordinate_type_1>::type, coordinate_concept>::type>::type>::type,
  421. geometry_type_1>::type
  422. operator-(const geometry_type_1& lvalue, coordinate_type_1 rvalue) {
  423. geometry_type_1 retval(lvalue);
  424. retval -= rvalue;
  425. return retval;
  426. }
  427. }
  428. }
  429. }
  430. #endif