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) 2008-2009: Joachim Faulhaber +------------------------------------------------------------------------------+ Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENCE.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +-----------------------------------------------------------------------------*/ #ifndef BOOST_ICL_INTERVAL_SUBSET_COMPARER_HPP_JOFA_090827 #define BOOST_ICL_INTERVAL_SUBSET_COMPARER_HPP_JOFA_090827 #include #include #include #include #include #include #include #include namespace boost{namespace icl { #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4127) // conditional expression is constant #endif namespace Interval_Set { //------------------------------------------------------------------------------ template struct settic_codomain_compare { static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) { return inclusion_compare( icl::co_value(left_), icl::co_value(right_)); } }; template struct atomic_codomain_compare { static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) { if(icl::co_value(left_) == icl::co_value(right_)) return inclusion::equal; else return inclusion::unrelated; } }; template struct empty_codomain_compare { static int apply(typename LeftT::const_iterator&, typename RightT::const_iterator) { return inclusion::equal; } }; template struct map_codomain_compare { static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) { using namespace boost::mpl; typedef typename LeftT::codomain_type LeftCodomainT; typedef typename RightT::codomain_type RightCodomainT; return if_< bool_::value>, settic_codomain_compare, atomic_codomain_compare > ::type::apply(left_, right_); } }; //------------------------------------------------------------------------------ template class subset_comparer { private: subset_comparer& operator = (const subset_comparer&); public: typedef typename LeftT::const_iterator LeftIterT; typedef typename RightT::const_iterator RightIterT; BOOST_STATIC_CONSTANT(bool, _compare_codomain = (mpl::and_, is_map >::value)); subset_comparer(const LeftT& left, const RightT& right, const LeftIterT& left_end, const RightIterT& right_end) : _left(left), _right(right), _left_end(left_end), _right_end(right_end), _result(equal) {} enum{nextboth, nextleft, nextright, stop}; enum { unrelated = inclusion::unrelated, subset = inclusion::subset, // left is_subset_of right superset = inclusion::superset, // left is_superset_of right equal = inclusion::equal // equal = subset | superset }; int result()const{ return _result; } int co_compare(LeftIterT& left, RightIterT& right) { using namespace boost::mpl; return if_< bool_::value>, map_codomain_compare, empty_codomain_compare > ::type::apply(left,right); } int restrict_result(int state) { return _result &= state; } int proceed(LeftIterT& left, RightIterT& right) { if(upper_less(key_value(left), key_value(right))) { // left ..) // right .....) _prior_left = left; ++left; return nextleft; } else if(upper_less(key_value(right), key_value(left))) { // left .....) // right ..) _prior_right = right; ++right; return nextright; } else//key_value(left).upper_equal(key_value(right)) { // left ..) // right ..) ++left; ++right; return nextboth; } } int next_both(LeftIterT& left, RightIterT& right) { if(left == _left_end && right == _right_end) return stop; else if(left == _left_end) { // left: ....end left could be subset // right:....[.. restrict_result(subset); return stop; } else if(right == _right_end) { // left: ....[.. left could be superset // right:....end restrict_result(superset); return stop; } else if(exclusive_less(key_value(left), key_value(right))) { // left: [..) . . .[---) left could be superset // right: [..).... if [---) exists restrict_result(superset); if(unrelated == _result) return stop; else { LeftIterT joint_ = _left.lower_bound(key_value(right)); if(joint_ == _left.end()) { _result = unrelated; return stop; } else { left = joint_; return nextboth; } } } else if(exclusive_less(key_value(right), key_value(left))) { // left: [.. left could be subset // right:....) . . .[---) if [---) exists restrict_result(subset); if(unrelated == _result) return stop; else { RightIterT joint_ = _right.lower_bound(key_value(left)); if(joint_ == _right.end()) { _result = unrelated; return stop; } else { right = joint_; return nextboth; } } } // left and right have intervals with nonempty intersection: if(_compare_codomain) if(unrelated == restrict_result(co_compare(left,right))) return stop; // examine left borders only. Right borders are checked in proceed if(lower_less(key_value(left), key_value(right))) { // left: ....[... left could be superset // right:.... [.. if(unrelated == restrict_result(superset)) return stop; } else if(lower_less(key_value(right), key_value(left))) { // left: .... [.. left can be subset // right:....[... if(unrelated == restrict_result(subset)) return stop; } //else key_value(right).lower_equal(key_value(left)) // left: ....[.. both can be equal // right:....[.. // nothing to do: proceed return proceed(left, right); } int next_left(LeftIterT& left, RightIterT& right) { if(left == _left_end) { // left: ..)end left could be subset // right:......) restrict_result(subset); return stop; } else if(!touches(key_value(_prior_left), key_value(left))) { // left: ..) [.. // right:.........) if(lower_less(key_value(right), key_value(left))) { // ..) [.. left could be subset // ..........) if(unrelated == restrict_result(subset)) return stop; } //else ..) [... // [.. if(_compare_codomain && intersects(key_value(left),key_value(right)) ) if(unrelated == restrict_result(co_compare(left,right))) return stop; } else { // left: ..)[.. left could be subset // right:.......) if(_compare_codomain && intersects(key_value(left), key_value(right)) ) if(unrelated == restrict_result(co_compare(left,right))) return stop; } return proceed(left, right); } int next_right(LeftIterT& left, RightIterT& right) { if(right == _right_end) { // left: ......) left could be superset // right:..)end restrict_result(superset); return stop; } else if(!touches(key_value(_prior_right), key_value(right))) { // left: .........) // right:..) [.. if(lower_less(key_value(left), key_value(right))) { // [....) left could be superset // ..) [.. if(unrelated == restrict_result(superset)) return stop; } //else [....) // ..) [.. if(_compare_codomain && intersects(key_value(left), key_value(right)) ) if(unrelated == restrict_result(co_compare(left,right))) return stop; } else { if(_compare_codomain && intersects(key_value(left), key_value(right)) ) if(unrelated == restrict_result(co_compare(left,right))) return stop; } return proceed(left, right); } private: const LeftT& _left; const RightT& _right; LeftIterT _left_end; RightIterT _right_end; LeftIterT _prior_left; RightIterT _prior_right; int _result; }; //------------------------------------------------------------------------------ // Subset/superset comparison on ranges of two interval container //------------------------------------------------------------------------------ template int subset_compare ( const LeftT& left, //sub const RightT& right, //super typename LeftT::const_iterator left_begin, typename LeftT::const_iterator left_end, typename RightT::const_iterator right_begin, typename RightT::const_iterator right_end ) { typedef subset_comparer Step; Step step(left, right, left_end, right_end); typename LeftT::const_iterator left_ = left_begin; typename RightT::const_iterator right_ = right_begin; int state = Step::nextboth; while(state != Step::stop) { switch(state){ case Step::nextboth: state = step.next_both(left_, right_); break; case Step::nextleft: state = step.next_left(left_, right_); break; case Step::nextright: state = step.next_right(left_, right_); break; } } return step.result(); } } // namespace Interval_Set #ifdef BOOST_MSVC #pragma warning(pop) #endif }} // namespace icl boost #endif