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
//---------------------------------------------------------------------------- /// @file merge_four.hpp /// @brief This file have the functions for to merge 4 buffers /// /// @author Copyright (c) 2016 Francisco José Tapia (fjtapia@gmail.com )\n /// Distributed under the Boost Software License, Version 1.0.\n /// ( See accompanying file LICENSE_1_0.txt or copy at /// http://www.boost.org/LICENSE_1_0.txt ) /// @version 0.1 /// /// @remarks //----------------------------------------------------------------------------- #ifndef __BOOST_SORT_PARALLEL_DETAIL_UTIL_MERGE_FOUR_HPP #define __BOOST_SORT_PARALLEL_DETAIL_UTIL_MERGE_FOUR_HPP #include #include #include #include #include #include namespace boost { namespace sort { namespace common { // //############################################################################ // ## // F U S I O N O F ## // ## // F O U R E L E M E N T S R A N G E ## // ## //############################################################################ // //----------------------------------------------------------------------------- // function : less_range /// @brief Compare the elements pointed by it1 and it2, and if they /// are equals, compare their position, doing a stable comparison /// /// @param it1 : iterator to the first element /// @param pos1 : position of the object pointed by it1 /// @param it2 : iterator to the second element /// @param pos2 : position of the element pointed by it2 /// @param comp : comparison object /// @return result of the comparison //----------------------------------------------------------------------------- template > inline bool less_range(Iter_t it1, uint32_t pos1, Iter_t it2, uint32_t pos2, Compare comp = Compare()) { return (comp(*it1, *it2)) ? true : (pos2 < pos1) ? false : ! (comp(*it2, *it1)); } //----------------------------------------------------------------------------- // function : full_merge4 /// @brief Merge four ranges /// /// @param dest: range where move the elements merged. Their size must be /// greater or equal than the sum of the sizes of the ranges /// in vrange_input /// @param vrange_input : array of ranges to merge /// @param nrange_input : number of ranges in vrange_input /// @param comp : comparison object /// @return range with all the elements moved with the size adjusted //----------------------------------------------------------------------------- template range full_merge4(const range &rdest, range vrange_input[4], uint32_t nrange_input, Compare comp) { using std::swap; typedef range range1_t; typedef util::value_iter type1; typedef util::value_iter type2; static_assert (std::is_same< type1, type2 >::value, "Incompatible iterators\n"); size_t ndest = 0; uint32_t i = 0; while (i < nrange_input) { if (vrange_input[i].size() != 0) { ndest += vrange_input[i++].size(); } else { for (uint32_t k = i + 1; k < nrange_input; ++k) { vrange_input[k - 1] = vrange_input[k]; } --nrange_input; } } if (nrange_input == 0) return range1_t(rdest.first, rdest.first); if (nrange_input == 1) return move_forward(rdest, vrange_input[0]); if (nrange_input == 2) { return merge(rdest, vrange_input[0], vrange_input[1], comp); } //------------------------------------------------------------------------ // Initial sort //------------------------------------------------------------------------ uint32_t pos[4] = { 0, 1, 2, 3 }, npos = nrange_input; //----------------------------------------------------------------------- // thanks to Steven Ross by their suggestion about the optimal // sorting networks //----------------------------------------------------------------------- if (less_range(vrange_input[pos[1]].first, pos[1], vrange_input[pos[0]].first, pos[0], comp)) { swap(pos[0], pos[1]); } if (npos == 4 && less_range(vrange_input[pos[3]].first, pos[3], vrange_input[pos[2]].first, pos[2], comp)) { swap(pos[3], pos[2]); } if (less_range (vrange_input[pos[2]].first, pos[2], vrange_input[pos[0]].first, pos[0], comp)) { swap(pos[0], pos[2]); }; if (npos == 4 && less_range (vrange_input[pos[3]].first, pos[3], vrange_input[pos[1]].first, pos[1], comp)) { swap(pos[1], pos[3]); } if (less_range (vrange_input[pos[2]].first, pos[2], vrange_input[pos[1]].first, pos[1], comp)) { swap(pos[1], pos[2]); } Iter1_t it_dest = rdest.first; while (npos > 2) { *(it_dest++) = std::move(*(vrange_input[pos[0]].first++)); if (vrange_input[pos[0]].size() == 0) { pos[0] = pos[1]; pos[1] = pos[2]; pos[2] = pos[3]; --npos; } else { if (less_range(vrange_input[pos[1]].first, pos[1], vrange_input[pos[0]].first, pos[0], comp)) { swap(pos[0], pos[1]); if (less_range(vrange_input[pos[2]].first, pos[2], vrange_input[pos[1]].first, pos[1], comp)) { swap(pos[1], pos[2]); if (npos == 4 && less_range(vrange_input[pos[3]].first, pos[3], vrange_input[pos[2]].first, pos[2], comp)) { swap(pos[2], pos[3]); } } } } } range1_t raux1(rdest.first, it_dest), raux2(it_dest, rdest.last); if (pos[0] < pos[1]) { return concat(raux1,merge(raux2, vrange_input[pos[0]], vrange_input[pos[1]], comp)); } else { return concat(raux1, merge (raux2, vrange_input[pos[1]], vrange_input[pos[0]], comp)); } } //----------------------------------------------------------------------------- // function : uninit_full_merge4 /// @brief Merge four ranges and put the result in uninitialized memory /// /// @param dest: range where create and move the elements merged. Their /// size must be greater or equal than the sum of the sizes /// of the ranges in the array R /// @param vrange_input : array of ranges to merge /// @param nrange_input : number of ranges in vrange_input /// @param comp : comparison object /// @return range with all the elements move with the size adjusted //----------------------------------------------------------------------------- template range uninit_full_merge4(const range &dest, range vrange_input[4], uint32_t nrange_input, Compare comp) { using std::swap; typedef util::value_iter type1; static_assert (std::is_same< type1, Value_t >::value, "Incompatible iterators\n"); size_t ndest = 0; uint32_t i = 0; while (i < nrange_input) { if (vrange_input[i].size() != 0) { ndest += vrange_input[i++].size(); } else { for (uint32_t k = i + 1; k < nrange_input; ++k) { vrange_input[k - 1] = vrange_input[k]; }; --nrange_input; }; }; if (nrange_input == 0) return range(dest.first, dest.first); if (nrange_input == 1) return move_construct(dest, vrange_input[0]); if (nrange_input == 2) { return merge_construct(dest, vrange_input[0], vrange_input[1], comp); } //------------------------------------------------------------------------ // Initial sort //------------------------------------------------------------------------ uint32_t pos[4] = { 0, 1, 2, 3 }, npos = nrange_input; //----------------------------------------------------------------------- // thanks to Steven Ross by their suggestion about the optimal // sorting networks //----------------------------------------------------------------------- if (less_range(vrange_input[pos[1]].first, pos[1], vrange_input[pos[0]].first, pos[0], comp)) { swap(pos[0], pos[1]); }; if (npos == 4 && less_range(vrange_input[pos[3]].first, pos[3], vrange_input[pos[2]].first, pos[2], comp)) { swap(pos[3], pos[2]); }; if (less_range(vrange_input[pos[2]].first, pos[2], vrange_input[pos[0]].first, pos[0], comp)) { swap(pos[0], pos[2]); }; if (npos == 4 && less_range(vrange_input[pos[3]].first, pos[3], vrange_input[pos[1]].first, pos[1], comp)) { swap(pos[1], pos[3]); }; if (less_range(vrange_input[pos[2]].first, pos[2], vrange_input[pos[1]].first, pos[1], comp)) { swap(pos[1], pos[2]); }; Value_t *it_dest = dest.first; while (npos > 2) { util::construct_object(&(*(it_dest++)), std::move(*(vrange_input[pos[0]].first++))); if (vrange_input[pos[0]].size() == 0) { pos[0] = pos[1]; pos[1] = pos[2]; pos[2] = pos[3]; --npos; } else { if (less_range (vrange_input[pos[1]].first, pos[1], vrange_input[pos[0]].first, pos[0], comp)) { swap(pos[0], pos[1]); if (less_range (vrange_input[pos[2]].first, pos[2], vrange_input[pos[1]].first, pos[1], comp)) { swap(pos[1], pos[2]); if (npos == 4 && less_range(vrange_input[pos[3]].first, pos[3], vrange_input[pos[2]].first, pos[2], comp)) { swap(pos[2], pos[3]); }; }; }; }; }; // end while (npos > 2) range raux1(dest.first, it_dest), raux2(it_dest, dest.last); if (pos[0] < pos[1]) { return concat(raux1, merge_construct(raux2, vrange_input[pos[0]], vrange_input[pos[1]], comp)); } else { return concat(raux1, merge_construct(raux2, vrange_input[pos[1]], vrange_input[pos[0]], comp)); } } //**************************************************************************** }// End namespace common }// End namespace sort }// End namespace boost //**************************************************************************** // #endif