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) 1998-2003 ETH Zurich (Switzerland). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Bounding_volumes/include/CGAL/Rectangular_p_center_traits_2.h $ // $Id: include/CGAL/Rectangular_p_center_traits_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Michael Hoffmann #ifndef CGAL_RECTANGULAR_P_CENTER_TRAITS_2_H #define CGAL_RECTANGULAR_P_CENTER_TRAITS_2_H 1 #include #include #include #include #include #include namespace CGAL { template < class A, class S > struct Select : public CGAL::cpp98::binary_function< A, A, A > { Select() {} Select(const S& s) : s_(s) {} A operator()(const A& a, const A& b) const { return s_(a, b) ? a : b; } A operator()(const A& a, const A& b) { return s_(a, b) ? a : b; } protected: S s_; }; template < class R > struct I_Signed_x_distance_2 : public CGAL::cpp98::binary_function< Point_2< R >, Point_2< R >, typename R::FT > { typename R::FT operator()(const Point_2< R >& q1, const Point_2< R >& q2) const { return q1.x() - q2.x(); } }; template < class R > struct I_Signed_y_distance_2 : public CGAL::cpp98::binary_function< Point_2< R >, Point_2< R >, typename R::FT > { typename R::FT operator()(const Point_2< R >& q1, const Point_2< R >& q2) const { return q1.y() - q2.y(); } }; template < class R > struct I_Infinity_distance_2 : public CGAL::cpp98::binary_function< Point_2< R >, Point_2< R >, typename R::FT > { // Added as workaround for VC2017 with /arch:AVX to fix // https://cgal.geometryfactory.com/CGAL/testsuite/CGAL-4.14-I-95/Rectangular_p_center_2_Examples/TestReport_afabri_x64_Cygwin-Windows10_MSVC2017-Release-64bits.gz I_Infinity_distance_2() {} I_Infinity_distance_2(const I_Infinity_distance_2&) {} I_Infinity_distance_2& operator=(const I_Infinity_distance_2&) { return *this; } typename R::FT operator()(const Point_2< R >& q1, const Point_2< R >& q2) const { return (std::max)(CGAL_NTS abs(q1.x() - q2.x()), CGAL_NTS abs(q1.y() - q2.y())); } }; template < class R > struct I_Signed_infinity_distance_2 : public CGAL::cpp98::binary_function< Point_2< R >, Point_2< R >, typename R::FT > { typename R::FT operator()(const Point_2< R >& q1, const Point_2< R >& q2) const { return (std::max)(q1.x() - q2.x(), q1.y() - q2.y()); } }; template < class R > struct I_Construct_point_2_above_right_implicit_point_2 { // (p, q, r) |--> (p.x() + r, q.y() + r) typedef typename R::FT FT; typedef typename R::Point_2 P; inline P operator()(const P& p, const P& q, FT r) const { return P(p.x() + r, q.y() + r); } }; template < class R > struct I_Construct_point_2_above_left_implicit_point_2 { // (p, q, r) |--> (p.x() - r, q.y() + r) typedef typename R::FT FT; typedef typename R::Point_2 P; inline P operator()(const P& p, const P& q, FT r) const { return P(p.x() - r, q.y() + r); } }; template < class R > struct I_Construct_point_2_below_left_implicit_point_2 { // (p, q, r) |--> (p.x() - r, q.y() - r) typedef typename R::FT FT; typedef typename R::Point_2 P; inline P operator()(const P& p, const P& q, FT r) const { return P(p.x() - r, q.y() - r); } }; template < class R > struct I_Construct_point_2_below_right_implicit_point_2 { // (p, q, r) |--> (p.x() + r, q.y() - r) typedef typename R::FT FT; typedef typename R::Point_2 P; inline P operator()(const P& p, const P& q, FT r) const { return P(p.x() + r, q.y() - r); } }; template < class R > struct Rectangular_p_center_default_traits_2 : public R { // ----------------------------------------------------------------- // types: // typedef typename R::FT FT; typedef typename R::Point_2 Point_2; typedef typename R::Iso_rectangle_2 Iso_rectangle_2; // ----------------------------------------------------------------- // predicates: // typedef typename R::Less_x_2 Less_x_2; typedef typename R::Less_y_2 Less_y_2; // ----------------------------------------------------------------- // constructions: // // from the kernel typedef typename R::Construct_iso_rectangle_2 Construct_iso_rectangle_2; typedef typename R::Construct_vertex_2 Construct_vertex_2; // additions typedef I_Signed_x_distance_2< R > Signed_x_distance_2; typedef I_Signed_y_distance_2< R > Signed_y_distance_2; typedef I_Infinity_distance_2< R > Infinity_distance_2; typedef I_Signed_infinity_distance_2< R > Signed_infinity_distance_2; typedef I_Construct_point_2_above_right_implicit_point_2< R > Construct_point_2_above_right_implicit_point_2; typedef I_Construct_point_2_above_left_implicit_point_2< R > Construct_point_2_above_left_implicit_point_2; typedef I_Construct_point_2_below_right_implicit_point_2< R > Construct_point_2_below_right_implicit_point_2; typedef I_Construct_point_2_below_left_implicit_point_2< R > Construct_point_2_below_left_implicit_point_2; // get object methods: Signed_x_distance_2 signed_x_distance_2_object() const { return Signed_x_distance_2(); } Signed_y_distance_2 signed_y_distance_2_object() const { return Signed_y_distance_2(); } Infinity_distance_2 infinity_distance_2_object() const { return Infinity_distance_2(); } Signed_infinity_distance_2 signed_infinity_distance_2_object() const { return Signed_infinity_distance_2(); } Construct_point_2_above_right_implicit_point_2 construct_point_2_above_right_implicit_point_2_object() const { return Construct_point_2_above_right_implicit_point_2(); } Construct_point_2_above_left_implicit_point_2 construct_point_2_above_left_implicit_point_2_object() const { return Construct_point_2_above_left_implicit_point_2(); } Construct_point_2_below_left_implicit_point_2 construct_point_2_below_left_implicit_point_2_object() const { return Construct_point_2_below_left_implicit_point_2(); } Construct_point_2_below_right_implicit_point_2 construct_point_2_below_right_implicit_point_2_object() const { return Construct_point_2_below_right_implicit_point_2(); } }; // Rectangular_p_center_default_traits_2 template < class Traits_, class PiercingFunction_ > struct Rectangular_p_center_matrix_search_traits_2 { typedef Traits_ Traits; typedef typename Traits::FT FT; typedef typename Traits::Point_2 Point_2; typedef PiercingFunction_ PiercingFunction; typedef Staircases< Traits > LD; typedef typename LD::size_type size_type; template < class InputIC > Rectangular_p_center_matrix_search_traits_2( InputIC f, InputIC l, Traits t, const PiercingFunction& p) : ld(f, l, t), pf(p) #if (!defined(CGAL_OPTIMISATION_NO_ASSERTIONS) && \ !defined(CGAL_NO_ASSERTIONS) && !defined(NDEBUG)) , ld_size(ld.size()) #endif // optimisation_assertion_code {} size_type number_of_points() const { return ld.pts.size(); } bool operator()(FT v) { CGAL_assertion(ld.size() == ld_size); ld.r = v / FT(2); bool ok; pf(ld, Wastebasket< Point_2 >(), ok); CGAL_assertion(ld.size() == ld_size); return ok; } template < class OutputIterator > OutputIterator operator()(FT v, OutputIterator o, bool& ok) { CGAL_assertion(ld.size() == ld_size); ld.r = v / FT(2); OutputIterator n = pf(ld, o, ok); CGAL_assertion(ld.size() == ld_size); return n; //pf(ld, o, ok); } protected: // data members: LD ld; PiercingFunction pf; CGAL_assertion_code(typename LD::size_type ld_size;) // copying this would be too inefficient Rectangular_p_center_matrix_search_traits_2( const Rectangular_p_center_matrix_search_traits_2&) {} }; // Rectangular_p_center_matrix_search_traits_2< ... > template < class ForwardIterator, class Traits > typename Traits::Iso_rectangle_2 bounding_box_2(ForwardIterator f, ForwardIterator l, const Traits& t) // PRE: f != l. { CGAL_precondition(f != l); typedef typename Traits::Less_x_2 Less_x_2; typedef typename Traits::Less_y_2 Less_y_2; typedef typename Traits::Construct_iso_rectangle_2 Rect; typedef typename Traits::Construct_vertex_2 CVertex; Less_x_2 lessx = t.less_x_2_object(); Less_y_2 lessy = t.less_y_2_object(); Rect rect = t.construct_iso_rectangle_2_object(); CVertex v = t.construct_vertex_2_object(); ForwardIterator xmin = f; ForwardIterator xmax = f; ForwardIterator ymin = f; ForwardIterator ymax = f; while (++f != l) { if (lessx(*f, *xmin)) xmin = f; if (lessx(*xmax, *f)) xmax = f; if (lessy(*f, *ymin)) ymin = f; if (lessy(*ymax, *f)) ymax = f; } return rect(v(rect(*xmin, *ymin), 0), v(rect(*xmax, *ymax), 2)); } // bounding_box_2(f, l, t) template < class ForwardIterator > inline auto bounding_box_2(ForwardIterator f, ForwardIterator l) // PRE: f != l. { CGAL_precondition(f != l); // that is how it is supposed to be ... //typedef typename std::iterator_traits< ForwardIterator >::value_type::R // Traits; typedef typename std::iterator_traits< ForwardIterator >::value_type::R R; typedef Rectangular_p_center_default_traits_2< R > Traits; Traits t; return bounding_box_2(f, l, t); } // bounding_box_2(f, l) template < class Rectangle, class Traits > inline Rectangle construct_bounding_box_union_2(const Rectangle& r1, const Rectangle& r2, const Traits& t) { typedef typename Traits::Construct_iso_rectangle_2 Rect; typedef typename Traits::Construct_vertex_2 CVertex; typedef typename Traits::Less_x_2 Less_x_2; typedef typename Traits::Less_y_2 Less_y_2; Less_x_2 lessx = t.less_x_2_object(); Less_y_2 lessy = t.less_y_2_object(); Rect rect = t.construct_iso_rectangle_2_object(); CVertex v = t.construct_vertex_2_object(); return rect( v(rect(lessx(v(r1, 0), v(r2, 0)) ? v(r1, 0) : v(r2, 0), lessy(v(r1, 0), v(r2, 0)) ? v(r1, 0) : v(r2, 0)), 0), v(rect(lessx(v(r2, 2), v(r1, 2)) ? v(r1, 2) : v(r2, 2), lessy(v(r2, 2), v(r1, 2)) ? v(r1, 2) : v(r2, 2)), 2)); } // construct_bounding_box_union_2(r1, r2, t) template < class Rectangle > inline Rectangle construct_bounding_box_union_2(const Rectangle& r1, const Rectangle& r2) { typename Rectangle::R t; return construct_bounding_box_union_2(r1, r2, t); } // construct_bounding_box_union_2(r1, r2) } //namespace CGAL #endif // ! (CGAL_RECTANGULAR_P_CENTER_TRAITS_2_H)