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 2003-2018 Joaquin M Lopez Munoz. * 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/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_RNK_INDEX_OPS_HPP #define BOOST_MULTI_INDEX_DETAIL_RNK_INDEX_OPS_HPP #if defined(_MSC_VER) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Common code for ranked_index memfuns having templatized and * non-templatized versions. */ template struct ranked_node_size_type { typedef typename boost::pointer_traits:: element_type::size_type type; }; template inline typename ranked_node_size_type::type ranked_node_size(Pointer x) { return x!=Pointer(0)?x->size:0; } template inline Pointer ranked_index_nth( BOOST_DEDUCED_TYPENAME ranked_node_size_type::type n,Pointer end_) { typedef typename ranked_node_size_type::type size_type; Pointer top=end_->parent(); if(top==Pointer(0)||n>=top->size)return end_; for(;;){ size_type s=ranked_node_size(top->left()); if(n==s)return top; if(nleft(); else{ top=top->right(); n-=s+1; } } } template inline typename ranked_node_size_type::type ranked_index_rank(Pointer x,Pointer end_) { typedef typename ranked_node_size_type::type size_type; Pointer top=end_->parent(); if(top==Pointer(0))return 0; if(x==end_)return top->size; size_type s=ranked_node_size(x->left()); while(x!=top){ Pointer z=x->parent(); if(x==z->right()){ s+=ranked_node_size(z->left())+1; } x=z; } return s; } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline typename Node::size_type ranked_index_find_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { typedef typename KeyFromValue::result_type key_type; return ranked_index_find_rank( top,y,key,x,comp, mpl::and_< promotes_1st_arg, promotes_2nd_arg >()); } template< typename Node,typename KeyFromValue, typename CompatibleCompare > inline typename Node::size_type ranked_index_find_rank( Node* top,Node* y,const KeyFromValue& key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type& x, const CompatibleCompare& comp,mpl::true_) { return ranked_index_find_rank(top,y,key,x,comp,mpl::false_()); } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline typename Node::size_type ranked_index_find_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp,mpl::false_) { typedef typename Node::size_type size_type; if(!top)return 0; size_type s=top->impl()->size, s0=s; Node* y0=y; do{ if(!comp(key(top->value()),x)){ y=top; s-=ranked_node_size(y->right())+1; top=Node::from_impl(top->left()); } else top=Node::from_impl(top->right()); }while(top); return (y==y0||comp(x,key(y->value())))?s0:s; } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline typename Node::size_type ranked_index_lower_bound_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { typedef typename KeyFromValue::result_type key_type; return ranked_index_lower_bound_rank( top,y,key,x,comp, promotes_2nd_arg()); } template< typename Node,typename KeyFromValue, typename CompatibleCompare > inline typename Node::size_type ranked_index_lower_bound_rank( Node* top,Node* y,const KeyFromValue& key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type& x, const CompatibleCompare& comp,mpl::true_) { return ranked_index_lower_bound_rank(top,y,key,x,comp,mpl::false_()); } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline typename Node::size_type ranked_index_lower_bound_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp,mpl::false_) { typedef typename Node::size_type size_type; if(!top)return 0; size_type s=top->impl()->size; do{ if(!comp(key(top->value()),x)){ y=top; s-=ranked_node_size(y->right())+1; top=Node::from_impl(top->left()); } else top=Node::from_impl(top->right()); }while(top); return s; } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline typename Node::size_type ranked_index_upper_bound_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { typedef typename KeyFromValue::result_type key_type; return ranked_index_upper_bound_rank( top,y,key,x,comp, promotes_1st_arg()); } template< typename Node,typename KeyFromValue, typename CompatibleCompare > inline typename Node::size_type ranked_index_upper_bound_rank( Node* top,Node* y,const KeyFromValue& key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type& x, const CompatibleCompare& comp,mpl::true_) { return ranked_index_upper_bound_rank(top,y,key,x,comp,mpl::false_()); } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline typename Node::size_type ranked_index_upper_bound_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp,mpl::false_) { typedef typename Node::size_type size_type; if(!top)return 0; size_type s=top->impl()->size; do{ if(comp(x,key(top->value()))){ y=top; s-=ranked_node_size(y->right())+1; top=Node::from_impl(top->left()); } else top=Node::from_impl(top->right()); }while(top); return s; } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline std::pair ranked_index_equal_range_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { typedef typename KeyFromValue::result_type key_type; return ranked_index_equal_range_rank( top,y,key,x,comp, mpl::and_< promotes_1st_arg, promotes_2nd_arg >()); } template< typename Node,typename KeyFromValue, typename CompatibleCompare > inline std::pair ranked_index_equal_range_rank( Node* top,Node* y,const KeyFromValue& key, const BOOST_DEDUCED_TYPENAME KeyFromValue::result_type& x, const CompatibleCompare& comp,mpl::true_) { return ranked_index_equal_range_rank(top,y,key,x,comp,mpl::false_()); } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline std::pair ranked_index_equal_range_rank( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp,mpl::false_) { typedef typename Node::size_type size_type; if(!top)return std::pair(0,0); size_type s=top->impl()->size; do{ if(comp(key(top->value()),x)){ top=Node::from_impl(top->right()); } else if(comp(x,key(top->value()))){ y=top; s-=ranked_node_size(y->right())+1; top=Node::from_impl(top->left()); } else{ return std::pair( s-top->impl()->size+ ranked_index_lower_bound_rank( Node::from_impl(top->left()),top,key,x,comp,mpl::false_()), s-ranked_node_size(top->right())+ ranked_index_upper_bound_rank( Node::from_impl(top->right()),y,key,x,comp,mpl::false_())); } }while(top); return std::pair(s,s); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif