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
//Templated Spreadsort-based implementation of integer_sort // Copyright Steven J. Ross 2001 - 2014. // 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://www.boost.org/libs/sort/ for library home page. /* Some improvements suggested by: Phil Endecott and Frank Gennari Doxygen comments by Paul A. Bristow Jan 2015 */ #ifndef BOOST_INTEGER_SORT_HPP #define BOOST_INTEGER_SORT_HPP #include #include #include #include #include #include #include #include #include namespace boost { namespace sort { namespace spreadsort { //Top-level sorting call for integers. /*! \brief Integer sort algorithm using random access iterators. (All variants fall back to @c boost::sort::pdqsort if the data size is too small, < @c detail::min_sort_size). \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n Worst-case performance is O(N * (lg(range)/s + s)) , so @c integer_sort is asymptotically faster than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11, so its worst-case with default settings for 32-bit integers is O(N * ((32/11) slow radix-based iterations fast comparison-based iterations).\n\n Some performance plots of runtime vs. n and log(range) are provided:\n windows_integer_sort \n osx_integer_sort \param[in] first Iterator pointer to first element. \param[in] last Iterator pointing to one beyond the end of data. \pre [@c first, @c last) is a valid range. \pre @c RandomAccessIter @c value_type is mutable. \pre @c RandomAccessIter @c value_type is LessThanComparable \pre @c RandomAccessIter @c value_type supports the @c operator>>, which returns an integer-type right-shifted a specified number of bits. \post The elements in the range [@c first, @c last) are sorted in ascending order. \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw. \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. \warning Invalid arguments cause undefined behaviour. \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming. \remark The lesser of O(N*log(N)) comparisons and O(N*log(K/S + S)) operations worst-case, where: \remark * N is @c last - @c first, \remark * K is the log of the range in bits (32 for 32-bit integers using their full range), \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). */ template inline void integer_sort(RandomAccessIter first, RandomAccessIter last) { // Don't sort if it's too small to optimize. if (last - first < detail::min_sort_size) boost::sort::pdqsort(first, last); else detail::integer_sort(first, last, *first >> 0); } /*! \brief Integer sort algorithm using range. (All variants fall back to @c boost::sort::pdqsort if the data size is too small, < @c detail::min_sort_size). \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n Worst-case performance is O(N * (lg(range)/s + s)) , so @c integer_sort is asymptotically faster than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11, so its worst-case with default settings for 32-bit integers is O(N * ((32/11) slow radix-based iterations fast comparison-based iterations).\n\n Some performance plots of runtime vs. n and log(range) are provided:\n windows_integer_sort \n osx_integer_sort \param[in] range Range [first, last) for sorting. \pre [@c first, @c last) is a valid range. \post The elements in the range [@c first, @c last) are sorted in ascending order. \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw. \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. \warning Invalid arguments cause undefined behaviour. \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming. \remark The lesser of O(N*log(N)) comparisons and O(N*log(K/S + S)) operations worst-case, where: \remark * N is @c last - @c first, \remark * K is the log of the range in bits (32 for 32-bit integers using their full range), \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). */ template inline void integer_sort(Range& range) { integer_sort(boost::begin(range), boost::end(range)); } /*! \brief Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator. (All variants fall back to @c boost::sort::pdqsort if the data size is too small, < @c detail::min_sort_size). \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n Worst-case performance is O(N * (lg(range)/s + s)) , so @c integer_sort is asymptotically faster than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11, so its worst-case with default settings for 32-bit integers is O(N * ((32/11) slow radix-based iterations fast comparison-based iterations).\n\n Some performance plots of runtime vs. n and log(range) are provided:\n windows_integer_sort \n osx_integer_sort \param[in] first Iterator pointer to first element. \param[in] last Iterator pointing to one beyond the end of data. \param[in] shift Functor that returns the result of shifting the value_type right a specified number of bits. \param[in] comp A binary functor that returns whether the first element passed to it should go before the second in order. \pre [@c first, @c last) is a valid range. \pre @c RandomAccessIter @c value_type is mutable. \post The elements in the range [@c first, @c last) are sorted in ascending order. \return @c void. \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw. \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. \warning Invalid arguments cause undefined behaviour. \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming. \remark The lesser of O(N*log(N)) comparisons and O(N*log(K/S + S)) operations worst-case, where: \remark * N is @c last - @c first, \remark * K is the log of the range in bits (32 for 32-bit integers using their full range), \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). */ template inline void integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift, Compare comp) { if (last - first < detail::min_sort_size) boost::sort::pdqsort(first, last, comp); else detail::integer_sort(first, last, shift(*first, 0), shift, comp); } /*! \brief Integer sort algorithm using range with both right-shift and user-defined comparison operator. (All variants fall back to @c boost::sort::pdqsort if the data size is too small, < @c detail::min_sort_size). \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n Worst-case performance is O(N * (lg(range)/s + s)) , so @c integer_sort is asymptotically faster than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11, so its worst-case with default settings for 32-bit integers is O(N * ((32/11) slow radix-based iterations fast comparison-based iterations).\n\n Some performance plots of runtime vs. n and log(range) are provided:\n windows_integer_sort \n osx_integer_sort \param[in] range Range [first, last) for sorting. \param[in] shift Functor that returns the result of shifting the value_type right a specified number of bits. \param[in] comp A binary functor that returns whether the first element passed to it should go before the second in order. \pre [@c first, @c last) is a valid range. \post The elements in the range [@c first, @c last) are sorted in ascending order. \return @c void. \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw. \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. \warning Invalid arguments cause undefined behaviour. \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming. \remark The lesser of O(N*log(N)) comparisons and O(N*log(K/S + S)) operations worst-case, where: \remark * N is @c last - @c first, \remark * K is the log of the range in bits (32 for 32-bit integers using their full range), \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). */ template inline void integer_sort(Range& range, Right_shift shift, Compare comp) { integer_sort(boost::begin(range), boost::end(range), shift, comp); } /*! \brief Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to @c boost::sort::pdqsort if the data size is too small, < @c detail::min_sort_size). \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n \par Performance: Worst-case performance is O(N * (lg(range)/s + s)) , so @c integer_sort is asymptotically faster than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11, so its worst-case with default settings for 32-bit integers is O(N * ((32/11) slow radix-based iterations fast comparison-based iterations).\n\n Some performance plots of runtime vs. n and log(range) are provided:\n * windows_integer_sort\n * osx_integer_sort \param[in] first Iterator pointer to first element. \param[in] last Iterator pointing to one beyond the end of data. \param[in] shift A functor that returns the result of shifting the value_type right a specified number of bits. \pre [@c first, @c last) is a valid range. \pre @c RandomAccessIter @c value_type is mutable. \pre @c RandomAccessIter @c value_type is LessThanComparable \post The elements in the range [@c first, @c last) are sorted in ascending order. \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw. \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. \warning Invalid arguments cause undefined behaviour. \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming. \remark The lesser of O(N*log(N)) comparisons and O(N*log(K/S + S)) operations worst-case, where: \remark * N is @c last - @c first, \remark * K is the log of the range in bits (32 for 32-bit integers using their full range), \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). */ template inline void integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift) { if (last - first < detail::min_sort_size) boost::sort::pdqsort(first, last); else detail::integer_sort(first, last, shift(*first, 0), shift); } /*! \brief Integer sort algorithm using range with just right-shift functor. (All variants fall back to @c boost::sort::pdqsort if the data size is too small, < @c detail::min_sort_size). \details @c integer_sort is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than @c std::sort for large tests (>=100kB).\n \par Performance: Worst-case performance is O(N * (lg(range)/s + s)) , so @c integer_sort is asymptotically faster than pure comparison-based algorithms. @c s is @c max_splits, which defaults to 11, so its worst-case with default settings for 32-bit integers is O(N * ((32/11) slow radix-based iterations fast comparison-based iterations).\n\n Some performance plots of runtime vs. n and log(range) are provided:\n * windows_integer_sort\n * osx_integer_sort \param[in] range Range [first, last) for sorting. \param[in] shift A functor that returns the result of shifting the value_type right a specified number of bits. \pre [@c first, @c last) is a valid range. \post The elements in the range [@c first, @c last) are sorted in ascending order. \throws std::exception Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw. \warning Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. \warning Invalid arguments cause undefined behaviour. \note @c spreadsort function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming. \remark The lesser of O(N*log(N)) comparisons and O(N*log(K/S + S)) operations worst-case, where: \remark * N is @c last - @c first, \remark * K is the log of the range in bits (32 for 32-bit integers using their full range), \remark * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). */ template inline void integer_sort(Range& range, Right_shift shift) { integer_sort(boost::begin(range), boost::end(range), shift); } } } } #endif