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 // Utrecht University (The Netherlands), // ETH Zurich (Switzerland), // INRIA Sophia-Antipolis (France), // Max-Planck-Institute Saarbruecken (Germany), // and 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/STL_Extension/include/CGAL/algorithm.h $ // $Id: include/CGAL/algorithm.h b26b07a1242 $ // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Michael Hoffmann // Lutz Kettner // Sylvain Pion #ifndef CGAL_ALGORITHM_H #define CGAL_ALGORITHM_H #include #include #include #include #include #include #include #include #include #include namespace CGAL { // Not documented template inline bool are_sorted(const T & a, const T & b, const T & c) { return a <= b && b <= c; } // Not documented template inline bool are_sorted(const T & a, const T & b, const T & c, Compare cmp) { return !cmp(b, a) && !cmp(c, b); } // Not documented template inline bool are_strictly_sorted(const T & a, const T & b, const T & c) { return a < b && b < c; } // Not documented template inline bool are_strictly_sorted(const T & a, const T & b, const T & c, Compare cmp) { return cmp(a, b) && cmp(b, c); } // Not documented // Checks that b is in the interval [min(a, c) , max(a, c)]. template inline bool are_ordered(const T & a, const T & b, const T & c) { const T& min = (CGAL::min)(a, c); const T& max = (CGAL::max)(a, c); return min <= b && b <= max; } // Not documented // Checks that b is in the interval [min(a, c) , max(a, c)]. template inline bool are_ordered(const T & a, const T & b, const T & c, Compare cmp) { const T& min = (std::min)(a, c, cmp); const T& max = (std::max)(a, c, cmp); return !cmp(b, min) && !cmp(max, b); } // Not documented // Checks that b is in the interval ]min(a, c) , max(a, c)[. template inline bool are_strictly_ordered(const T & a, const T & b, const T & c) { const T& min = (CGAL::min)(a, c); const T& max = (CGAL::max)(a, c); return min < b && b < max; } // Not documented // Checks that b is in the interval ]min(a, c) , max(a, c)[. template inline bool are_strictly_ordered(const T & a, const T & b, const T & c, Compare cmp) { const T& min = (std::min)(a, c, cmp); const T& max = (std::max)(a, c, cmp); return cmp(min, b) && cmp(b, max); } #ifndef CGAL_NO_DEPRECATED_CODE template CGAL_DEPRECATED inline ForwardIterator successor( ForwardIterator it ) { return ++it; } template CGAL_DEPRECATED inline BidirectionalIterator predecessor( BidirectionalIterator it ) { return --it; } #endif // CGAL_NO_DEPRECATED_CODE template < class ForwardIterator > std::pair< ForwardIterator, ForwardIterator > min_max_element(ForwardIterator first, ForwardIterator last) { typedef std::pair< ForwardIterator, ForwardIterator > FP; FP result(first, first); if (first != last) while (++first != last) { if (*first < *result.first) result.first = first; if (*result.second < *first) result.second = first; } return result; } template < class ForwardIterator, class CompareMin, class CompareMax > std::pair< ForwardIterator, ForwardIterator > min_max_element(ForwardIterator first, ForwardIterator last, CompareMin comp_min, CompareMax comp_max) { typedef std::pair< ForwardIterator, ForwardIterator > FP; FP result(first, first); if (first != last) while (++first != last) { if (comp_min(*first, *result.first)) result.first = first; if (comp_max(*result.second, *first)) result.second = first; } return result; } template < class ForwardIterator, class Predicate > ForwardIterator min_element_if(ForwardIterator first, ForwardIterator last, Predicate pred) { ForwardIterator result = first = std::find_if(first, last, pred); if (first != last) while (++first != last) if (*first < *result && pred(*first)) result = first; return result; } template < class ForwardIterator, class Compare, class Predicate > ForwardIterator min_element_if(ForwardIterator first, ForwardIterator last, Compare comp, Predicate pred) { ForwardIterator result = first = std::find_if(first, last, pred); if (first != last) while (++first != last) if (comp(*first, *result) && pred(*first)) result = first; return result; } template < class ForwardIterator, class Predicate > ForwardIterator max_element_if(ForwardIterator first, ForwardIterator last, Predicate pred) { ForwardIterator result = first = std::find_if(first, last, pred); if (first != last) while (++first != last) if (*result < *first && pred(*first)) result = first; return result; } template < class ForwardIterator, class Compare, class Predicate > ForwardIterator max_element_if(ForwardIterator first, ForwardIterator last, Compare comp, Predicate pred) { ForwardIterator result = first = std::find_if(first, last, pred); if (first != last) while (++first != last) if (comp(*result, *first) && pred(*first)) result = first; return result; } /*! \brief lexicographic comparison of the two ranges using the \a cmp function object. Compares the two ranges \c [first1,last1) and \c [first2,last2) lexicographically and returns one of the \c CGAL::Comparison_result enum values respectively: - \c CGAL::SMALLER - \c CGAL::EQUAL - \c CGAL::LARGER \pre The \c value_type of \a InputIterator1 must be convertible to the \c first_argument_type of \c BinaryFunction. The \c value_type of \a InputIterator2 must be convertible to the \c second_argument_type of \c BinaryFunction. The \c result_type of \c BinaryFunction must be convertible to \c CGAL::Comparison_result. */ template CGAL::Comparison_result lexicographical_compare_three_valued( InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, BinaryFunction cmp) { while ( first1 != last1 && first2 != last2) { CGAL::Comparison_result result = cmp( *first1, *first2); if ( result != CGAL::EQUAL) return result; ++first1; ++first2; } if ( first1 != last1) return CGAL::LARGER; if ( first2 != last2) return CGAL::SMALLER; return CGAL::EQUAL; } /*! \brief output iterator range to a stream, with separators The iterator range \c [first,beyond) is written to \c os (obeying CGAL I/O modes). Each element is bracketed by \c pre and \c post (default: empty string). Adjacent values are separated by \c sep (default: ", ", i.e. comma space). The stream \c os is returned in its new state after output. Example: 
    int a[] = {1, 2, 3};
    output_range(std::cout, a, a+3, ":", "(", ")");
