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 regex_token_iterator.hpp /// Contains the definition of regex_token_iterator, and STL-compatible iterator /// for tokenizing a string using a regular expression. // // Copyright 2008 Eric Niebler. 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_XPRESSIVE_REGEX_TOKEN_ITERATOR_HPP_EAN_10_04_2005 #define BOOST_XPRESSIVE_REGEX_TOKEN_ITERATOR_HPP_EAN_10_04_2005 // MS compatible compilers support #pragma once #if defined(_MSC_VER) # pragma once #endif #include #include #include #include #include #include namespace boost { namespace xpressive { namespace detail { ////////////////////////////////////////////////////////////////////////// // regex_token_iterator_impl // template struct regex_token_iterator_impl : counted_base > { typedef sub_match value_type; regex_token_iterator_impl ( BidiIter begin , BidiIter cur , BidiIter end , BidiIter next_search , basic_regex const &rex , regex_constants::match_flag_type flags = regex_constants::match_default , std::vector subs = std::vector(1, 0) , int n = -2 , bool not_null = false ) : iter_(begin, cur, end, next_search, rex, flags, not_null) , result_() , n_((-2 == n) ? (int)subs.size() - 1 : n) , subs_() { BOOST_ASSERT(0 != subs.size()); this->subs_.swap(subs); } bool next() { if(-1 != this->n_) { BidiIter cur = this->iter_.state_.cur_; if(0 != (++this->n_ %= (int)this->subs_.size()) || this->iter_.next()) { this->result_ = (-1 == this->subs_[ this->n_ ]) ? this->iter_.what_.prefix() : this->iter_.what_[ this->subs_[ this->n_ ] ]; return true; } else if(-1 == this->subs_[ this->n_-- ] && cur != this->iter_.state_.end_) { this->result_ = value_type(cur, this->iter_.state_.end_, true); return true; } } return false; } bool equal_to(regex_token_iterator_impl const &that) const { return this->iter_.equal_to(that.iter_) && this->n_ == that.n_; } regex_iterator_impl iter_; value_type result_; int n_; std::vector subs_; }; inline int get_mark_number(int i) { return i; } inline std::vector to_vector(int subs) { return std::vector(1, subs); } inline std::vector const &to_vector(std::vector const &subs) { return subs; } template inline std::vector to_vector(Int const (&sub_matches)[ Size ]) { // so that people can specify sub-match indices inline with // string literals, like "\1\2\3", leave off the trailing '\0' std::size_t const size = Size - is_same::value; std::vector vect(size); for(std::size_t i = 0; i < size; ++i) { vect[i] = get_mark_number(sub_matches[i]); } return vect; } template inline std::vector to_vector(std::vector const &sub_matches) { BOOST_MPL_ASSERT((is_convertible)); return std::vector(sub_matches.begin(), sub_matches.end()); } } // namespace detail ////////////////////////////////////////////////////////////////////////// // regex_token_iterator // template struct regex_token_iterator { typedef basic_regex regex_type; typedef typename iterator_value::type char_type; typedef sub_match value_type; typedef std::ptrdiff_t difference_type; typedef value_type const *pointer; typedef value_type const &reference; typedef std::forward_iterator_tag iterator_category; /// INTERNAL ONLY typedef detail::regex_token_iterator_impl impl_type_; /// \post \c *this is the end of sequence iterator. regex_token_iterator() : impl_() { } /// \param begin The beginning of the character range to search. /// \param end The end of the character range to search. /// \param rex The regex pattern to search for. /// \pre \c [begin,end) is a valid range. regex_token_iterator ( BidiIter begin , BidiIter end , basic_regex const &rex ) : impl_() { if(0 != rex.regex_id()) { this->impl_ = new impl_type_(begin, begin, end, begin, rex); this->next_(); } } /// \param begin The beginning of the character range to search. /// \param end The end of the character range to search. /// \param rex The regex pattern to search for. /// \param args A let() expression with argument bindings for semantic actions. /// \pre \c [begin,end) is a valid range. template regex_token_iterator ( BidiIter begin , BidiIter end , basic_regex const &rex , detail::let_ const &args ) : impl_() { if(0 != rex.regex_id()) { this->impl_ = new impl_type_(begin, begin, end, begin, rex); detail::bind_args(args, this->impl_->iter_.what_); this->next_(); } } /// \param begin The beginning of the character range to search. /// \param end The end of the character range to search. /// \param rex The regex pattern to search for. /// \param subs A range of integers designating sub-matches to be treated as tokens. /// \param flags Optional match flags, used to control how the expression is matched against the sequence. (See match_flag_type.) /// \pre \c [begin,end) is a valid range. /// \pre \c subs is either an integer greater or equal to -1, /// or else an array or non-empty \c std::vector\<\> of such integers. template regex_token_iterator ( BidiIter begin , BidiIter end , basic_regex const &rex , Subs const &subs , regex_constants::match_flag_type flags = regex_constants::match_default ) : impl_() { if(0 != rex.regex_id()) { this->impl_ = new impl_type_(begin, begin, end, begin, rex, flags, detail::to_vector(subs)); this->next_(); } } /// \param begin The beginning of the character range to search. /// \param end The end of the character range to search. /// \param rex The regex pattern to search for. /// \param subs A range of integers designating sub-matches to be treated as tokens. /// \param args A let() expression with argument bindings for semantic actions. /// \param flags Optional match flags, used to control how the expression is matched against the sequence. (See match_flag_type.) /// \pre \c [begin,end) is a valid range. /// \pre \c subs is either an integer greater or equal to -1, /// or else an array or non-empty \c std::vector\<\> of such integers. template regex_token_iterator ( BidiIter begin , BidiIter end , basic_regex const &rex , Subs const &subs , detail::let_ const &args , regex_constants::match_flag_type flags = regex_constants::match_default ) : impl_() { if(0 != rex.regex_id()) { this->impl_ = new impl_type_(begin, begin, end, begin, rex, flags, detail::to_vector(subs)); detail::bind_args(args, this->impl_->iter_.what_); this->next_(); } } /// \post *this == that regex_token_iterator(regex_token_iterator const &that) : impl_(that.impl_) // COW { } /// \post *this == that regex_token_iterator &operator =(regex_token_iterator const &that) { this->impl_ = that.impl_; // COW return *this; } friend bool operator ==(regex_token_iterator const &left, regex_token_iterator const &right) { if(!left.impl_ || !right.impl_) { return !left.impl_ && !right.impl_; } return left.impl_->equal_to(*right.impl_); } friend bool operator !=(regex_token_iterator const &left, regex_token_iterator const &right) { return !(left == right); } value_type const &operator *() const { return this->impl_->result_; } value_type const *operator ->() const { return &this->impl_->result_; } /// If N == -1 then sets *this equal to the end of sequence iterator. /// Otherwise if N+1 \< subs.size(), then increments N and sets result equal to /// ((subs[N] == -1) ? value_type(what.prefix().str()) : value_type(what[subs[N]].str())). /// Otherwise if what.prefix().first != what[0].second and if the element match_prev_avail is /// not set in flags then sets it. Then locates the next match as if by calling /// regex_search(what[0].second, end, what, *pre, flags), with the following variation: /// in the event that the previous match found was of zero length (what[0].length() == 0) /// then attempts to find a non-zero length match starting at what[0].second, only if that /// fails and provided what[0].second != suffix().second does it look for a (possibly zero /// length) match starting from what[0].second + 1. If such a match is found then sets N /// equal to zero, and sets result equal to /// ((subs[N] == -1) ? value_type(what.prefix().str()) : value_type(what[subs[N]].str())). /// Otherwise if no further matches were found, then let last_end be the endpoint of the last /// match that was found. Then if last_end != end and subs[0] == -1 sets N equal to -1 and /// sets result equal to value_type(last_end, end). Otherwise sets *this equal to the end /// of sequence iterator. regex_token_iterator &operator ++() { this->fork_(); // un-share the implementation this->next_(); return *this; } regex_token_iterator operator ++(int) { regex_token_iterator tmp(*this); ++*this; return tmp; } private: /// INTERNAL ONLY void fork_() { if(1 != this->impl_->use_count()) { intrusive_ptr clone = new impl_type_ ( this->impl_->iter_.state_.begin_ , this->impl_->iter_.state_.cur_ , this->impl_->iter_.state_.end_ , this->impl_->iter_.state_.next_search_ , this->impl_->iter_.rex_ , this->impl_->iter_.flags_ , this->impl_->subs_ , this->impl_->n_ , this->impl_->iter_.not_null_ ); // only copy the match_results struct if we have to. Note: if the next call // to impl_->next() will return false or call regex_search, we don't need to // copy the match_results struct. if(-1 != this->impl_->n_ && this->impl_->n_ + 1 != static_cast(this->impl_->subs_.size())) { // BUGBUG This is expensive -- it causes the sequence_stack to be cleared. // Find a better way clone->iter_.what_ = this->impl_->iter_.what_; } else { // At the very least, copy the action args detail::core_access::get_action_args(clone->iter_.what_) = detail::core_access::get_action_args(this->impl_->iter_.what_); } this->impl_.swap(clone); } } /// INTERNAL ONLY void next_() { BOOST_ASSERT(this->impl_ && 1 == this->impl_->use_count()); if(!this->impl_->next()) { this->impl_ = 0; } } intrusive_ptr impl_; }; }} // namespace boost::xpressive #endif