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) 2020 T. Zachary Laine // // 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) #ifndef BOOST_PARSER_DETAIL_TEXT_ALGORITHM_HPP #define BOOST_PARSER_DETAIL_TEXT_ALGORITHM_HPP #include #include #include #include #include #include #include namespace boost::parser::detail { namespace text { namespace detail { template std::ptrdiff_t distance(Iter first, Iter last, non_sentinel_tag) { return std::distance(first, last); } template std::ptrdiff_t distance(Iter first, Sentinel last, sentinel_tag) { std::ptrdiff_t retval = 0; while (first != last) { ++retval; ++first; } return retval; } } /** Range-friendly version of `std::distance()`, taking an iterator and a sentinel. */ template std::ptrdiff_t distance(Iter first, Sentinel last) { return detail::distance( first, last, typename std::conditional< std::is_same::value, detail::non_sentinel_tag, detail::sentinel_tag>::type()); } /** Range-friendly version of `std::find()`, taking an iterator and a sentinel. */ template BidiIter find(BidiIter first, Sentinel last, T const & x) { while (first != last) { if (*first == x) return first; ++first; } return first; } /** A range-friendly compliment to `std::find()`; returns an iterator to the first element not equal to `x`. */ template BidiIter find_not(BidiIter first, Sentinel last, T const & x) { while (first != last) { if (*first != x) return first; ++first; } return first; } /** Range-friendly version of `std::find_if()`, taking an iterator and a sentinel. */ template BidiIter find_if(BidiIter first, Sentinel last, Pred p) { while (first != last) { if (p(*first)) return first; ++first; } return first; } /** Range-friendly version of `std::find_if_not()`, taking an iterator and a sentinel. */ template BidiIter find_if_not(BidiIter first, Sentinel last, Pred p) { while (first != last) { if (!p(*first)) return first; ++first; } return first; } /** Analogue of `std::find()` that finds the last value in `[first, last)` equal to `x`. */ template BidiIter find_backward(BidiIter first, BidiIter last, T const & x) { auto it = last; while (it != first) { if (*--it == x) return it; } return last; } /** Analogue of `std::find()` that finds the last value in `[first, last)` not equal to `x`. */ template BidiIter find_not_backward(BidiIter first, BidiIter last, T const & x) { auto it = last; while (it != first) { if (*--it != x) return it; } return last; } /** Analogue of `std::find()` that finds the last value `v` in `[first, last)` for which `p(v)` is true. */ template BidiIter find_if_backward(BidiIter first, BidiIter last, Pred p) { auto it = last; while (it != first) { if (p(*--it)) return it; } return last; } /** Analogue of `std::find()` that finds the last value `v` in `[first, last)` for which `p(v)` is false. */ template BidiIter find_if_not_backward(BidiIter first, BidiIter last, Pred p) { auto it = last; while (it != first) { if (!p(*--it)) return it; } return last; } /** A utility range type returned by `foreach_subrange*()`. */ template using foreach_subrange_range = BOOST_PARSER_DETAIL_TEXT_SUBRANGE; /** Calls `f(sub)` for each subrange `sub` in `[first, last)`. A subrange is a contiguous subsequence of elements that each compares equal to the first element of the subsequence. Subranges passed to `f` are non-overlapping. */ template Func foreach_subrange(FwdIter first, Sentinel last, Func f) { while (first != last) { auto const & x = *first; auto const next = boost::parser::detail::text::find_not(first, last, x); if (first != next) { f(boost::parser::detail::text::foreach_subrange_range( first, next)); } first = next; } return f; } /** Calls `f(sub)` for each subrange `sub` in `[first, last)`. A subrange is a contiguous subsequence of elements that for each element `e`, `proj(e)` each compares equal to `proj()` of the first element of the subsequence. Subranges passed to `f` are non-overlapping. */ template Func foreach_subrange(FwdIter first, Sentinel last, Func f, Proj proj) { using value_type = typename std::iterator_traits::value_type; while (first != last) { auto const & x = proj(*first); auto const next = boost::parser::detail::text::find_if_not( first, last, [&x, proj](const value_type & element) { return proj(element) == x; }); if (first != next) { f(boost::parser::detail::text::foreach_subrange_range( first, next)); } first = next; } return f; } /** Calls `f(sub)` for each subrange `sub` in `[first, last)`. A subrange is a contiguous subsequence of elements, each of which is equal to `x`. Subranges passed to `f` are non-overlapping. */ template Func foreach_subrange_of(FwdIter first, Sentinel last, T const & x, Func f) { while (first != last) { first = boost::parser::detail::text::find(first, last, x); auto const next = boost::parser::detail::text::find_not(first, last, x); if (first != next) { f(boost::parser::detail::text::foreach_subrange_range( first, next)); } first = next; } return f; } /** Calls `f(sub)` for each subrange `sub` in `[first, last)`. A subrange is a contiguous subsequence of elements `ei` for which `p(ei)` is true. Subranges passed to `f` are non-overlapping. */ template Func foreach_subrange_if(FwdIter first, Sentinel last, Pred p, Func f) { while (first != last) { first = boost::parser::detail::text::find_if(first, last, p); auto const next = boost::parser::detail::text::find_if_not(first, last, p); if (first != next) { f(boost::parser::detail::text::foreach_subrange_range( first, next)); } first = next; } return f; } /** Sentinel-friendly version of `std::all_of()`. */ template bool all_of(Iter first, Sentinel last, Pred p) { for (; first != last; ++first) { if (!p(*first)) return false; } return true; } /** Sentinel-friendly version of `std::equal()`. */ template< typename Iter1, typename Sentinel1, typename Iter2, typename Sentinel2> bool equal(Iter1 first1, Sentinel1 last1, Iter2 first2, Sentinel2 last2) { for (; first1 != last1 && first2 != last2; ++first1, ++first2) { if (*first1 != *first2) return false; } return first1 == last1 && first2 == last2; } /** Sentinel-friendly version of `std::mismatch()`. */ template< typename Iter1, typename Sentinel1, typename Iter2, typename Sentinel2> std::pair mismatch(Iter1 first1, Sentinel1 last1, Iter2 first2, Sentinel2 last2) { for (; first1 != last1 && first2 != last2; ++first1, ++first2) { if (*first1 != *first2) break; } return {first1, first2}; } /** Sentinel-friendly version of `std::lexicographical_compare_three_way()`, except that it returns an `int` instead of a `std::strong_ordering`. */ template< typename Iter1, typename Sentinel1, typename Iter2, typename Sentinel2> int lexicographical_compare_three_way( Iter1 first1, Sentinel1 last1, Iter2 first2, Sentinel2 last2) { auto const iters = boost::parser::detail::text::mismatch(first1, last1, first2, last2); if (iters.first == last1) { if (iters.second == last2) return 0; else return -1; } else if (iters.second == last2) { return 1; } else if (*iters.first < *iters.second) { return -1; } else { return 1; } } /** The view type returned by `boost::parser::detail::text::search()`. */ template using search_result = BOOST_PARSER_DETAIL_TEXT_SUBRANGE; /** Sentinel-friendly version of `std::search()`. */ template< typename Iter1, typename Sentinel1, typename Iter2, typename Sentinel2> search_result search(Iter1 first1, Sentinel1 last1, Iter2 first2, Sentinel2 last2) { if (first1 == last1 || first2 == last2) return {first1, first1}; if (detail::next(first2) == last2) { auto const it = parser::detail::text::find(first1, last1, *first2); if (it == last1) return {it, it}; return {it, detail::next(it)}; } auto it = first1; for (;;) { first1 = parser::detail::text::find(first1, last1, *first2); if (first1 == last1) return {first1, first1}; auto it2 = detail::next(first2); it = first1; if (++it == last1) return {it, it}; while (*it == *it2) { if (++it2 == last2) return {first1, ++it}; if (++it == last1) return {it, it}; } ++first1; } return {first1, first1}; } /** Sentinel-friendly version of `std::find_first_of()`. */ template< typename Iter1, typename Sentinel1, typename Iter2, typename Sentinel2, typename Pred> Iter1 find_first_of( Iter1 first1, Sentinel1 last1, Iter2 first2, Sentinel2 last2, Pred pred) { for (; first1 != last1; ++first1) { for (auto it = first2; it != last2; ++it) { if (pred(*first1, *it)) return first1; } } return first1; } }} #if BOOST_PARSER_DETAIL_TEXT_USE_CONCEPTS namespace std::ranges { template inline constexpr bool enable_borrowed_range< boost::parser::detail::text::foreach_subrange_range> = true; } #endif #endif