produces \c (1):(2):(3) */ template std::ostream& output_range(std::ostream& os, InputIterator first, InputIterator beyond, const char* sep = ", ", const char* pre = "", const char* post = "") { InputIterator it = first; if (it != beyond) { os << pre << CGAL::IO::oformat(*it) << post; while (++it != beyond) os << sep << pre << CGAL::IO::oformat(*it) << post; } return os; } namespace cpp98 { // Reimplementation of std::random_shuffle, for the use of Spatial_sorting. // We want an implementation of random_shuffle that produces the same // result on all platforms, for a given seeded random generator. template void random_shuffle(RandomAccessIterator begin, RandomAccessIterator end, RandomGenerator& random) { if(begin == end) return; for(RandomAccessIterator it = begin + 1; it != end; ++it) { std::iter_swap( it, begin + random( (it - begin) + 1 ) ); // The +1 inside random is because random(N) gives numbers in the open // interval [0, N[ } } template void random_shuffle(RandomAccessIterator begin, RandomAccessIterator end) { typedef std::iterator_traits Iterator_traits; typedef typename Iterator_traits::difference_type Diff_t; boost::rand48 random; boost::random_number_generator rng(random); CGAL::cpp98::random_shuffle(begin,end, rng); } } // namespace cpp98 namespace internal { namespace algorithm { // Implementation of the algorithm described here: // https://en.wikipedia.org/w/index.php?title=Selection_algorithm&oldid=480099620#Partition-based_general_selection_algorithm template RandomAccessIterator partition(RandomAccessIterator left, RandomAccessIterator right, // points to the last element of the sequence RandomAccessIterator pivot_it, Compare& compare) { std::iter_swap(pivot_it, right); // move pivot to the right RandomAccessIterator result = left; for(RandomAccessIterator it = left; it != right; ++it) { if(compare(*it, *right)) { std::iter_swap(result, it); ++result; } } std::iter_swap(right, result); return result; } } // end namespace algorithm } // end namespace internal // Reimplementation of std::nth_element, for the use of Spatial_sorting. // We want an implementation of nth_element that produces the same result // on all platforms. template void nth_element(RandomAccessIterator left, RandomAccessIterator nth, RandomAccessIterator right, Compare& comp) { if(left == right) return; --right; // 'right' points to the last element of the sequence if(left == right) return; // exit if there is only one element while(true) { RandomAccessIterator pivot_it = left + ((right - left) / 2); RandomAccessIterator new_pivot_it = internal::algorithm::partition(left, right, pivot_it, comp); if(new_pivot_it == nth) return; if(nth < new_pivot_it) right = new_pivot_it - 1; else left = new_pivot_it + 1; } // end while(true) } // Not a standard function, but close enough template OutputIterator transform_n( InputIterator first, Size n, OutputIterator result, UnaryFun fun) { // copies the first `n' transformed items from `first' to `result'. // Returns the value of `result' after inserting the `n' items. while( n--) { *result = fun(*first); first++; result++; } return result; } } //namespace CGAL #endif // CGAL_ALGORITHM_H