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 sort_basic.hpp /// @brief Spin Sort algorithm /// /// @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_COMMON_SORT_BASIC_HPP #define __BOOST_SORT_COMMON_SORT_BASIC_HPP #include #include #include #include #include #include #include #include #include #include namespace boost { namespace sort { namespace common { //---------------------------------------------------------------------------- // USING SENTENCES //---------------------------------------------------------------------------- using boost::sort::insert_sort; //----------------------------------------------------------------------------- // function : is_stable_sorted_forward /// @brief examine the elements in the range first, last if they are stable /// sorted, and return an iterator to the first element not sorted /// @param first : iterator to the first element in the range /// @param last : ierator after the last element of the range /// @param comp : object for to compare two elements /// @return iterator to the first element not stable sorted. The number of /// elements sorted is the iterator returned minus first //----------------------------------------------------------------------------- template > > inline Iter_t is_stable_sorted_forward (Iter_t first, Iter_t last, Compare comp = Compare()) { #ifdef __BS_DEBUG assert ( (last- first) >= 0); #endif if ((last - first) < 2) return first; Iter_t it2 = first + 1; for (Iter_t it1 = first; it2 != last && ! comp(*it2, *it1); it1 = it2++); return it2; } //----------------------------------------------------------------------------- // function : is_reverse_stable_sorted_forward /// @brief examine the elements in the range first, last if they are reverse /// stable sorted, and return an iterator to the first element not /// reverse stable sorted /// @param first : iterator to the first element in the range /// @param last : ierator after the last element of the range /// @param comp : object for to compare two elements /// @return iterator to the first element not reverse stable sorted. The number /// of elements sorted is the iterator returned minus first //----------------------------------------------------------------------------- template > > inline Iter_t is_reverse_stable_sorted_forward(Iter_t first, Iter_t last, Compare comp = Compare()) { #ifdef __BS_DEBUG assert ( (last- first) >= 0); #endif if ((last - first) < 2) return first; Iter_t it2 = first + 1; for (Iter_t it1 = first; it2 != last && comp(*it2, *it1); it1 = it2++); return it2; } //----------------------------------------------------------------------------- // function : number_stable_sorted_forward /// @brief examine the elements in the range first, last if they are stable /// sorted, and return the number of elements sorted /// @param first : iterator to the first element in the range /// @param last : ierator after the last element of the range /// @param comp : object for to compare two elements /// @param min_process : minimal number of elements to be consideer /// @return number of element sorted. I f the number is lower than min_process /// return 0 //----------------------------------------------------------------------------- template > > size_t number_stable_sorted_forward (Iter_t first, Iter_t last, size_t min_process, Compare comp = Compare()) { #ifdef __BS_DEBUG assert ( (last- first) >= 0); #endif if ((last - first) < 2) return 0; // sorted elements Iter_t it2 = first + 1; for (Iter_t it1 = first; it2 != last && ! comp(*it2, *it1); it1 = it2++); size_t nsorted = size_t ( it2 - first); if ( nsorted != 1) return (nsorted >= min_process) ? nsorted: 0; // reverse sorted elements it2 = first + 1; for (Iter_t it1 = first; it2 != last && comp(*it2, *it1); it1 = it2++); nsorted = size_t ( it2 - first); if ( nsorted < min_process) return 0 ; util::reverse ( first , it2); return nsorted; } //----------------------------------------------------------------------------- // function : is_stable_sorted_backward /// @brief examine the elements in the range first, last beginning at end, and /// if they are stablesorted, and return an iterator to the last element /// sorted /// @param first : iterator to the first element in the range /// @param last : ierator after the last element of the range /// @param comp : object for to compare two elements /// @return iterator to the last element stable sorted. The number of /// elements sorted is the last minus the iterator returned //----------------------------------------------------------------------------- template > > inline Iter_t is_stable_sorted_backward(Iter_t first, Iter_t last, Compare comp = Compare()) { #ifdef __BS_DEBUG assert ( (last- first) >= 0); #endif if ((last - first) < 2) return first; Iter_t itaux = last - 1; while (itaux != first && ! comp(*itaux, *(itaux - 1))) {--itaux; }; return itaux; } //----------------------------------------------------------------------------- // function : is_reverse_stable_sorted_backward /// @brief examine the elements in the range first, last beginning at end, and /// if they are stablesorted, and return an iterator to the last element /// sorted /// @param first : iterator to the first element in the range /// @param last : ierator after the last element of the range /// @param comp : object for to compare two elements /// @return iterator to the last element stable sorted. The number of /// elements sorted is the last minus the iterator returned //----------------------------------------------------------------------------- template > > inline Iter_t is_reverse_stable_sorted_backward (Iter_t first, Iter_t last, Compare comp = Compare()) { #ifdef __BS_DEBUG assert ( (last- first) >= 0); #endif if ((last - first) < 2) return first; Iter_t itaux = last - 1; for (; itaux != first && comp(*itaux, *(itaux - 1)); --itaux); return itaux; } //----------------------------------------------------------------------------- // function : number_stable_sorted_backward /// @brief examine the elements in the range first, last if they are stable /// sorted, and return the number of elements sorted /// @param first : iterator to the first element in the range /// @param last : ierator after the last element of the range /// @param comp : object for to compare two elements /// @param min_process : minimal number of elements to be consideer /// @return number of element sorted. I f the number is lower than min_process /// return 0 //----------------------------------------------------------------------------- template > > size_t number_stable_sorted_backward (Iter_t first, Iter_t last, size_t min_process, Compare comp = Compare()) { #ifdef __BS_DEBUG assert ( (last- first) >= 0); #endif if ((last - first) < 2) return 0; Iter_t itaux = last - 1; while (itaux != first && ! comp(*itaux, *(itaux - 1))) {--itaux; }; size_t nsorted = size_t ( last - itaux); if ( nsorted != 1) return ( nsorted >= min_process)?nsorted: 0 ; itaux = last - 1; for (; itaux != first && comp(*itaux, *(itaux - 1)); --itaux); nsorted = size_t ( last - itaux); if ( nsorted < min_process) return 0 ; util::reverse ( itaux, last ); return nsorted; } //----------------------------------------------------------------------------- // function : internal_sort /// @brief this function divide r_input in two parts, sort it,and merge moving /// the elements to range_buf /// @param range_input : range with the elements to sort /// @param range_buffer : range with the elements sorted /// @param comp : object for to compare two elements /// @param level : when is 1, sort with the insertionsort algorithm /// if not make a recursive call splitting the ranges // //----------------------------------------------------------------------------- template inline void internal_sort (const range &rng1, const range &rng2, Compare comp, uint32_t level, bool even = true) { //----------------------------------------------------------------------- // metaprogram //----------------------------------------------------------------------- typedef value_iter value_t; typedef value_iter value2_t; static_assert (std::is_same< value_t, value2_t>::value, "Incompatible iterators\n"); //----------------------------------------------------------------------- // program //----------------------------------------------------------------------- #ifdef __BS_DEBUG assert (rng1.size ( ) == rng2.size ( ) ); #endif size_t nelem = (rng1.size() + 1) >> 1; range rng1_left(rng1.first, rng1.first + nelem), rng1_right(rng1.first + nelem, rng1.last); range rng2_left(rng2.first, rng2.first + nelem), rng2_right(rng2.first + nelem, rng2.last); if (nelem <= 32 && (level & 1) == even) { insert_sort(rng1_left.first, rng1_left.last, comp); insert_sort(rng1_right.first, rng1_right.last, comp); } else { internal_sort(rng2_left, rng1_left, comp, level + 1, even); internal_sort(rng2_right, rng1_right, comp, level + 1, even); }; merge(rng2, rng1_left, rng1_right, comp); } //----------------------------------------------------------------------------- // function : range_sort_data /// @brief this sort elements using the range_sort function and receiving a /// buffer of initialized memory /// @param rng_data : range with the elements to sort /// @param rng_aux : range of at least the same memory than rng_data used as /// auxiliary memory in the sorting /// @param comp : object for to compare two elements //----------------------------------------------------------------------------- template static void range_sort_data (const range & rng_data, const range & rng_aux, Compare comp) { //----------------------------------------------------------------------- // metaprogram //----------------------------------------------------------------------- typedef value_iter value_t; typedef value_iter value2_t; static_assert (std::is_same< value_t, value2_t>::value, "Incompatible iterators\n"); //------------------------------------------------------------------------ // program //------------------------------------------------------------------------ #ifdef __BS_DEBUG assert ( rng_data.size() == rng_aux.size()); #endif // minimal number of element before to jump to insertionsort const uint32_t sort_min = 32; if (rng_data.size() <= sort_min) { insert_sort(rng_data.first, rng_data.last, comp); return; }; internal_sort(rng_aux, rng_data, comp, 0, true); } //----------------------------------------------------------------------------- // function : range_sort_buffer /// @brief this sort elements using the range_sort function and receiving a /// buffer of initialized memory /// @param rng_data : range with the elements to sort /// @param rng_aux : range of at least the same memory than rng_data used as /// auxiliary memory in the sorting /// @param comp : object for to compare two elements //----------------------------------------------------------------------------- template static void range_sort_buffer(const range & rng_data, const range & rng_aux, Compare comp) { //----------------------------------------------------------------------- // metaprogram //----------------------------------------------------------------------- typedef value_iter value_t; typedef value_iter value2_t; static_assert (std::is_same< value_t, value2_t>::value, "Incompatible iterators\n"); //------------------------------------------------------------------------ // program //------------------------------------------------------------------------ #ifdef __BS_DEBUG assert ( rng_data.size() == rng_aux.size()); #endif // minimal number of element before to jump to insertionsort const uint32_t sort_min = 32; if (rng_data.size() <= sort_min) { insert_sort(rng_data.first, rng_data.last, comp); move_forward(rng_aux, rng_data); return; }; internal_sort(rng_data, rng_aux, comp, 0, false); } //**************************************************************************** }// End namespace common }// End namespace sort }// End namepspace boost //**************************************************************************** // #endif