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
// Boost.Range library concept checks // // Copyright Neil Groves 2009. Use, modification and distribution // are subject to 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) // // Copyright Daniel Walker 2006. Use, modification and distribution // are subject to 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) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_CONCEPTS_HPP #define BOOST_RANGE_CONCEPTS_HPP #include #include #include #include #include #include #include #include #include #include #include /*! * \file * \brief Concept checks for the Boost Range library. * * The structures in this file may be used in conjunction with the * Boost Concept Check library to insure that the type of a function * parameter is compatible with a range concept. If not, a meaningful * compile time error is generated. Checks are provided for the range * concepts related to iterator traversal categories. For example, the * following line checks that the type T models the ForwardRange * concept. * * \code * BOOST_CONCEPT_ASSERT((ForwardRangeConcept)); * \endcode * * A different concept check is required to ensure writeable value * access. For example to check for a ForwardRange that can be written * to, the following code is required. * * \code * BOOST_CONCEPT_ASSERT((WriteableForwardRangeConcept)); * \endcode * * \see http://www.boost.org/libs/range/doc/range.html for details * about range concepts. * \see http://www.boost.org/libs/iterator/doc/iterator_concepts.html * for details about iterator concepts. * \see http://www.boost.org/libs/concept_check/concept_check.htm for * details about concept checks. */ namespace boost { namespace range_detail { #ifndef BOOST_RANGE_ENABLE_CONCEPT_ASSERT // List broken compiler versions here: #ifndef __clang__ #ifdef __GNUC__ // GNUC 4.2 has strange issues correctly detecting compliance with the Concepts // hence the least disruptive approach is to turn-off the concept checking for // this version of the compiler. #if __GNUC__ == 4 && __GNUC_MINOR__ == 2 #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #endif #endif #ifdef __GCCXML__ // GCC XML, unsurprisingly, has the same issues #if __GCCXML_GNUC__ == 4 && __GCCXML_GNUC_MINOR__ == 2 #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #endif #endif #endif #ifdef BOOST_BORLANDC #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #endif #ifdef __PATHCC__ #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #endif // Default to using the concept asserts unless we have defined it off // during the search for black listed compilers. #ifndef BOOST_RANGE_ENABLE_CONCEPT_ASSERT #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 1 #endif #endif #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT #define BOOST_RANGE_CONCEPT_ASSERT( x ) BOOST_CONCEPT_ASSERT( x ) #else #define BOOST_RANGE_CONCEPT_ASSERT( x ) #endif // Rationale for the inclusion of redefined iterator concept // classes: // // The Range algorithms often do not require that the iterators are // Assignable or default constructable, but the correct standard // conformant iterators do require the iterators to be a model of the // Assignable concept. // Iterators that contains a functor that is not assignable therefore // are not correct models of the standard iterator concepts, // despite being adequate for most algorithms. An example of this // use case is the combination of the boost::adaptors::filtered // class with a boost::lambda::bind generated functor. // Ultimately modeling the range concepts using composition // with the Boost.Iterator concepts would render the library // incompatible with many common Boost.Lambda expressions. template struct IncrementableIteratorConcept : CopyConstructible { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT typedef BOOST_DEDUCED_TYPENAME iterator_traversal::type traversal_category; BOOST_RANGE_CONCEPT_ASSERT(( Convertible< traversal_category, incrementable_traversal_tag >)); BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) { ++i; (void)i++; } private: Iterator i; #endif }; template struct SinglePassIteratorConcept : IncrementableIteratorConcept , EqualityComparable { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME SinglePassIteratorConcept::traversal_category, single_pass_traversal_tag >)); BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) { Iterator i2(++i); boost::ignore_unused_variable_warning(i2); // deliberately we are loose with the postfix version for the single pass // iterator due to the commonly poor adherence to the specification means that // many algorithms would be unusable, whereas actually without the check they // work (void)(i++); BOOST_DEDUCED_TYPENAME std::iterator_traits::reference r1(*i); boost::ignore_unused_variable_warning(r1); BOOST_DEDUCED_TYPENAME std::iterator_traits::reference r2(*(++i)); boost::ignore_unused_variable_warning(r2); } private: Iterator i; #endif }; template struct ForwardIteratorConcept : SinglePassIteratorConcept , DefaultConstructible { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT typedef BOOST_DEDUCED_TYPENAME std::iterator_traits::difference_type difference_type; BOOST_MPL_ASSERT((is_integral)); BOOST_MPL_ASSERT_RELATION(std::numeric_limits::is_signed, ==, true); BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME ForwardIteratorConcept::traversal_category, forward_traversal_tag >)); BOOST_CONCEPT_USAGE(ForwardIteratorConcept) { // See the above note in the SinglePassIteratorConcept about the handling of the // postfix increment. Since with forward and better iterators there is no need // for a proxy, we can sensibly require that the dereference result // is convertible to reference. Iterator i2(i++); boost::ignore_unused_variable_warning(i2); BOOST_DEDUCED_TYPENAME std::iterator_traits::reference r(*(i++)); boost::ignore_unused_variable_warning(r); } private: Iterator i; #endif }; template struct BidirectionalIteratorConcept : ForwardIteratorConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME BidirectionalIteratorConcept::traversal_category, bidirectional_traversal_tag >)); BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) { --i; (void)i--; } private: Iterator i; #endif }; template struct RandomAccessIteratorConcept : BidirectionalIteratorConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME RandomAccessIteratorConcept::traversal_category, random_access_traversal_tag >)); BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) { i += n; i = i + n; i = n + i; i -= n; i = i - n; n = i - j; } private: BOOST_DEDUCED_TYPENAME BidirectionalIteratorConcept::difference_type n; Iterator i; Iterator j; #endif }; } // namespace range_detail //! Check if a type T models the SinglePassRange range concept. template struct SinglePassRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT // A few compilers don't like the rvalue reference T types so just // remove it. typedef BOOST_DEDUCED_TYPENAME remove_reference::type Rng; typedef BOOST_DEDUCED_TYPENAME range_iterator< Rng const >::type const_iterator; typedef BOOST_DEDUCED_TYPENAME range_iterator::type iterator; BOOST_RANGE_CONCEPT_ASSERT(( range_detail::SinglePassIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT(( range_detail::SinglePassIteratorConcept)); BOOST_CONCEPT_USAGE(SinglePassRangeConcept) { // This has been modified from assigning to this->i // (where i was a member variable) to improve // compatibility with Boost.Lambda iterator i1 = boost::begin(*m_range); iterator i2 = boost::end(*m_range); boost::ignore_unused_variable_warning(i1); boost::ignore_unused_variable_warning(i2); const_constraints(*m_range); } private: void const_constraints(const Rng& const_range) { const_iterator ci1 = boost::begin(const_range); const_iterator ci2 = boost::end(const_range); boost::ignore_unused_variable_warning(ci1); boost::ignore_unused_variable_warning(ci2); } // Rationale: // The type of m_range is T* rather than T because it allows // T to be an abstract class. The other obvious alternative of // T& produces a warning on some compilers. Rng* m_range; #endif }; //! Check if a type T models the ForwardRange range concept. template struct ForwardRangeConcept : SinglePassRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT((range_detail::ForwardIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT((range_detail::ForwardIteratorConcept)); #endif }; template struct WriteableRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT typedef BOOST_DEDUCED_TYPENAME range_iterator::type iterator; BOOST_CONCEPT_USAGE(WriteableRangeConcept) { *i = v; } private: iterator i; BOOST_DEDUCED_TYPENAME range_value::type v; #endif }; //! Check if a type T models the WriteableForwardRange range concept. template struct WriteableForwardRangeConcept : ForwardRangeConcept , WriteableRangeConcept { }; //! Check if a type T models the BidirectionalRange range concept. template struct BidirectionalRangeConcept : ForwardRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT((range_detail::BidirectionalIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT((range_detail::BidirectionalIteratorConcept)); #endif }; //! Check if a type T models the WriteableBidirectionalRange range concept. template struct WriteableBidirectionalRangeConcept : BidirectionalRangeConcept , WriteableRangeConcept { }; //! Check if a type T models the RandomAccessRange range concept. template struct RandomAccessRangeConcept : BidirectionalRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT((range_detail::RandomAccessIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT((range_detail::RandomAccessIteratorConcept)); #endif }; //! Check if a type T models the WriteableRandomAccessRange range concept. template struct WriteableRandomAccessRangeConcept : RandomAccessRangeConcept , WriteableRangeConcept { }; } // namespace boost #endif // BOOST_RANGE_CONCEPTS_HPP