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) Marshall Clow 2008-2012. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Revision history: 28 Sep 2015 mtc First version */ /// \file sort_subrange.hpp /// \brief Sort a subrange /// \author Marshall Clow /// /// Suggested by Sean Parent in his CppCon 2015 keynote #ifndef BOOST_ALGORITHM_SORT_SUBRANGE_HPP #define BOOST_ALGORITHM_SORT_SUBRANGE_HPP #include // For std::less #include // For std::iterator_traits #include // For nth_element and partial_sort #include #include #include namespace boost { namespace algorithm { /// \fn sort_subrange ( T const& val, /// Iterator first, Iterator last, /// Iterator sub_first, Iterator sub_last, /// Pred p ) /// \brief Sort the subrange [sub_first, sub_last) that is inside /// the range [first, last) as if you had sorted the entire range. /// /// \param first The start of the larger range /// \param last The end of the larger range /// \param sub_first The start of the sub range /// \param sub_last The end of the sub range /// \param p A predicate to use to compare the values. /// p ( a, b ) returns a boolean. /// template void sort_subrange ( Iterator first, Iterator last, Iterator sub_first, Iterator sub_last, Pred p) { if (sub_first == sub_last) return; // the empty sub-range is already sorted. if (sub_first != first) { // sub-range is at the start, don't need to partition (void) std::nth_element(first, sub_first, last, p); ++sub_first; } std::partial_sort(sub_first, sub_last, last, p); } template void sort_subrange (Iterator first, Iterator last, Iterator sub_first, Iterator sub_last) { typedef typename std::iterator_traits::value_type value_type; return sort_subrange(first, last, sub_first, sub_last, std::less()); } /// range versions? /// \fn partition_subrange ( T const& val, /// Iterator first, Iterator last, /// Iterator sub_first, Iterator sub_last, /// Pred p ) /// \brief Gather the elements of the subrange [sub_first, sub_last) that is /// inside the range [first, last) as if you had sorted the entire range. /// /// \param first The start of the larger range /// \param last The end of the larger range /// \param sub_first The start of the sub range /// \param sub_last The end of the sub range /// \param p A predicate to use to compare the values. /// p ( a, b ) returns a boolean. /// template void partition_subrange ( Iterator first, Iterator last, Iterator sub_first, Iterator sub_last, Pred p) { if (sub_first != first) { (void) std::nth_element(first, sub_first, last, p); ++sub_first; } if (sub_last != last) (void) std::nth_element(sub_first, sub_last, last, p); } template void partition_subrange (Iterator first, Iterator last, Iterator sub_first, Iterator sub_last) { typedef typename std::iterator_traits::value_type value_type; return partition_subrange(first, last, sub_first, sub_last, std::less()); } }} #endif // BOOST_ALGORITHM_SORT_SUBRANGE_HPP