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
//////////////////////////////////////////////////////////////////////////// // lazy_reuse.hpp // // Build lazy operations for Phoenix equivalents for FC++ // // These are equivalents of the Boost FC++ functoids in reuse.hpp // // Implemented so far: // // reuser1 // reuser2 // reuser3 // reuser4 (not yet tested) // // NOTE: It has been possible to simplify the operation of this code. // It now makes no use of boost::function or old FC++ code. // // The functor type F must be an operator defined with // boost::phoenix::function. // See the example Apply in lazy_prelude.hpp // //////////////////////////////////////////////////////////////////////////// /*============================================================================= Copyright (c) 2000-2003 Brian McNamara and Yannis Smaragdakis Copyright (c) 2001-2007 Joel de Guzman Copyright (c) 2015 John Fletcher 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_PHOENIX_FUNCTION_LAZY_REUSE #define BOOST_PHOENIX_FUNCTION_LAZY_REUSE #include #include #include namespace boost { namespace phoenix { namespace fcpp { ////////////////////////////////////////////////////////////////////// // Original FC++ comment: // "Reuser"s are effectively special-purpose versions of curry() that // enable recursive list functoids to reuse the thunk of the curried // recursive call. See // http://www.cc.gatech.edu/~yannis/fc++/New/reusers.html // for a more detailed description. ////////////////////////////////////////////////////////////////////// // For efficiency, we mark parameters as either "VAR"iant or "INV"ariant. struct INV {}; struct VAR {}; template struct Maybe_Var_Inv; template struct Maybe_Var_Inv { static void remake( X& x, const X& val ) { x.~X(); new (&x) X(val); } static X clone( const X& x ) { return X(x); } }; template struct Maybe_Var_Inv { static void remake( X&, const X& ) {} static const X& clone( const X& x ) { return x; } }; ///////////////////////////////////////////////////////////////////// // ThunkImpl is an implementation of Fun0Impl for this use. ///////////////////////////////////////////////////////////////////// template class ThunkImpl { mutable RefCountType refC; public: ThunkImpl() : refC(0) {} virtual Result operator()() const =0; virtual ~ThunkImpl() {} template friend void intrusive_ptr_add_ref( const ThunkImpl* p ); template friend void intrusive_ptr_release( const ThunkImpl* p ); }; template void intrusive_ptr_add_ref( const ThunkImpl* p ) { ++ (p->refC); } template void intrusive_ptr_release( const ThunkImpl* p ) { if( !--(p->refC) ) delete p; } ////////////////////////////////////////////////////////////////////// // reuser1 is needed in list operations ////////////////////////////////////////////////////////////////////// template struct reuser1; template struct Thunk1 : public ThunkImpl { mutable F f; mutable X x; Thunk1( const F& ff, const X& xx ) : f(ff), x(xx) {} void init( const F& ff, const X& xx ) const { Maybe_Var_Inv::remake( f, ff ); Maybe_Var_Inv::remake( x, xx ); } R operator()() const { return Maybe_Var_Inv::clone(f)( Maybe_Var_Inv::clone(x), reuser1(this) ); } }; template struct reuser1 { typedef typename F::template result::type R; typedef typename boost::phoenix::function fun0_type; typedef Thunk1 M; typedef M result_type; boost::intrusive_ptr ref; reuser1(a_unique_type_for_nil) {} reuser1(const M* m) : ref(m) {} M operator()( const F& f, const X& x ) { if( !ref ) ref = boost::intrusive_ptr( new M(f,x) ); else ref->init(f,x); return *ref; } void iter( const F& f, const X& x ) { if( ref ) ref->init(f,x); } }; ////////////////////////////////////////////////////////////////////// // reuser2 is needed in list ////////////////////////////////////////////////////////////////////// template struct reuser2; template struct Thunk2 : public ThunkImpl { mutable F f; mutable X x; mutable Y y; Thunk2( const F& ff, const X& xx, const Y& yy ) : f(ff), x(xx), y(yy) {} void init( const F& ff, const X& xx, const Y& yy ) const { Maybe_Var_Inv::remake( f, ff ); Maybe_Var_Inv::remake( x, xx ); Maybe_Var_Inv::remake( y, yy ); } R operator()() const { return Maybe_Var_Inv::clone(f)( Maybe_Var_Inv::clone(x), Maybe_Var_Inv::clone(y), reuser2(this) ); } }; template struct reuser2 { typedef typename F::template result::type R; typedef Thunk2 M; typedef M result_type; boost::intrusive_ptr ref; reuser2(a_unique_type_for_nil) {} reuser2(const M* m) : ref(m) {} M operator()( const F& f, const X& x, const Y& y ) { if( !ref ) ref = boost::intrusive_ptr( new M(f,x,y) ); else ref->init(f,x,y); return *ref; } void iter( const F& f, const X& x, const Y& y ) { if( ref ) ref->init(f,x,y); } }; ////////////////////////////////////////////////////////////////////// // reuser3 ////////////////////////////////////////////////////////////////////// template struct reuser3; template struct Thunk3 : public ThunkImpl { mutable F f; mutable X x; mutable Y y; mutable Z z; Thunk3( const F& ff, const X& xx, const Y& yy, const Z& zz ) : f(ff), x(xx), y(yy), z(zz) {} void init( const F& ff, const X& xx, const Y& yy, const Z& zz ) const { Maybe_Var_Inv::remake( f, ff ); Maybe_Var_Inv::remake( x, xx ); Maybe_Var_Inv::remake( y, yy ); Maybe_Var_Inv::remake( z, zz ); } R operator()() const { return Maybe_Var_Inv::clone(f)( Maybe_Var_Inv::clone(x), Maybe_Var_Inv::clone(y), Maybe_Var_Inv::clone(z), reuser3(this) ); } }; template struct reuser3 { typedef typename F::template result::type R; typedef Thunk3 M; typedef M result_type; boost::intrusive_ptr ref; reuser3(a_unique_type_for_nil) {} reuser3(const M* m) : ref(m) {} M operator()( const F& f, const X& x, const Y& y, const Z& z ) { if( !ref ) ref = boost::intrusive_ptr( new M(f,x,y,z) ); else ref->init(f,x,y,z); return *ref; } void iter( const F& f, const X& x, const Y& y, const Z& z ) { if( ref ) ref->init(f,x,y,z); } }; ////////////////////////////////////////////////////////////////////// // reuser4 ////////////////////////////////////////////////////////////////////// template struct reuser4; template struct Thunk4 : public ThunkImpl { mutable F f; mutable W w; mutable X x; mutable Y y; mutable Z z; Thunk4( const F& ff, const W& ww, const X& xx, const Y& yy, const Z& zz ) : f(ff), w(ww), x(xx), y(yy), z(zz) {} void init( const F& ff, const W& ww, const X& xx, const Y& yy, const Z& zz ) const { Maybe_Var_Inv::remake( f, ff ); Maybe_Var_Inv::remake( w, ww ); Maybe_Var_Inv::remake( x, xx ); Maybe_Var_Inv::remake( y, yy ); Maybe_Var_Inv::remake( z, zz ); } R operator()() const { return Maybe_Var_Inv::clone(f)( Maybe_Var_Inv::clone(w), Maybe_Var_Inv::clone(x), Maybe_Var_Inv::clone(y), Maybe_Var_Inv::clone(z), reuser4(this) ); } }; template struct reuser4 { typedef typename F::template result::type R; typedef Thunk4 M; typedef M result_type; boost::intrusive_ptr ref; reuser4(a_unique_type_for_nil) {} reuser4(const M* m) : ref(m) {} M operator()( const F& f, const W& w, const X& x, const Y& y, const Z& z ) { if( !ref ) ref = boost::intrusive_ptr( new M(f,w,x,y,z) ); else ref->init(f,w,x,y,z); return *ref; } void iter( const F& f, const W& w, const X& x, const Y& y, const Z& z ) { if( ref ) ref->init(f,w,x,y,z); } }; } } } #endif