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) 2003,2004,2005,2006,2007,2008,2009,2010,2011 INRIA Sophia-Antipolis (France). // 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_circular_line_arc_traits_2.h $ // $Id: include/CGAL/Arr_circular_line_arc_traits_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Monique Teillaud, Sylvain Pion, Julien Hazebrouck // Partially supported by the IST Programme of the EU as a Shared-cost // RTD (FET Open) Project under Contract No IST-2000-26473 // (ECG - Effective Computational Geometry for Curves and Surfaces) // and a STREP (FET Open) Project under Contract No IST-006413 // (ACS -- Algorithms for Complex Shapes) #ifndef CGAL_CIRCULAR_KERNEL_VARIANT_TRAITS_2_H #define CGAL_CIRCULAR_KERNEL_VARIANT_TRAITS_2_H #include #include /*! \file * This file was developed at Inria, France, and copied over to the * Arrangement_2 package, which it is now part of. It contains a traits * class for the arrangement package that handles circular and linear curves. * It is based on the circular kernel. * * \todo Fix the circular-kernel make-x-monotone functor to use modern variant * instead of the legacy CGAL::Object. Then, eliminate the special * implementation here and directly use the kernel functor instead. */ #include #include #include #include namespace CGAL { namespace VariantFunctors{ // Takes an iterator range of Object(Line/Circular_arc/Point), // returns a variant of Line, Circular_arc, and Point_2. template OutputIterator object_to_object_variant(const std::vector& res1, OutputIterator res2) { typedef typename CK::Circular_arc_point_2 Point_2; typedef std::variant X_monotone_curve_2; typedef std::variant Make_x_monotone_result; for (auto it = res1.begin(); it != res1.end(); ++it) { if (const Arc1* arc = CGAL::object_cast(&*it)) { std::variant v = *arc; *res2++ = Make_x_monotone_result(v); } else if (const Arc2* line = CGAL::object_cast(&*it)) { std::variant v = *line; *res2++ = Make_x_monotone_result(v); } else if (const Point_2* p = CGAL::object_cast(&*it)) { *res2++ = Make_x_monotone_result(*p); } else CGAL_error(); } return res2; } template class Compare_y_to_right_2 { public: typedef CGAL::Comparison_result result_type; typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; result_type operator()(const std::variant< Arc1, Arc2 > &a1, const std::variant< Arc1, Arc2 > &a2, const Circular_arc_point_2 &p) const { if ( const Arc1* arc1 = std::get_if( &a1 ) ){ if ( const Arc1* arc2 = std::get_if( &a2 ) ){ return CircularKernel() .compare_y_to_right_2_object()(*arc1, *arc2, p); } else { const Arc2* arc2e = std::get_if( &a2 ); return CircularKernel() .compare_y_to_right_2_object()(*arc1, *arc2e, p); } } const Arc2* arc1 = std::get_if( &a1 ); if ( const Arc1* arc2 = std::get_if( &a2 ) ){ return CircularKernel() .compare_y_to_right_2_object()(*arc1, *arc2, p); } const Arc2* arc2e = std::get_if( &a2 ); return CircularKernel() .compare_y_to_right_2_object()(*arc1, *arc2e, p); } }; template class Variant_Equal_2 { public : template < typename T > bool operator()(const T &a0, const T &a1) const { return CircularKernel().equal_2_object()(a0,a1); } template < typename T1, typename T2 > bool operator()(const T1 &, const T2 &) const { return false; } }; template class Equal_2 : public CircularKernel::Equal_2 { public: typedef std::variant< Arc1, Arc2 > Curve_2; typedef bool result_type; using CircularKernel::Equal_2::operator(); typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; typedef typename CircularKernel::Line_arc_2 Line_arc_2; typedef typename CircularKernel::Circular_arc_2 Circular_arc_2; typedef typename CircularKernel::Equal_2 CK_Equal_2; result_type operator() (const Circular_arc_point_2 &p0, const Circular_arc_point_2 &p1) const { return CK_Equal_2()(p0, p1); } result_type operator() (const Circular_arc_2 &a0, const Circular_arc_2 &a1) const { return CK_Equal_2()(a0, a1); } result_type operator() (const Line_arc_2 &a0, const Line_arc_2 &a1) const { return CK_Equal_2()(a0, a1); } result_type operator() ( const Line_arc_2 &/*a0*/, const Circular_arc_2 &/*a1*/) const { return false; } result_type operator() ( const Circular_arc_2 &/*a0*/, const Line_arc_2 &/*a1*/) const { return false; } result_type operator()(const Curve_2 &a0, const Curve_2 &a1) const { return std::visit ( Variant_Equal_2(), a0, a1 ); } }; template class Compare_y_at_x_2 { public: typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; typedef CGAL::Comparison_result result_type; result_type operator() (const Circular_arc_point_2 &p, const std::variant< Arc1, Arc2 > &A1) const { if ( const Arc1* arc1 = std::get_if( &A1 ) ){ return CircularKernel().compare_y_at_x_2_object()(p, *arc1); } else { const Arc2* arc2 = std::get_if( &A1 ); return CircularKernel().compare_y_at_x_2_object()(p, *arc2); } } }; template class Variant_Do_overlap_2 { public: template < typename T > bool operator()(const T &a0, const T &a1) const { return CircularKernel().do_overlap_2_object()(a0, a1); } template < typename T1, typename T2 > bool operator()(const T1 &, const T2 &) const { return false; } }; template class Do_overlap_2 { public: typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; typedef bool result_type; result_type operator()(const std::variant< Arc1, Arc2 > &A0, const std::variant< Arc1, Arc2 > &A1) const { return std::visit ( Variant_Do_overlap_2(), A0, A1 ); } }; //! A functor for subdividing curves into x-monotone curves. template class Make_x_monotone_2 { public: typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; template < class OutputIterator,class Not_X_Monotone > OutputIterator operator()(const std::variant &A, OutputIterator res) const { if ( const Arc1* arc1 = std::get_if( &A ) ) { return CircularKernel(). make_x_monotone_2_object()(*arc1, res); } else { const Arc2* arc2 = std::get_if( &A ); return CircularKernel(). make_x_monotone_2_object()(*arc2, res); } } }; template class Intersect_2 { public: typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; template < class OutputIterator > OutputIterator operator()(const std::variant< Arc1, Arc2 > &c1, const std::variant< Arc1, Arc2 > &c2, OutputIterator oi) const { if ( const Arc1* arc1 = std::get_if( &c1 ) ){ if ( const Arc1* arc2 = std::get_if( &c2 ) ){ return CircularKernel().intersect_2_object()(*arc1, *arc2, oi); } const Arc2* arc2 = std::get_if( &c2 ); return CircularKernel().intersect_2_object()(*arc1, *arc2, oi); } const Arc2* arc1e = std::get_if( &c1 ); if ( const Arc1* arc2 = std::get_if( &c2 ) ){ return CircularKernel().intersect_2_object()(*arc1e, *arc2, oi); } const Arc2* arc2 = std::get_if( &c2 ); return CircularKernel().intersect_2_object()(*arc1e, *arc2, oi); } }; template class Split_2 { public: typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; typedef void result_type; result_type operator()(const std::variant< Arc1, Arc2 > &A, const Circular_arc_point_2 &p, std::variant< Arc1, Arc2 > &ca1, std::variant< Arc1, Arc2 > &ca2) const { // TODO : optimize by extracting the references from the variants ? if ( const Arc1* arc1 = std::get_if( &A ) ){ Arc1 carc1; Arc1 carc2; CircularKernel().split_2_object()(*arc1, p, carc1, carc2); ca1 = carc1; ca2 = carc2; return ; } else{ const Arc2* arc2 = std::get_if( &A ); Arc2 cline1; Arc2 cline2; CircularKernel().split_2_object()(*arc2, p, cline1, cline2); ca1 = cline1; ca2 = cline2; return ; } } }; template class Variant_Construct_min_vertex_2 { typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; public : typedef Circular_arc_point_2 result_type; //typedef const result_type& qualified_result_type; template < typename T > //std::remove_reference_t Circular_arc_point_2 operator()(const T &a) const { //CGAL_kernel_precondition(CircularKernel().compare_xy_2_object()(a.left(), a.right())==CGAL::SMALLER); return CircularKernel().construct_circular_min_vertex_2_object()(a); } }; template class Construct_min_vertex_2//: public Has_qrt { typedef typename CircularKernel::Circular_arc_point_2 Point_2; public: typedef Point_2 result_type; //typedef const result_type& qualified_result_type; //std::remove_reference_t result_type operator() (const std::variant< Arc1, Arc2 > & cv) const { return std::visit ( Variant_Construct_min_vertex_2(), cv ); } }; template class Variant_Construct_max_vertex_2 { typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; public: typedef Circular_arc_point_2 result_type; //typedef const result_type& qualified_result_type; template < typename T > //std::remove_reference_t Circular_arc_point_2 operator()(const T &a) const { //CGAL_kernel_precondition(CircularKernel().compare_xy_2_object()(a.left(), a.right())==CGAL::SMALLER); return (CircularKernel().construct_circular_max_vertex_2_object()(a)); } }; template class Construct_max_vertex_2//: public Has_qrt { typedef typename CircularKernel::Circular_arc_point_2 Point_2; public: /*! obtains the right endpoint of the x-monotone curve (segment). * \param cv The curve. * \return The right endpoint. */ typedef Point_2 result_type; //typedef const result_type& qualified_result_type; //std::remove_reference result_type operator() (const std::variant< Arc1, Arc2 > & cv) const { return std::visit ( Variant_Construct_max_vertex_2(), cv ); } }; template class Variant_Is_vertical_2 { public: template < typename T > bool operator()(const T &a) const { return CircularKernel().is_vertical_2_object()(a); } }; template class Is_vertical_2 { public: typedef bool result_type; bool operator() (const std::variant< Arc1, Arc2 >& cv) const { return std::visit ( Variant_Is_vertical_2(), cv ); } }; } // an empty class used to have different types between Curve_2 and X_monotone_curve_2 // in Arr_circular_line_arc_traits_2. namespace internal_Argt_traits { struct Not_X_Monotone{}; inline std::ostream& operator << (std::ostream& os, const Not_X_Monotone&) {return os;} } /// Traits class for CGAL::Arrangement_2 (and similar) based on a CircularKernel. template < typename CircularKernel> class Arr_circular_line_arc_traits_2 { typedef Arr_circular_line_arc_traits_2< CircularKernel > Self; typedef typename CircularKernel::Line_arc_2 Arc1; typedef typename CircularKernel::Circular_arc_2 Arc2; public: typedef CircularKernel Kernel; typedef typename CircularKernel::Circular_arc_point_2 Circular_arc_point_2; typedef typename CircularKernel::Circular_arc_point_2 Point; typedef typename CircularKernel::Circular_arc_point_2 Point_2; typedef unsigned int Multiplicity; typedef CGAL::Tag_false Has_left_category; typedef CGAL::Tag_false Has_merge_category; typedef CGAL::Tag_false Has_do_intersect_category; typedef Arr_oblivious_side_tag Left_side_category; typedef Arr_oblivious_side_tag Bottom_side_category; typedef Arr_oblivious_side_tag Top_side_category; typedef Arr_oblivious_side_tag Right_side_category; typedef internal_Argt_traits::Not_X_Monotone Not_X_Monotone; typedef std::variant< Arc1, Arc2, Not_X_Monotone > Curve_2; typedef std::variant< Arc1, Arc2 > X_monotone_curve_2; private: CircularKernel ck; public: Arr_circular_line_arc_traits_2(const CircularKernel &k = CircularKernel()) : ck(k) {} typedef typename CircularKernel::Compare_x_2 Compare_x_2; typedef typename CircularKernel::Compare_xy_2 Compare_xy_2; typedef typename VariantFunctors::Construct_min_vertex_2 Construct_min_vertex_2; typedef VariantFunctors::Construct_max_vertex_2 Construct_max_vertex_2; typedef VariantFunctors::Is_vertical_2 Is_vertical_2; typedef VariantFunctors::Compare_y_at_x_2 Compare_y_at_x_2; typedef VariantFunctors::Compare_y_to_right_2 Compare_y_at_x_right_2; typedef VariantFunctors::Equal_2 Equal_2; typedef VariantFunctors::Make_x_monotone_2 Make_x_monotone_2; typedef VariantFunctors::Split_2 Split_2; typedef VariantFunctors::Intersect_2 Intersect_2; Compare_x_2 compare_x_2_object() const { return ck.compare_x_2_object(); } Compare_xy_2 compare_xy_2_object() const { return ck.compare_xy_2_object(); } Compare_y_at_x_2 compare_y_at_x_2_object() const { return Compare_y_at_x_2(); } Compare_y_at_x_right_2 compare_y_at_x_right_2_object() const { return Compare_y_at_x_right_2(); } Equal_2 equal_2_object() const { return Equal_2(); } Make_x_monotone_2 make_x_monotone_2_object() const { return Make_x_monotone_2(); } Split_2 split_2_object() const { return Split_2(); } Intersect_2 intersect_2_object() const { return Intersect_2(); } Construct_min_vertex_2 construct_min_vertex_2_object() const { return Construct_min_vertex_2(); } Construct_max_vertex_2 construct_max_vertex_2_object() const { return Construct_max_vertex_2(); } Is_vertical_2 is_vertical_2_object() const { return Is_vertical_2();} }; } // namespace CGAL #include #endif