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-2014 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_ADJACENT_FIND_HPP #define BOOST_COMPUTE_ALGORITHM_ADJACENT_FIND_HPP #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace compute { namespace detail { template inline InputIterator serial_adjacent_find(InputIterator first, InputIterator last, Compare compare, command_queue &queue) { if(first == last){ return last; } const context &context = queue.get_context(); detail::scalar output(context); detail::meta_kernel k("serial_adjacent_find"); size_t size_arg = k.add_arg("size"); size_t output_arg = k.add_arg(memory_object::global_memory, "output"); k << k.decl("result") << " = size;\n" << "for(uint i = 0; i < size - 1; i++){\n" << " if(" << compare(first[k.expr("i")], first[k.expr("i+1")]) << "){\n" << " result = i;\n" << " break;\n" << " }\n" << "}\n" << "*output = result;\n"; k.set_arg( size_arg, static_cast(detail::iterator_range_size(first, last)) ); k.set_arg(output_arg, output.get_buffer()); k.exec_1d(queue, 0, 1, 1); return first + output.read(queue); } template inline InputIterator adjacent_find_with_atomics(InputIterator first, InputIterator last, Compare compare, command_queue &queue) { if(first == last){ return last; } const context &context = queue.get_context(); size_t count = detail::iterator_range_size(first, last); // initialize output to the last index detail::scalar output(context); output.write(static_cast(count), queue); detail::meta_kernel k("adjacent_find_with_atomics"); size_t output_arg = k.add_arg(memory_object::global_memory, "output"); k << "const uint i = get_global_id(0);\n" << "if(" << compare(first[k.expr("i")], first[k.expr("i+1")]) << "){\n" << " atomic_min(output, i);\n" << "}\n"; k.set_arg(output_arg, output.get_buffer()); k.exec_1d(queue, 0, count - 1, 1); return first + output.read(queue); } } // end detail namespace /// Searches the range [\p first, \p last) for two identical adjacent /// elements and returns an iterator pointing to the first. /// /// \param first first element in the range to search /// \param last last element in the range to search /// \param compare binary comparison function /// \param queue command queue to perform the operation /// /// \return \c InputIteratorm to the first element which compares equal /// to the following element. If none are equal, returns \c last. /// /// Space complexity: \Omega(1) /// /// \see find(), adjacent_difference() template inline InputIterator adjacent_find(InputIterator first, InputIterator last, Compare compare, command_queue &queue = system::default_queue()) { BOOST_STATIC_ASSERT(is_device_iterator::value); size_t count = detail::iterator_range_size(first, last); if(count < 32){ return detail::serial_adjacent_find(first, last, compare, queue); } else { return detail::adjacent_find_with_atomics(first, last, compare, queue); } } /// \overload template inline InputIterator adjacent_find(InputIterator first, InputIterator last, command_queue &queue = system::default_queue()) { BOOST_STATIC_ASSERT(is_device_iterator::value); typedef typename std::iterator_traits::value_type value_type; using ::boost::compute::lambda::_1; using ::boost::compute::lambda::_2; using ::boost::compute::lambda::all; if(vector_size::value == 1){ return ::boost::compute::adjacent_find( first, last, _1 == _2, queue ); } else { return ::boost::compute::adjacent_find( first, last, all(_1 == _2), queue ); } } } // end compute namespace } // end boost namespace #endif // BOOST_COMPUTE_ALGORITHM_ADJACENT_FIND_HPP