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) 2013 Kyle Lutz // // 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 // // See http://boostorg.github.com/compute for more information. //---------------------------------------------------------------------------// #ifndef BOOST_COMPUTE_ALGORITHM_SORT_HPP #define BOOST_COMPUTE_ALGORITHM_SORT_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace compute { namespace detail { template inline void dispatch_gpu_sort(buffer_iterator first, buffer_iterator last, less, command_queue &queue, typename boost::enable_if_c< is_radix_sortable::value >::type* = 0) { size_t count = detail::iterator_range_size(first, last); if(count < 2){ // nothing to do return; } else if(count <= 32){ ::boost::compute::detail::serial_insertion_sort(first, last, queue); } else { ::boost::compute::detail::radix_sort(first, last, queue); } } template inline void dispatch_gpu_sort(buffer_iterator first, buffer_iterator last, greater compare, command_queue &queue, typename boost::enable_if_c< is_radix_sortable::value >::type* = 0) { size_t count = detail::iterator_range_size(first, last); if(count < 2){ // nothing to do return; } else if(count <= 32){ ::boost::compute::detail::serial_insertion_sort( first, last, compare, queue ); } else { // radix sorts in descending order ::boost::compute::detail::radix_sort(first, last, false, queue); } } template inline void dispatch_gpu_sort(Iterator first, Iterator last, Compare compare, command_queue &queue) { size_t count = detail::iterator_range_size(first, last); if(count < 2){ // nothing to do return; } else if(count <= 32){ ::boost::compute::detail::serial_insertion_sort( first, last, compare, queue ); } else { ::boost::compute::detail::merge_sort_on_gpu( first, last, compare, queue ); } } // sort() for device iterators template inline void dispatch_sort(Iterator first, Iterator last, Compare compare, command_queue &queue, typename boost::enable_if< is_device_iterator >::type* = 0) { if(queue.get_device().type() & device::gpu) { dispatch_gpu_sort(first, last, compare, queue); return; } ::boost::compute::detail::merge_sort_on_cpu(first, last, compare, queue); } // sort() for host iterators template inline void dispatch_sort(Iterator first, Iterator last, Compare compare, command_queue &queue, typename boost::disable_if< is_device_iterator >::type* = 0) { typedef typename std::iterator_traits::value_type T; size_t size = static_cast(std::distance(first, last)); // create mapped buffer mapped_view view( boost::addressof(*first), size, queue.get_context() ); // sort mapped buffer dispatch_sort(view.begin(), view.end(), compare, queue); // return results to host view.map(queue); } } // end detail namespace /// Sorts the values in the range [\p first, \p last) according to /// \p compare. /// /// \param first first element in the range to sort /// \param last last element in the range to sort /// \param compare comparison function (by default \c less) /// \param queue command queue to perform the operation /// /// For example, to sort a vector on the device: /// \code /// // create vector on the device with data /// float data[] = { 2.f, 4.f, 1.f, 3.f }; /// boost::compute::vector vec(data, data + 4, queue); /// /// // sort the vector on the device /// boost::compute::sort(vec.begin(), vec.end(), queue); /// \endcode /// /// The sort() algorithm can also be directly used with host iterators. This /// example will automatically transfer the data to the device, sort it, and /// then transfer the data back to the host: /// \code /// std::vector data = { 9, 3, 2, 5, 1, 4, 6, 7 }; /// /// boost::compute::sort(data.begin(), data.end(), queue); /// \endcode /// /// Space complexity: \Omega(n) /// /// \see is_sorted() template inline void sort(Iterator first, Iterator last, Compare compare, command_queue &queue = system::default_queue()) { ::boost::compute::detail::dispatch_sort(first, last, compare, queue); } /// \overload template inline void sort(Iterator first, Iterator last, command_queue &queue = system::default_queue()) { typedef typename std::iterator_traits::value_type value_type; ::boost::compute::sort( first, last, ::boost::compute::less(), queue ); } } // end compute namespace } // end boost namespace #endif // BOOST_COMPUTE_ALGORITHM_SORT_HPP