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_2.h $ // $Id: include/CGAL/rectangular_p_center_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Michael Hoffmann #ifndef CGAL_RECTANGULAR_P_CENTER_2_H #define CGAL_RECTANGULAR_P_CENTER_2_H 1 #include #include #include #include #include #include #include #include namespace CGAL { template < class Operation, class RandomAccessIC_row, class RandomAccessIC_column > class Cartesian_matrix_horizontally_flipped : public Cartesian_matrix< Operation, RandomAccessIC_row, RandomAccessIC_column > { public: typedef Cartesian_matrix< Operation, RandomAccessIC_row, RandomAccessIC_column > Base; typedef typename Base::Value Value; using Base::number_of_rows; using Base::number_of_columns; /* Cartesian_matrix_horizontally_flipped( Operation o = Operation()) : Base( o) {} */ Cartesian_matrix_horizontally_flipped( RandomAccessIC_row r_f, RandomAccessIC_row r_l, RandomAccessIC_column c_f, RandomAccessIC_column c_l) : Base( r_f, r_l, c_f, c_l) {} Cartesian_matrix_horizontally_flipped( RandomAccessIC_row r_f, RandomAccessIC_row r_l, RandomAccessIC_column c_f, RandomAccessIC_column c_l, const Operation& o) : Base( r_f, r_l, c_f, c_l, o) {} Value operator()( int r, int c) const { CGAL_precondition( r >= 0 && r < number_of_rows()); CGAL_precondition( c >= 0 && c < number_of_columns()); return Base::operator()( r, number_of_columns() - 1 - c); } }; template < class Operation, class RandomAccessIC_row, class RandomAccessIC_column > inline Cartesian_matrix_horizontally_flipped< Operation, RandomAccessIC_row, RandomAccessIC_column > cartesian_matrix_horizontally_flipped( RandomAccessIC_row r_f, RandomAccessIC_row r_l, RandomAccessIC_column c_f, RandomAccessIC_column c_l, const Operation& o) { return Cartesian_matrix_horizontally_flipped< Operation, RandomAccessIC_row, RandomAccessIC_column > ( r_f, r_l, c_f, c_l, o); } /* template < class ForwardIterator, class OutputIterator, class FT, class PiercingFunction > inline OutputIterator rectangular_p_center_2_binary_search( ForwardIterator f, ForwardIterator l, OutputIterator o, FT& r, const PiercingFunction& pf) { return rectangular_p_center_2_binary_search( f, l, o, r, pf, CGAL_reinterpret_cast( Rectangular_p_center_matrix_search_traits_2< PiercingFunction >, 0)); } // rectangular_p_center_2_binary_search( ... ) template < class ForwardIterator, class OutputIterator, class Traits > OutputIterator rectangular_p_center_2_binary_search( ForwardIterator f, ForwardIterator l, OutputIterator o, typename Traits::FT& r, const typename Traits::PiercingFunction& pf, Traits*) // // preconditions: // -------------- // * Traits fulfills the requirements for PCenter traits classes // * value type of ForwardIterator is Traits::Point_2 // * OutputIterator accepts Traits::Point_2 as value type // * the range [f,l) is not empty // // functionality: // -------------- // { CGAL_precondition( f != l); // typedefs: typedef typename Traits::FT FT; typedef typename Traits::X X; typedef typename Traits::Y Y; // create Traits object: Traits pierce_it( f, l, pf); // check, if input data is trivial bool ok; OutputIterator oi = pierce_it(FT(0), o, ok); if (ok) { r = 0; return oi; } // create vector with absolute coordinate differences: std::vector< FT > c_diffs; c_diffs.reserve( pierce_it.number_of_points() * (pierce_it.number_of_points() - 1)); for ( ForwardIterator i( f); i != l; ++i) for ( ForwardIterator j( i + 1); j != l; ++j) { c_diffs.push_back( CGAL_NTS abs( i->x() - j->x())); c_diffs.push_back( CGAL_NTS abs( i->y() - j->y())); } CGAL_assertion( c_diffs.size() == pierce_it.number_of_points() * (pierce_it.number_of_points() - 1)); // sort it: sort( c_diffs.begin(), c_diffs.end()); // search it: int b( 0); int e( c_diffs.size()); // invariant of the following loop: // forall 0 <= a < b: c_diffs[a] is infeasible AND // forall e <= a < c_diffs.size(): c_diffs[a] is feasible while ( e > b) { int c = ( e + b) >> 1; if ( pierce_it( c_diffs[c])) { // c_diffs[c] is feasible e = c; } else { // c_diffs[c] is infeasible b = c + 1; } } // while ( e > b) CGAL_assertion( e == b); // return the result: r = c_diffs[e]; OutputIterator o_return( pierce_it( r, o, ok)); CGAL_assertion( ok); return o_return; } // rectangular_p_center_2_binary_search( ... ) */ template < class RandomAccessIC, class OutputIterator, class PiercingFunction, class Traits, class MatrixOperator > OutputIterator rectangular_p_center_2_matrix_search( RandomAccessIC f, RandomAccessIC l, OutputIterator o, typename Traits::FT& r, PiercingFunction pf, const Traits& t, const MatrixOperator& mop) { std::size_t number_of_points( iterator_distance( f, l)); CGAL_precondition( number_of_points > 0); using std::minus; using std::sort; // typedefs: typedef typename Traits::FT FT; typedef std::vector< FT > FT_cont; typedef typename FT_cont::iterator FT_iterator; typedef Cartesian_matrix_horizontally_flipped< MatrixOperator, FT_iterator, FT_iterator > Matrix; typedef std::vector< Matrix > MatrixContainer; typedef Rectangular_p_center_matrix_search_traits_2< Traits, PiercingFunction > MSTraits; typedef Sorted_matrix_search_traits_adaptor< MSTraits&, Matrix > Matrix_search_traits; // create Traits object: MSTraits pierce_it(f, l, t, pf); // check, if input data is trivial bool ok; OutputIterator oi = pierce_it(FT(0), o, ok); if (ok) { r = 0; return oi; } // create matrix search traits: Matrix_search_traits search_it(pierce_it); // copy x and y coordinates from [f,l): std::vector< FT > x_coords; std::vector< FT > y_coords; x_coords.reserve( number_of_points); y_coords.reserve( number_of_points); for ( RandomAccessIC p( f); p != l; ++p) { x_coords.push_back(p->x()); y_coords.push_back(p->y()); } // sort coordinates: sort( x_coords.begin(), x_coords.end()); sort( y_coords.begin(), y_coords.end()); // create matrices: MatrixContainer matrices; // create matrix of x-differences: matrices.push_back( Matrix( x_coords.begin(), x_coords.end(), x_coords.begin(), x_coords.end(), mop)); // create matrix of y-differences: matrices.push_back( Matrix( y_coords.begin(), y_coords.end(), y_coords.begin(), y_coords.end(), mop)); // do the actual search: r = sorted_matrix_search(matrices.begin(), matrices.end(), search_it); // return result: OutputIterator o_return(pierce_it(r, o, ok)); CGAL_assertion(ok); return o_return; } // P_center_matrix_search template < class RandomAccessIC, class OutputIterator, class PiercingFunction, class Traits > inline OutputIterator rectangular_p_center_2_matrix_search( RandomAccessIC f, RandomAccessIC l, OutputIterator o, typename Traits::FT& r, const PiercingFunction& pf, const Traits& t) { typedef typename Traits::FT FT; return rectangular_p_center_2_matrix_search( f, l, o, r, pf, t, std::function( [](const FT& a, const FT& b) { return Max()(0, std::minus()(a,b)); } )); } // Pcenter_matrix_search( ... ) template < class ForwardIterator, class OutputIterator, class FT > inline OutputIterator rectangular_p_center_matrix_search_2( ForwardIterator f, ForwardIterator l, OutputIterator o, FT& r, int p) { CGAL_precondition(p >= 2 && p < 5); typename std::iterator_traits::value_type::R t; if (p == 2) return rectangular_p_center_2_matrix_search( f, l, o, r, Two_covering_algorithm(), t); else if (p == 3) return rectangular_p_center_2_matrix_search( f, l, o, r, Three_covering_algorithm(), t); return rectangular_p_center_2_matrix_search( f, l, o, r, Four_covering_algorithm(), t); } // rectangular_p_center_matrix_search_2(f, l, o, r, p) namespace internal{ template bool is_distance_greater_than_p ( Iterator begin,Iterator end, typename std::iterator_traits::difference_type p, std::random_access_iterator_tag) { return std::distance(begin,end) > p; } template bool is_distance_greater_than_p ( Iterator begin,Iterator end, typename std::iterator_traits::difference_type p, std::forward_iterator_tag) { Iterator it=begin; while(p!=0){ if (it==end) return false; ++it; --p; } if (it!=end) return true; return false; } template bool is_distance_greater_than_p (Iterator begin,Iterator end, typename std::iterator_traits::difference_type p) { return is_distance_greater_than_p(begin,end,p, typename std::iterator_traits::iterator_category()); } } //namespace internal template < class ForwardIterator, class OutputIterator, class Traits > inline OutputIterator rectangular_p_center_2(ForwardIterator f, ForwardIterator l, OutputIterator o, typename Traits::FT& r, int p, Traits& t) { CGAL_precondition(p >= 2 && p < 5); r=0; if ( !internal::is_distance_greater_than_p(f,l,p) ) return std::copy(f,l,o); if (p == 2) return rectangular_2_center_2(f, l, o, r, t); else if (p == 3) return rectangular_3_center_2(f, l, o, r, t); return rectangular_p_center_2_matrix_search( f, l, o, r, Four_covering_algorithm(), t); } // rectangular_p_center_2( ... ) template < class ForwardIterator, class OutputIterator, class FT > inline OutputIterator rectangular_p_center_2(ForwardIterator f, ForwardIterator l, OutputIterator o, FT& r, int p) { CGAL_precondition(p >= 2 && p < 5); typedef typename std::iterator_traits< ForwardIterator >::value_type::R R; Rectangular_p_center_default_traits_2< R > t; return rectangular_p_center_2(f, l, o, r, p, t); } // rectangular_p_center_2( ... ) } //namespace CGAL #endif // ! (CGAL_RECTANGULAR_P_CENTER_2_H)