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 indirect.hpp /// @brief Indirect algorithm /// /// @author Copyright (c) 2016 Francisco Jose 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_COMMON_INDIRECT_HPP #define __BOOST_SORT_PARALLEL_COMMON_INDIRECT_HPP #include #include #include #include #include namespace boost { namespace sort { namespace common { // //--------------------------------------------------------------------------- /// @struct less_ptr_no_null /// /// @remarks this is the comparison object for pointers. Compare the objects /// pointed by the iterators //--------------------------------------------------------------------------- template > struct less_ptr_no_null { //----------------------------- Variables ----------------------- Compare comp; // comparison object of the elements pointed by Iter_t //------------------------------------------------------------------------ // function : less_ptr_no_null /// @brief constructor from a Compare object /// @param C1 : comparison object //----------------------------------------------------------------------- less_ptr_no_null(Compare C1 = Compare()): comp(C1) { }; //------------------------------------------------------------------------ // function : operator ( ) /// @brief Make the comparison of the objects pointed by T1 and T2, using // the internal comp // /// @param T1 : first iterator /// @param T2 : second iterator /// @return bool result of the comparison //----------------------------------------------------------------------- bool operator( )(Iter_t T1, Iter_t T2) const { return comp(*T1, *T2); }; }; // //----------------------------------------------------------------------------- // function : create_index /// @brief From a vector of objects, create a vector of iterators to /// the objects /// /// @param first : iterator to the first element of the range /// @param last : iterator to the element after the last of the range /// @param index : vector where store the iterators //----------------------------------------------------------------------------- template void create_index(Iter_t first, Iter_t last, std::vector &index) { auto nelem = last - first; assert(nelem >= 0); index.clear(); index.reserve(nelem); for (; first != last; ++first) index.push_back(first); } // //----------------------------------------------------------------------------- // function : sort_index /// @brief This function transform a logical sort of the elements in the index /// in a physical sort // /// @param global_first : iterator to the first element of the data /// @param [in] index : vector of the iterators //----------------------------------------------------------------------------- template void sort_index(Iter_t global_first, std::vector &index) { typedef util::value_iter value_t; size_t pos_dest = 0; size_t pos_src = 0; size_t pos_in_vector = 0; size_t nelem = index.size(); Iter_t it_dest, it_src; while (pos_in_vector < nelem) { while (pos_in_vector < nelem && (size_t(index[pos_in_vector] - global_first)) == pos_in_vector) { ++pos_in_vector; } if (pos_in_vector == nelem) return; pos_dest = pos_src = pos_in_vector; it_dest = global_first + pos_dest; value_t Aux = std::move(*it_dest); while ((pos_src = (size_t(index[pos_dest] - global_first))) != pos_in_vector) { index[pos_dest] = it_dest; it_src = global_first + pos_src; *it_dest = std::move(*it_src); it_dest = it_src; pos_dest = pos_src; } *it_dest = std::move(Aux); index[pos_dest] = it_dest; ++pos_in_vector; } } template > void indirect_sort(func method, Iter_t first, Iter_t last, Compare comp) { auto nelem = (last - first); assert(nelem >= 0); if (nelem < 2) return; std::vector index; index.reserve((size_t) nelem); create_index(first, last, index); less_ptr_no_null index_comp(comp); method(index.begin(), index.end(), index_comp); sort_index(first, index); } // //**************************************************************************** }// End namespace common }// End namespace sort }// End namespace boost //**************************************************************************** // #endif