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) 2010-2010: 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_CONCEPT_ELEMENT_ASSOCIATOR_HPP_JOFA_100921 #define BOOST_ICL_CONCEPT_ELEMENT_ASSOCIATOR_HPP_JOFA_100921 #include #include #include #include #include #include #include namespace boost{ namespace icl { //============================================================================== //= Size //============================================================================== template typename enable_if, std::size_t>::type iterative_size(const Type& object) { return object.size(); } template typename enable_if, typename Type::size_type>::type size(const Type& object) { return icl::iterative_size(object); } template typename enable_if, typename Type::size_type>::type cardinality(const Type& object) { return icl::iterative_size(object); } //============================================================================== //= Containedness //============================================================================== //------------------------------------------------------------------------------ //- bool within(c P&, c T&) T:{s}|{m} P:{e}|{i} fragment_types|key_types //------------------------------------------------------------------------------ /** Checks if a key is in the associative container */ template typename enable_if, bool>::type within(const typename Type::key_type& key, const Type& super) { return !(super.find(key) == super.end()); } //------------------------------------------------------------------------------ //- bool within(c P&, c T&) T:{s}|{m} P:{s'} fragment_types|key_types //------------------------------------------------------------------------------ template typename enable_if , is_key_container_of >, bool>::type within(const SubT& sub, const SuperT& super) { if(icl::is_empty(sub)) return true; if(icl::is_empty(super)) return false; if(icl::size(super) < icl::size(sub)) return false; typename SubT::const_iterator common_lwb_; typename SubT::const_iterator common_upb_; if(!Set::common_range(common_lwb_, common_upb_, sub, super)) return false; typename SubT::const_iterator sub_ = sub.begin(); typename SuperT::const_iterator super_; while(sub_ != sub.end()) { super_ = super.find(key_value(sub_)); if(super_ == super.end()) return false; else if(!co_equal(sub_, super_, &sub, &super)) return false; ++sub_; } return true; } //------------------------------------------------------------------------------ //- bool contains(c T&, c P&) T:{s}|{m} P:{e}|{i} fragment_types|key_types //------------------------------------------------------------------------------ template typename enable_if, bool>::type contains(const Type& super, const typename Type::key_type& key) { return icl::within(key, super); } //------------------------------------------------------------------------------ //- bool contains(c T&, c P&) T:{s}|{m} P:{s'} fragment_types|key_types //------------------------------------------------------------------------------ template typename enable_if , is_key_container_of >, bool>::type contains(const SuperT& super, const SubT& sub) { return icl::within(sub, super); } //============================================================================== //= Equivalences and Orderings //============================================================================== #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4996) //'std::equal': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' #endif // I do guarantee here that I am using the parameters correctly :) /** Standard equality, which is lexicographical equality of the sets as sequences, that are given by their Compare order. */ template inline typename enable_if, bool>::type operator == (const Type& left, const Type& right) { return left.size() == right.size() && std::equal(left.begin(), left.end(), right.begin()); } #ifdef BOOST_MSVC #pragma warning(pop) #endif template inline typename enable_if, bool>::type is_element_equal(const Type& left, const Type& right) { return left == right; } /* Strict weak less ordering which is given by the Compare order */ template inline typename enable_if, bool>::type operator < (const Type& left, const Type& right) { return std::lexicographical_compare( left.begin(), left.end(), right.begin(), right.end(), typename Type::element_compare() ); } template typename enable_if, int>::type inclusion_compare(const LeftT& left, const RightT& right) { return Set::subset_compare(left, right, left.begin(), left.end(), right.begin(), right.end()); } //============================================================================== //= Addition //============================================================================== template inline typename enable_if, Type>::type& operator += (Type& object, const typename Type::value_type& operand) { return icl::add(object, operand); } template inline typename enable_if, Type>::type operator + (Type object, const typename Type::value_type& operand) { return object += operand; } template inline typename enable_if, Type>::type operator + (const typename Type::value_type& operand, Type object) { return object += operand; } template inline typename enable_if, Type>::type& operator += (Type& object, const Type& operand) { if(&object == &operand) return object; typename Type::iterator prior_ = object.end(); ICL_const_FORALL(typename Type, it_, operand) prior_ = icl::add(object, prior_, *it_); return object; } template inline typename enable_if, Type>::type operator + (Type object, const Type& operand) { return object += operand; } //============================================================================== template inline typename enable_if, Type>::type& operator |= (Type& object, const typename Type::value_type& operand) { return icl::add(object, operand); } template inline typename enable_if, Type>::type operator | (Type object, const typename Type::value_type& operand) { return object += operand; } template inline typename enable_if, Type>::type operator | (const typename Type::value_type& operand, Type object) { return object += operand; } template inline typename enable_if, Type>::type& operator |= (Type& object, const Type& operand) { return object += operand; } template inline typename enable_if, Type>::type operator | (Type object, const Type& operand) { return object += operand; } //============================================================================== //= Insertion //============================================================================== //------------------------------------------------------------------------------ //- V insert(T&, c P&) T:{s}|{m} P:{e}|{b} fragment_type //------------------------------------------------------------------------------ template typename enable_if, std::pair >::type insert(Type& object, const typename Type::value_type& operand) { return object.insert(operand); } template typename enable_if, typename Type::iterator>::type insert(Type& object, typename Type::iterator prior, const typename Type::value_type& operand) { return object.insert(prior, operand); } //------------------------------------------------------------------------------ //- T insert(T&, c T&) T:{s m} map fragment_type //------------------------------------------------------------------------------ template typename enable_if, Type>::type& insert(Type& object, const Type& addend) { typedef typename Type::iterator iterator; iterator prior_ = object.end(); ICL_const_FORALL(typename Type, elem_, addend) icl::insert(object, prior_, *elem_); return object; } //============================================================================== //= Erasure //============================================================================== template typename enable_if, typename Type::size_type>::type erase(Type& object, const typename Type::key_type& key_value) { typedef typename Type::size_type size_type; typename Type::iterator it_ = object.find(key_value); if(it_ != object.end()) { object.erase(it_); return unit_element::value(); } return identity_element::value(); } template typename enable_if, Type>::type& erase(Type& object, const Type& erasure) { ICL_const_FORALL(typename Type, elem_, erasure) icl::erase(object, *elem_); return object; } //============================================================================== //= Subtraction //============================================================================== template inline typename enable_if, Type>::type& operator -= (Type& object, const typename Type::value_type& operand) { return icl::subtract(object, operand); } template inline typename enable_if, Type>::type operator - (Type object, const typename Type::value_type& operand) { return object -= operand; } template inline typename enable_if, Type>::type& operator -= (Type& object, const Type& subtrahend) { ICL_const_FORALL(typename Type, it_, subtrahend) icl::subtract(object, *it_); return object; } template inline typename enable_if, Type>::type operator - (Type object, const Type& subtrahend) { return object -= subtrahend; } //============================================================================== //= Intersection //============================================================================== //------------------------------------------------------------------------------ //- void add_intersection(T&, c T&, c P&) T:{s}{m} P:{e}{e} key_type //------------------------------------------------------------------------------ template inline typename enable_if, void>::type add_intersection(Type& section, const Type& object, const typename Type::key_type& operand) { typedef typename Type::const_iterator const_iterator; const_iterator it_ = object.find(operand); if(it_ != object.end()) icl::add(section, *it_); } //------------------------------------------------------------------------------ //- void add_intersection(T&, c T&, c P&) T:{s}{m} P:{s}{s} set key_type //------------------------------------------------------------------------------ template inline typename enable_if, void>::type add_intersection(Type& section, const Type& object, const typename key_container_type_of::type& operand) { typedef typename key_container_type_of::type key_container_type; typedef typename key_container_type::const_iterator const_iterator; const_iterator common_lwb_, common_upb_; if(!Set::common_range(common_lwb_, common_upb_, operand, object)) return; const_iterator sec_ = common_lwb_; while(sec_ != common_upb_) add_intersection(section, object, *sec_++); } //------------------------------------------------------------------------------ //- Intersection //------------------------------------------------------------------------------ template inline typename enable_if, Type>::type& operator &= (Type& object, const typename Type::key_type& operand) { Type section; add_intersection(section, object, operand); object.swap(section); return object; } template inline typename enable_if, Type>::type operator & (Type object, const typename Type::key_type& operand) { return object &= operand; } template inline typename enable_if, Type>::type operator & (const typename Type::key_type& operand, Type object) { return object &= operand; } template inline typename enable_if, Type>::type& operator &= (Type& object, const typename key_container_type_of::type& operand) { Type section; add_intersection(section, object, operand); object.swap(section); return object; } template inline typename enable_if, Type>::type operator & (Type object, const Type& operand) { return object &= operand; } //------------------------------------------------------------------------------ template inline typename enable_if, bool>::type disjoint(const Type& left, const Type& right) { return !intersects(left, right); } //============================================================================== //= Symmetric difference //============================================================================== template inline typename enable_if, Type>::type operator ^ (Type object, const typename Type::value_type& operand) { return icl::flip(object, operand); } template inline typename enable_if, Type>::type operator ^ (const typename Type::value_type& operand, Type object) { return icl::flip(object, operand); } template inline typename enable_if, Type>::type operator ^ (Type object, const Type& operand) { return object ^= operand; } //============================================================================== //= Manipulation by predicates //============================================================================== template typename enable_if, Type>::type& erase_if(const Predicate& pred, Type& object) { typename Type::iterator it_ = object.begin(); while(it_ != object.end()) if(pred(*it_)) icl::erase(object, it_++); else ++it_; return object; } template inline typename enable_if, Type>::type& add_if(const Predicate& pred, Type& object, const Type& src) { typename Type::const_iterator it_ = src.begin(); while(it_ != src.end()) if(pred(*it_)) icl::add(object, *it_++); return object; } template inline typename enable_if, Type>::type& assign_if(const Predicate& pred, Type& object, const Type& src) { icl::clear(object); return add_if(object, src, pred); } }} // namespace boost icl #endif