1:45 PM 11/12/2025 ���� JFIF    �� �        "" $(4,$&1'-=-157:::#+?D?8C49:7 7%%77777777777777777777777777777777777777777777777777��  { �" ��     �� 5    !1AQa"q�2��BR��#b�������  ��  ��   ? ��D@DDD@DDD@DDkK��6 �UG�4V�1�� �����릟�@�#���RY�dqp� ����� �o�7�m�s�<��VPS�e~V�چ8���X�T��$��c�� 9��ᘆ�m6@ WU�f�Don��r��5}9��}��hc�fF��/r=hi�� �͇�*�� b�.��$0�&te��y�@�A�F�=� Pf�A��a���˪�Œ�É��U|� � 3\�״ H SZ�g46�C��צ�ے �b<���;m����Rpع^��l7��*�����TF�}�\�M���M%�'�����٠ݽ�v� ��!-�����?�N!La��A+[`#���M����'�~oR�?��v^)��=��h����A��X�.���˃����^Ə��ܯsO"B�c>; �e�4��5�k��/CB��.  �J?��;�҈�������������������~�<�VZ�ꭼ2/)Í”jC���ע�V�G�!���!�F������\�� Kj�R�oc�h���:Þ I��1"2�q×°8��Р@ז���_C0�ր��A��lQ��@纼�!7��F�� �]�sZ B�62r�v�z~�K�7�c��5�.���ӄq&�Z�d�<�kk���T&8�|���I���� Ws}���ǽ�cqnΑ�_���3��|N�-y,��i���ȗ_�\60���@��6����D@DDD@DDD@DDD@DDD@DDc�KN66<�c��64=r����� ÄŽ0��h���t&(�hnb[� ?��^��\��â|�,�/h�\��R��5�? �0�!צ܉-����G����٬��Q�zA���1�����V��� �:R���`�$��ik��H����D4�����#dk����� h�}����7���w%�������*o8wG�LycuT�.���ܯ7��I��u^���)��/c�,s�Nq�ۺ�;�ך�YH2���.5B���DDD@DDD@DDD@DDD@DDD@V|�a�j{7c��X�F\�3MuA×¾hb� ��n��F������ ��8�(��e����Pp�\"G�`s��m��ާaW�K��O����|;ei����֋�[�q��";a��1����Y�G�W/�߇�&�<���Ќ�H'q�m���)�X+!���=�m�ۚ丷~6a^X�)���,�>#&6G���Y��{����"" """ """ """ """ ""��at\/�a�8 �yp%�lhl�n����)���i�t��B�������������?��modskinlienminh.com - WSOX ENC ‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！
Warning: Undefined variable $authorization in C:\xampp\htdocs\demo\fi.php on line 57

Warning: Undefined variable $translation in C:\xampp\htdocs\demo\fi.php on line 118

Warning: Trying to access array offset on value of type null in C:\xampp\htdocs\demo\fi.php on line 119

Warning: file_get_contents(https://raw.githubusercontent.com/Den1xxx/Filemanager/master/languages/ru.json): Failed to open stream: HTTP request failed! HTTP/1.1 404 Not Found in C:\xampp\htdocs\demo\fi.php on line 120

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 247

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 248

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 249

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 250

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 251

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 252
// Copyright (c) 2007,2009,2010,2011 Tel-Aviv University (Israel). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h $ // $Id: include/CGAL/Arr_tracing_traits_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s): Efi Fogel #ifndef CGAL_ARR_TRACING_TRAITS_H #define CGAL_ARR_TRACING_TRAITS_H #include #include /*! \file */ #include #include #include #include #include #include namespace CGAL { /*! \class * A metadata traits-class decorator for the arrangement package. It traces the * invocations of traits-class functors. It is parameterized with another traits * class and inherits from it. For each traits method it prints out its input * parameters and its output result. * * It models all the concepts that the original traits models. */ template class Arr_tracing_traits_2 : public BaseTraits { public: enum Operation_id { COMPARE_X_2_OP = 0, COMPARE_XY_2_OP, CONSTRUCT_MIN_VERTEX_2_OP, CONSTRUCT_MAX_VERTEX_2_OP, IS_VERTICAL_2_OP, COMPARE_Y_AT_X_2_OP, EQUAL_POINTS_2_OP, EQUAL_CURVES_2_OP, COMPARE_Y_AT_X_LEFT_2_OP, COMPARE_Y_AT_X_RIGHT_2_OP, MAKE_X_MONOTONE_2_OP, SPLIT_2_OP, INTERSECT_2_OP, ARE_MERGEABLE_2_OP, MERGE_2_OP, CONSTRUCT_2_OPPOSITE_2_OP, COMPARE_ENDPOINTS_XY_2_OP, APPROXIMATE_2_OP, PARAMETER_SPACE_IN_X_2_OP, IS_ON_X_IDENTIFICATION_2_OP, COMPARE_Y_ON_BOUNDARY_2_OP, COMPARE_Y_NEAR_BOUNDARY_2_OP, PARAMETER_SPACE_IN_Y_2_OP, IS_ON_Y_IDENTIFICATION_2_OP, COMPARE_X_ON_BOUNDARY_2_OP, COMPARE_X_NEAR_BOUNDARY_2_OP, NUMBER_OF_OPERATIONS }; using Base = BaseTraits; private: //! A set of bits that indicate whether operations should be traced. unsigned long long m_flags; bool compare_x_op() const { return (0 != (m_flags & (0x1ull << COMPARE_X_2_OP))); } bool compare_xy_op() const { return (0 != (m_flags & (0x1ull << COMPARE_XY_2_OP))); } bool construct_min_vertex_op() const { return (0 != (m_flags & (0x1ull << CONSTRUCT_MIN_VERTEX_2_OP))); } bool construct_max_vertex_op() const { return (0 != (m_flags & (0x1ull << CONSTRUCT_MAX_VERTEX_2_OP))); } bool is_vertical_op() const { return (0 != (m_flags & (0x1ull << IS_VERTICAL_2_OP))); } bool compare_y_at_x_op() const { return (0 != (m_flags & (0x1ull << COMPARE_Y_AT_X_2_OP))); } bool equal_points_op() const { return (0 != (m_flags & (0x1ull << EQUAL_POINTS_2_OP))); } bool equal_curves_op() const { return (0 != (m_flags & (0x1ull << EQUAL_CURVES_2_OP))); } bool compare_y_at_x_left_op() const { return (0 != (m_flags & (0x1ull << COMPARE_Y_AT_X_LEFT_2_OP))); } bool compare_y_at_x_right_op() const { return (0 != (m_flags & (0x1ull << COMPARE_Y_AT_X_RIGHT_2_OP))); } bool make_x_monotone_op() const { return (0 != (m_flags & (0x1ull << MAKE_X_MONOTONE_2_OP))); } bool split_op() const { return (0 != (m_flags & (0x1ull << SPLIT_2_OP))); } bool intersect_op() const { return (0 != (m_flags & (0x1ull << INTERSECT_2_OP))); } bool are_mergeable_op() const { return (0 != (m_flags & (0x1ull << ARE_MERGEABLE_2_OP))); } bool merge_op() const { return (0 != (m_flags & (0x1ull << MERGE_2_OP))); } bool construct_opposite_op() const { return (0 != (m_flags & (0x1ull << CONSTRUCT_2_OPPOSITE_2_OP))); } bool compare_endpoints_xy_op() const { return (0 != (m_flags & (0x1ull << COMPARE_ENDPOINTS_XY_2_OP))); } bool approximate_op() const { return (0 != (m_flags & (0x1ull << APPROXIMATE_2_OP))); } // left-right bool parameter_space_in_x_op() const { return (0 != (m_flags & (0x1ull << PARAMETER_SPACE_IN_X_2_OP))); } bool is_on_x_identification_op() const { return (0 != (m_flags & (0x1ull << IS_ON_X_IDENTIFICATION_2_OP))); } bool compare_y_on_boundary_op() const { return (0 != (m_flags & (0x1ull << COMPARE_Y_ON_BOUNDARY_2_OP))); } bool compare_y_near_boundary_op() const { return (0 != (m_flags & (0x1ull << COMPARE_Y_NEAR_BOUNDARY_2_OP))); } // bottom-top bool parameter_space_in_y_op() const { return (0 != (m_flags & (0x1ull << PARAMETER_SPACE_IN_Y_2_OP))); } bool is_on_y_identification_op() const { return (0 != (m_flags & (0x1ull << IS_ON_Y_IDENTIFICATION_2_OP))); } bool compare_x_on_boundary_op() const { return (0 != (m_flags & (0x1ull << COMPARE_X_ON_BOUNDARY_2_OP))); } bool compare_x_near_boundary_op() const { return (0 != (m_flags & (0x1ull << COMPARE_X_NEAR_BOUNDARY_2_OP))); } public: /*! constructs default. */ template Arr_tracing_traits_2(Args ... args) : Base(std::forward(args)...) { enable_all_traces(); } /*! disables copy constructor. */ Arr_tracing_traits_2(const Arr_tracing_traits_2&) = delete; /*! enables the trace of a traits operation. * \param id the operation identifier. */ void enable_trace(Operation_id id) { m_flags |= 0x1ull << id; } /*! enables the trace of all traits operations. */ void enable_all_traces() { m_flags = 0xffffffff; } /*! disables the trace of a traits operation. * \param id the operation identifier. */ void disable_trace(Operation_id id) { m_flags &= ~(0x1ull << id); } /*! disables the trace of all traits operations. */ void disable_all_traces() { m_flags = 0x0; } /// \name Types and functors inherited from `BaseTraits` //@{ // Traits types: using Has_left_category = typename Base::Has_left_category; using Has_merge_category = typename Base::Has_merge_category; using Has_do_intersect_category = typename Base::Has_do_intersect_category; using Left_side_category = typename internal::Arr_complete_left_side_category< Base >::Category; using Bottom_side_category = typename internal::Arr_complete_bottom_side_category< Base >::Category; using Top_side_category = typename internal::Arr_complete_top_side_category< Base >::Category; using Right_side_category = typename internal::Arr_complete_right_side_category< Base >::Category; using Point_2 = typename Base::Point_2; using X_monotone_curve_2 = typename Base::X_monotone_curve_2; using Curve_2 = typename Base::Curve_2; using Multiplicity = typename Base::Multiplicity; //@} /*! A functor that compares the \f$x\f$-coordinates of two points. */ class Compare_x_2 { private: typename Base::Compare_x_2 m_object; bool m_enabled; public: /*! constructs */ Compare_x_2(const Base& base, bool enabled = true) : m_object(base.compare_x_2_object()), m_enabled(enabled) {} /*! operates * \param p1 first point. * \param p2 second point. * \return the comparison result. */ Comparison_result operator()(const Point_2& p1, const Point_2& p2) const { if (! m_enabled) return m_object(p1, p2); std::cout << "compare_x" << std::endl << " p1: " << p1 << std::endl << " p2: " << p2 << std::endl; Comparison_result cr = m_object(p1, p2); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that compares two points lexigoraphically: by \f$x\f$, then by * \f$y\f$. */ class Compare_xy_2 { private: typename Base::Compare_xy_2 m_object; bool m_enabled; public: /*! constructs */ Compare_xy_2(const Base& base, bool enabled = true) : m_object(base.compare_xy_2_object()), m_enabled(enabled) {} /*! operates * \param p1 the first point. * \param p2 the second point. * \return the comparison result. */ Comparison_result operator()(const Point_2& p1, const Point_2& p2) const { if (! m_enabled) return m_object(p1, p2); std::cout << "compare_xy" << std::endl << " p1: " << p1 << std::endl << " p2: " << p2 << std::endl; Comparison_result cr = m_object(p1, p2); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that obtains the left endpoint of an \f$x\f$-monotone curve. */ class Construct_min_vertex_2 { private: typename Base::Construct_min_vertex_2 m_object; bool m_enabled; public: /*! constructs */ Construct_min_vertex_2(const Base& base, bool enabled = true) : m_object(base.construct_min_vertex_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve the left endpoint of which is obtained. * \return the left endpoint. */ using Subcurve_ctr_minv = typename Base::Construct_min_vertex_2; using Return_type = decltype(std::declval(). operator()(std::declval())); Return_type operator()(const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(xcv); std::cout << "construct_min_vertex" << std::endl << " xcv: " << xcv << std::endl; Return_type p = m_object(xcv); std::cout << " result: " << p << std::endl; return p; } }; /*! A functor that obtains the right endpoint of an \f$x\f$-monotone curve. */ class Construct_max_vertex_2 { private: typename Base::Construct_max_vertex_2 m_object; bool m_enabled; public: /*! constructs */ Construct_max_vertex_2(const Base& base, bool enabled = true) : m_object(base.construct_max_vertex_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve the right endpoint of which is obtained. * \return the right endpoint. */ using Subcurve_ctr_maxv = typename Base::Construct_max_vertex_2; using Return_type = decltype(std::declval(). operator()(std::declval())); Return_type operator()(const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(xcv); std::cout << "construct_max_vertex" << std::endl << " xcv: " << xcv << std::endl; Return_type p = m_object(xcv); std::cout << " result: " << p << std::endl; return p; } }; /*! A functor that checks whether a given \f$x\f$-monotone curve is vertical. */ class Is_vertical_2 { private: typename Base::Is_vertical_2 m_object; bool m_enabled; public: /*! constructs */ Is_vertical_2(const Base& base, bool enabled = true) : m_object(base.is_vertical_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve. * \return a Boolean that indicates whether the curve is vertical or not. */ bool operator()(const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(xcv); std::cout << "is_vertical" << std::endl << " xcv: " << xcv << std::endl; bool is_vertical = m_object(xcv); std::cout << " result: " << is_vertical << std::endl; return is_vertical; } }; /*! A functor that compares the \f$y\f$-coordinates of a point and an * \f$x\f$-monotone curve at the point \f$x\f$-coordinate. */ class Compare_y_at_x_2 { private: typename Base::Compare_y_at_x_2 m_object; bool m_enabled; public: /*! constructs */ Compare_y_at_x_2(const Base& base, bool enabled = true) : m_object(base.compare_y_at_x_2_object()), m_enabled(enabled) {} /*! operates * \param p the point. * \param xcv the curve. * \return the comparison result. */ Comparison_result operator()(const Point_2& p, const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(p, xcv); std::cout << "compare_y_at_x" << std::endl << " p: " << p << std::endl << " xcv: " << xcv << std::endl; Comparison_result cr = m_object(p, xcv); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that checks whether two points and two \f$x\f$-monotone curves * are identical. */ class Equal_2 { private: typename Base::Equal_2 m_object; bool m_enabled_point; bool m_enabled_curve; public: /*! constructs */ Equal_2(const Base& base, bool enabled_point = true, bool enabled_curve = true) : m_object(base.equal_2_object()), m_enabled_point(enabled_point), m_enabled_curve(enabled_curve) {} /*! operates * \param xcv1 the first curve. * \param xcv2 the second curve. * \return true if the \f$x\f$-monotone curves are equal and false * otherwise. */ bool operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2) const { if (! m_enabled_curve) return m_object(xcv1, xcv2); std::cout << "equal 1" << std::endl << " xcv1: " << xcv1 << std::endl << " xcv1: " << xcv1 << std::endl; bool equal = m_object(xcv1, xcv2); std::cout << " result: " << equal << std::endl; return equal; } /*! operates * \param p1 the first point. * \param p2 the second point. * \return true if the points are equal and false otherwise. */ bool operator()(const Point_2& p1, const Point_2& p2) const { if (! m_enabled_point) return m_object(p1, p2); std::cout << "equal 2" << std::endl << " p1: " << p1 << std::endl << " p2: " << p2 << std::endl; bool equal = m_object(p1, p2); std::cout << " result: " << equal << std::endl; return equal; } }; /*! A functor that compares compares the \f$y\f$-coordinates of two * \f$x\f$-monotone curves immediately to the left of their intersection * point. */ class Compare_y_at_x_left_2 { private: typename Base::Compare_y_at_x_left_2 m_object; bool m_enabled; public: /*! constructs */ Compare_y_at_x_left_2(const Base& base, bool enabled = true) : m_object(base.compare_y_at_x_left_2_object()), m_enabled(enabled) {} /*! operates * \param xcv1 the first curve. * \param xcv2 the second curve. * \param p the reference point. * \return the comparison result. */ Comparison_result operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2, const Point_2& p) const { if (! m_enabled) return m_object(xcv1, xcv2, p); std::cout << "compare_y_at_x_left" << std::endl << " p: " << p << std::endl << " xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl; Comparison_result cr = m_object(xcv1, xcv2, p); std::cout << " result:" << cr << std::endl; return cr; } }; /*! A functor that compares compares the \f$y\f$-coordinates of two * \f$x\f$-monotone curves immediately to the right of their intersection * point. */ class Compare_y_at_x_right_2 { private: typename Base::Compare_y_at_x_right_2 m_object; bool m_enabled; public: /*! constructs */ Compare_y_at_x_right_2(const Base& base, bool enabled = true) : m_object(base.compare_y_at_x_right_2_object()), m_enabled(enabled) {} /*! operates * \param xcv1 the first curve. * \param xcv2 the second curve. * \param p the reference point. * \return the comparison result. */ Comparison_result operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2, const Point_2& p) const { if (! m_enabled) return m_object(xcv1, xcv2, p); std::cout << "compare_y_at_x_right" << std::endl << " p: " << p << std::endl << " xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl; Comparison_result cr = m_object(xcv1, xcv2, p); std::cout << " result: " << cr << std::endl; return cr; } }; //! \name Intersections & subdivisions //@{ /*! \class Make_x_monotone_2 * A functor for subdividing curves into \f$x\f$-monotone curves. */ class Make_x_monotone_2 { private: typename Base::Make_x_monotone_2 m_object; bool m_enabled; public: /*! constructs */ Make_x_monotone_2(const Base& base, bool enabled = true) : m_object(base.make_x_monotone_2_object()), m_enabled(enabled) {} /*! subdivides a given curve into \f$x\f$-monotone subcurves and insert them * into a given output iterator. * \param cv the curve. * \param oi an output iterator for the result. Its value type is a variant * that wraps `Point_2` or `X_monotone_curve_2` objects. * \return the output iterator. */ template OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const { if (! m_enabled) return m_object(cv, oi); std::cout << "make_x_monotone" << std::endl << " cv: " << cv << std::endl; using Make_x_monotone_result = std::variant; std::list container; m_object(cv, std::back_inserter(container)); if (container.empty()) return oi; std::size_t i = 0; for (auto it = container.begin(); it != container.end(); ++it) { if (const auto* xcv = std::get_if(&*it)) { std::cout << " result[" << i++ << "]: xcv: " << *xcv << std::endl; continue; } if (const auto* p = std::get_if(&*it)) { std::cout << " result[" << i++ << "]: p: " << *p << std::endl; continue; } CGAL_error(); } for (auto it = container.begin(); it != container.end(); ++it) *oi++ = *it; container.clear(); return oi; } }; /*! A functor that splits an \f$x\f$-monotone curve at a point. */ class Split_2 { private: typename Base::Split_2 m_object; bool m_enabled; public: /*! constructs */ Split_2(const Base& base, bool enabled = true) : m_object(base.split_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve to split. * \param p the split point. * \param xcv1 the left resulting subcurve (`p` is its right endpoint).. * \param xcv2 the right resulting subcurve (`p` is its left endpoint).. * \pre `p` lies on `cv` but is not one of its end-points. */ void operator()(const X_monotone_curve_2& xcv, const Point_2& p, X_monotone_curve_2& xcv1, X_monotone_curve_2& xcv2) const { if (! m_enabled) { m_object(xcv, p, xcv1, xcv2); return; } std::cout << "split: " << std::endl << " xcv: " << xcv << std::endl << " p: " << p << std::endl; m_object(xcv, p, xcv1, xcv2); std::cout << " result xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl; } }; /*! A functor that computes intersections between two \f$x\f$-monotone curves. */ class Intersect_2 { private: typename Base::Intersect_2 m_object; bool m_enabled; public: /*! constructs */ Intersect_2(const Base& base, bool enabled = true) : m_object(base.intersect_2_object()), m_enabled(enabled) {} /*! computes the intersections of the two given curves and insert them into * a given output iterator. * \param xcv1 the first curve. * \param xcv2 the ssecond curve. * \param oi the output iterator for the result. It value type is a variant * that wraps an \f$x\f$-monotone overlapping curve or a pair that * consists of the intersection point and its multiplicity. * \return the past-the-end output iterator. */ template OutputIterator operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2, OutputIterator oi) const { using Intersection_point = std::pair; using Intersection_result = std::variant; if (! m_enabled) return m_object(xcv1, xcv2, oi); std::cout << "intersect" << std::endl << " xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl; std::list container; m_object(xcv1, xcv2, std::back_inserter(container)); if (container.empty()) return oi; std::size_t i = 0; for (const auto& item : container) { const X_monotone_curve_2* xcv = std::get_if(&item); if (xcv != nullptr) { std::cout << " result[" << i++ << "]: xcv: " << *xcv << std::endl; *oi++ = *xcv; continue; } const Intersection_point* ip = std::get_if(&item); if (ip != nullptr) { std::cout << " result[" << i++ << "]: p: " << ip->first << ", multiplicity: " << ip->second << std::endl; *oi++ = *ip; continue; } } return oi; } }; /*! A functor that tests whether two \f$x\f$-monotone curves can be merged. */ class Are_mergeable_2 { private: const Base& m_base_traits; bool m_enabled; public: /*! constructs */ Are_mergeable_2(const Base& base, bool enabled = true) : m_base_traits(base), m_enabled(enabled) {} /*! operates * \param xcv1 the first curve. * \param xcv2 the second curve. * \return true if the two curve are mergeable and false otherwise. * Two curves are mergeable if they have the same underlying theoretical * curve. */ bool operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2) const { return are_mergable_2_impl(xcv1, xcv2, 0); } private: /*! The base does not have `Are_mergable_2`. */ template bool are_mergable_2_impl(const X_monotone_curve_2& /* xcv1 */, const X_monotone_curve_2& /* xcv2 */, long) const { CGAL_error(); return false; } /*! The base does have `Are_mergable_2`. */ template auto are_mergable_2_impl(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2, int) const -> decltype(m_base_traits.are_mergeable_2_object().operator()(xcv1, xcv2)) { auto are_mergeable = m_base_traits.are_mergeable_2_object(); if (! m_enabled) return are_mergeable(xcv1, xcv2); std::cout << "are_mergeable" << std::endl << " xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl; bool mergeable = are_mergeable(xcv1, xcv2); std::cout << " result: " << mergeable << std::endl; return mergeable; } }; /*! A functor that merges two \f$x\f$-monotone curves into one. */ class Merge_2 { private: typename Base::Merge_2 m_object; bool m_enabled; public: /*! constructs */ Merge_2(const Base& base, bool enabled = true) : m_object(base.merge_2_object()), m_enabled(enabled) {} /*! operates * \param xcv1 the first curve. * \param xcv2 the second curve. * \param xcv the merged curve. */ void operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2, X_monotone_curve_2& xcv) const { std::cout << "merge" << std::endl << " xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl; return m_object(xcv1, xcv2, xcv); std::cout << " result: " << xcv << std::endl; } }; /*! A fnuctor that constructs an opposite \f$x\f$-monotone curve. */ class Construct_opposite_2 { private: typename Base::Construct_opposite_2 m_object; bool m_enabled; public: /*! constructs */ Construct_opposite_2(const Base& base, bool enabled = true) : m_object(base.construct_opposite_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve. * \return the opposite curve. */ X_monotone_curve_2 operator()(const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(xcv); std::cout << "construct_opposite" << std::endl << " xcv: " << xcv << std::endl; X_monotone_curve_2 xcv_out = m_object(xcv); std::cout << " result: " << xcv_out << std::endl; return xcv; } }; /*! A functor that compares the two endpoints of an \f$x\f$-monotone curve * lexigoraphically. */ class Compare_endpoints_xy_2 { private: typename Base::Compare_endpoints_xy_2 m_object; bool m_enabled; public: /*! constructs */ Compare_endpoints_xy_2(const Base& base, bool enabled = true) : m_object(base.compare_endpoints_xy_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve. * \return the comparison result. */ Comparison_result operator()(const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(xcv); std::cout << "compare_endpoints_xy" << std::endl << " xcv: " << xcv << std::endl; Comparison_result cr = m_object(xcv); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that approximates coordinates, points, and \f$x\f$-monotone * curves. */ class Approximate_2 { private: using Approximate_number_type = typename Base::Approximate_number_type; using Approximate_point_2 = typename Base::Approximate_point_2; typename Base::Approximate_2 m_object; bool m_enabled; public: /*! constructs */ Approximate_2(const Base& base, bool enabled = true) : m_object(base.approximate_2_object()), m_enabled(enabled) {} /*! obtains an approximation of a point coordinate. * \param p the exact point. * \param i the coordinate index (either 0 or 1). * \pre `i` is either 0 or 1. * \return An approximation of `p`'s \f$x\f$-coordinate (if `i` == 0), or an * approximation of `p`'s \f$y\f$-coordinate (if `i` == 1). */ Approximate_number_type operator()(const Point_2& p, std::size_t i) const { if (! m_enabled) return m_object(p, i); std::cout << "approximate_2" << std::endl << " p: " << p << ", i: " << i << std::endl; auto res = m_object(p, i); std::cout << " result: " << res << std::endl; return res; } /*! obtains an approximation of a point. */ Approximate_point_2 operator()(const Point_2& p) const { if (! m_enabled) return m_object(p); std::cout << "approximate_2" << std::endl << " p: " << p << std::endl; auto res = m_object(p); std::cout << " result: " << res << std::endl; return res; } /*! obtains an approximation of an \f$x\f$-monotone curve. */ template OutputIterator operator()(const X_monotone_curve_2& xcv, double error, OutputIterator oi, bool l2r = true) const { if (! m_enabled) return m_object(xcv, error, oi, l2r); std::cout << "approximate_2" << std::endl << " xcv: " << xcv << ", error: " << error << ", l2r: " << l2r << std::endl; std::list container; m_object(xcv, error, std::back_inserter(container), l2r); if (container.empty()) return oi; std::size_t i = 0; for (const auto& point : container) { std::cout << " result[" << i++ << "]: " << point << std::endl; *oi++ = point; } return oi; } }; // left-right /*! A functor that determines whether an endpoint of an \f$x\f$-monotone curve * lies on a boundary of the parameter space along the \f$x\f$-axis. */ class Parameter_space_in_x_2 { private: typename Base::Parameter_space_in_x_2 m_object; bool m_enabled; public: /*! constructs */ Parameter_space_in_x_2(const Base& base, bool enabled = true) : m_object(base.parameter_space_in_x_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve the end of which is tested. * \param ce the curve-end identifier. * \return the boundary type. */ Arr_parameter_space operator()(const X_monotone_curve_2& xcv, Arr_curve_end ce) const { if (! m_enabled) return m_object(xcv, ce); std::cout << "parameter_space_in_x" << std::endl << " xcv: " << xcv << ", ce: " << ce << std::endl; Arr_parameter_space bt = m_object(xcv, ce); std::cout << " result: " << bt << std::endl; return bt; } /*! A functor that obtains the parameter space at a point along the * \f$x\f$-axis. Every non-interior point is assumed to lie on the * left-right identification. Points at the poles additionally lie on the * bottom or top boundary. * \param p the point. * \return the parameter space at `p`. */ Arr_parameter_space operator()(const Point_2& p) const { if (! m_enabled) return m_object(p); std::cout << "parameter_space_in_x" << std::endl << " p: " << p << std::endl; Arr_parameter_space bt = m_object(p); std::cout << " result: " << bt << std::endl; return bt; } }; /*! A functor that determines whether a point or curve is on * \f$x\f$-identification. */ class Is_on_x_identification_2 { private: typename Base::Is_on_x_identification_2 m_object; bool m_enabled; public: /*! constructs */ Is_on_x_identification_2(const Base& base, bool enabled = true) : m_object(base.is_on_x_identification_2_object()), m_enabled(enabled) {} /*! operates * \param p1 the point. */ bool operator()(const Point_2& p) const { if (! m_enabled) return m_object(p); std::cout << "is_on_x_identification" << std::endl << " p: " << p << std::endl; bool cr = m_object(p); std::cout << " result: " << cr << std::endl; return cr; } /*! operates * \param xcv1 the curve. */ bool operator()(const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(xcv); std::cout << "is_on_x_identification" << std::endl << " xcv: " << xcv << std::endl; bool cr = m_object(xcv); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that compares the \f$y\f$-coordinate of two given points * that lie on vertical boundaries. */ class Compare_y_on_boundary_2 { private: typename Base::Compare_y_on_boundary_2 m_object; bool m_enabled; public: /*! constructs */ Compare_y_on_boundary_2(const Base& base, bool enabled = true) : m_object(base.compare_y_on_boundary_2_object()), m_enabled(enabled) {} /*! operates * \param p1 the first point. * \param p2 the second point. */ Comparison_result operator()(const Point_2& p1, const Point_2& p2) const { if (! m_enabled) return m_object(p1, p2); std::cout << "compare_y_on_boundary" << std::endl << " p1: " << p1 << std::endl << " p2: " << p2 << std::endl; Comparison_result cr = m_object(p1, p2); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that compares the \f$y\f$-coordinates of curve ends near the * boundary of the parameter space. */ class Compare_y_near_boundary_2 { private: typename Base::Compare_y_near_boundary_2 m_object; bool m_enabled; public: /*! constructs */ Compare_y_near_boundary_2(const Base& base, bool enabled = true) : m_object(base.compare_y_near_boundary_2_object()), m_enabled(enabled) {} /*! operates * \param xcv1 the first curve the end point of which is tested. * \param xcv2 the second curve the end point of which is tested. * \param ce the curve-end identifier. * \return the comparison result. */ Comparison_result operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2, Arr_curve_end ce) const { if (! m_enabled) return m_object(xcv1, xcv2, ce); std::cout << "compare_y_near_boundary" << std::endl << " ce: " << ce << std::endl << " xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl; Comparison_result cr = m_object(xcv1, xcv2, ce); std::cout << " result: " << cr << std::endl; return cr; } }; // bottom-top /*! A functor that determines whether an endpoint of an \f$x\f$-monotone arc * lies on a boundary of the parameter space along the \f$y\f$-axis. */ class Parameter_space_in_y_2 { private: typename Base::Parameter_space_in_y_2 m_object; bool m_enabled; public: /*! constructs */ Parameter_space_in_y_2(const Base& base, bool enabled = true) : m_object(base.parameter_space_in_y_2_object()), m_enabled(enabled) {} /*! operates * \param xcv the curve the end of which is tested. * \param ce the curve-end identifier. * \return the boundary type. */ Arr_parameter_space operator()(const X_monotone_curve_2& xcv, Arr_curve_end ce) const { if (! m_enabled) return m_object(xcv, ce); std::cout << "parameter_space_in_y" << std::endl << " ce: " << ce << ", xcv: " << xcv << std::endl; Arr_parameter_space bt = m_object(xcv, ce); std::cout << " result: " << bt << std::endl; return bt; } /*! operates * \param p the point. * \return the boundary type. */ Arr_parameter_space operator()(const Point_2& p) const { if (! m_enabled) return m_object(p); std::cout << "parameter_space_in_y" << std::endl << " point: " << p << std::endl; Arr_parameter_space bt = m_object(p); std::cout << " result: " << bt << std::endl; return bt; } }; /*! A functor that determines whether a point or curve is on * \f$y\f$-identification. */ class Is_on_y_identification_2 { private: typename Base::Is_on_y_identification_2 m_object; bool m_enabled; public: /*! constructs */ Is_on_y_identification_2(const Base& base, bool enabled = true) : m_object(base.is_on_y_identification_2_object()), m_enabled(enabled) {} /*! operates * \param p1 the point. */ bool operator()(const Point_2& p) const { if (! m_enabled) return m_object(p); std::cout << "is_on_y_identification" << std::endl << " p: " << p << std::endl; bool cr = m_object(p); std::cout << " result: " << cr << std::endl; return cr; } /*! operates * \param xcv1 the curve. */ bool operator()(const X_monotone_curve_2& xcv) const { if (! m_enabled) return m_object(xcv); std::cout << "is_on_y_identification" << std::endl << " xcv: " << xcv << std::endl; bool cr = m_object(xcv); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that compares the \f$x\f$-coordinate of two given points * that lie on horizontal boundaries. */ class Compare_x_on_boundary_2 { private: typename Base::Compare_x_on_boundary_2 m_object; bool m_enabled; public: /*! constructs */ Compare_x_on_boundary_2(const Base& base, bool enabled = true) : m_object(base.compare_x_on_boundary_2_object()), m_enabled(enabled) {} /*! operates * \param p1 the first point. * \param p2 the second point. */ Comparison_result operator()(const Point_2& p1, const Point_2& p2) const { if (! m_enabled) return m_object(p1, p2); std::cout << "compare_x_on_boundary" << std::endl << " p1: " << p1 << std::endl << " p2: " << p2 << std::endl; Comparison_result cr = m_object(p1, p2); std::cout << " result: " << cr << std::endl; return cr; } /*! operates * \param pt the point. * \param xcv the curve. * \param ce the curve-end. */ Comparison_result operator()(const Point_2& pt, const X_monotone_curve_2& xcv, Arr_curve_end ce) const { if (! m_enabled) return m_object(pt, xcv, ce); std::cout << "compare_x_on_boundary" << std::endl << " pt: " << pt << std::endl << " xcv: " << xcv << std::endl << " ce: " << ce << std::endl; Comparison_result cr = m_object(pt, xcv, ce); std::cout << " result: " << cr << std::endl; return cr; } /*! operates * \param xcv1 the first curve. * \param ce1 the first curve-end. * \param xcv2 the second curve. * \param ce2 the second curve-end. */ Comparison_result operator()(const X_monotone_curve_2& xcv1, Arr_curve_end ce1, const X_monotone_curve_2& xcv2, Arr_curve_end ce2) const { if (! m_enabled) return m_object(xcv2, ce1, xcv2, ce2); std::cout << "compare_x_on_boundary" << std::endl << "xcv1: " << xcv1 << std::endl << " ce1: " << ce1 << std::endl << "xcv2: " << xcv2 << std::endl << " ce2: " << ce2 << std::endl; Comparison_result cr = m_object(xcv1, ce1, xcv2, ce2); std::cout << " result: " << cr << std::endl; return cr; } }; /*! A functor that compares the \f$x\f$-coordinates of curve ends near the * boundary of the parameter space. */ class Compare_x_near_boundary_2 { private: typename Base::Compare_x_near_boundary_2 m_object; bool m_enabled; public: /*! constructs */ Compare_x_near_boundary_2(const Base& base, bool enabled = true) : m_object(base.compare_x_near_boundary_2_object()), m_enabled(enabled) {} /*! operates * \param xcv1 the first curve the end of which is to be compared. * \param ce1 the identifier of the end of the first curve. * \param xcv2 the second curve the end of which is to be compared. * \param ce2 the identifier of the end of the second curve. * \return the comparison result. */ Comparison_result operator()(const X_monotone_curve_2& xcv1, const X_monotone_curve_2& xcv2, Arr_curve_end ce) const { if (! m_enabled) return m_object(xcv1, xcv2, ce); std::cout << "compare_x_near_boundary 2" << std::endl << " xcv1: " << xcv1 << std::endl << " xcv2: " << xcv2 << std::endl << " ce: " << ce << std::endl; Comparison_result cr = m_object(xcv1, xcv2, ce); std::cout << " result: " << cr << std::endl; return cr; } }; //@} /// \name Obtain the appropriate functor //@{ Compare_x_2 compare_x_2_object() const { return Compare_x_2(*this, compare_x_op()); } Compare_xy_2 compare_xy_2_object() const { return Compare_xy_2(*this, compare_xy_op()); } Construct_min_vertex_2 construct_min_vertex_2_object() const { return Construct_min_vertex_2(*this, construct_min_vertex_op()); } Construct_max_vertex_2 construct_max_vertex_2_object() const { return Construct_max_vertex_2(*this, construct_max_vertex_op()); } Is_vertical_2 is_vertical_2_object() const { return Is_vertical_2(*this, is_vertical_op()); } Compare_y_at_x_2 compare_y_at_x_2_object() const { return Compare_y_at_x_2(*this, compare_y_at_x_op()); } Equal_2 equal_2_object() const { return Equal_2(*this, equal_points_op(), equal_curves_op()); } Compare_y_at_x_left_2 compare_y_at_x_left_2_object() const { return Compare_y_at_x_left_2(*this, compare_y_at_x_left_op()); } Compare_y_at_x_right_2 compare_y_at_x_right_2_object() const { return Compare_y_at_x_right_2(*this, compare_y_at_x_right_op()); } Make_x_monotone_2 make_x_monotone_2_object() const { return Make_x_monotone_2(*this, make_x_monotone_op()); } Split_2 split_2_object() const { return Split_2(*this, split_op()); } Intersect_2 intersect_2_object() const { return Intersect_2(*this, intersect_op()); } Are_mergeable_2 are_mergeable_2_object() const { return Are_mergeable_2(*this, are_mergeable_op()); } Merge_2 merge_2_object() const { return Merge_2(*this, merge_op()); } Construct_opposite_2 construct_opposite_2_object() const { return Construct_opposite_2(*this, construct_opposite_op()); } Compare_endpoints_xy_2 compare_endpoints_xy_2_object() const { return Compare_endpoints_xy_2(*this, compare_endpoints_xy_op()); } Approximate_2 approximate_2_object() const { return Approximate_2(*this, approximate_op()); } // left-right Parameter_space_in_x_2 parameter_space_in_x_2_object() const { return Parameter_space_in_x_2(*this, parameter_space_in_x_op()); } Is_on_x_identification_2 is_on_x_identification_2_object() const { return Is_on_x_identification_2(*this, is_on_x_identification_op()); } Compare_y_on_boundary_2 compare_y_on_boundary_2_object() const { return Compare_y_on_boundary_2(*this, compare_y_on_boundary_op()); } Compare_y_near_boundary_2 compare_y_near_boundary_2_object() const { return Compare_y_near_boundary_2(*this, compare_y_near_boundary_op()); } // bottom-top Parameter_space_in_y_2 parameter_space_in_y_2_object() const { return Parameter_space_in_y_2(*this, parameter_space_in_y_op()); } Is_on_y_identification_2 is_on_y_identification_2_object() const { return Is_on_y_identification_2(*this, is_on_y_identification_op()); } Compare_x_on_boundary_2 compare_x_on_boundary_2_object() const { return Compare_x_on_boundary_2(*this, compare_x_on_boundary_op()); } Compare_x_near_boundary_2 compare_x_near_boundary_2_object() const { return Compare_x_near_boundary_2(*this, compare_x_near_boundary_op()); } //@} }; template OutputStream& operator<<(OutputStream& os, Comparison_result cr) { os << ((cr == SMALLER) ? "SMALLER" : (cr == EQUAL) ? "EQUAL" : "LARGER"); return os; } } // namespace CGAL #include #endif