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
// (C) Copyright John Maddock 2005. // 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_MATH_COMPLEX_ASIN_INCLUDED #define BOOST_MATH_COMPLEX_ASIN_INCLUDED #ifndef BOOST_MATH_COMPLEX_DETAILS_INCLUDED # include #endif #ifndef BOOST_MATH_LOG1P_INCLUDED # include #endif #include #ifdef BOOST_NO_STDC_NAMESPACE namespace std{ using ::sqrt; using ::fabs; using ::acos; using ::asin; using ::atan; using ::atan2; } #endif namespace boost{ namespace math{ template [[deprecated("Replaced by C++11")]] inline std::complex asin(const std::complex& z) { // // This implementation is a transcription of the pseudo-code in: // // "Implementing the complex Arcsine and Arccosine Functions using Exception Handling." // T E Hull, Thomas F Fairgrieve and Ping Tak Peter Tang. // ACM Transactions on Mathematical Software, Vol 23, No 3, Sept 1997. // // // These static constants should really be in a maths constants library, // note that we have tweaked the value of a_crossover as per https://svn.boost.org/trac/boost/ticket/7290: // static const T one = static_cast(1); //static const T two = static_cast(2); static const T half = static_cast(0.5L); static const T a_crossover = static_cast(10); static const T b_crossover = static_cast(0.6417L); static const T s_pi = boost::math::constants::pi(); static const T half_pi = s_pi / 2; static const T log_two = boost::math::constants::ln_two(); static const T quarter_pi = s_pi / 4; #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable:4127) #endif // // Get real and imaginary parts, discard the signs as we can // figure out the sign of the result later: // T x = std::fabs(z.real()); T y = std::fabs(z.imag()); T real, imag; // our results // // Begin by handling the special cases for infinities and nan's // specified in C99, most of this is handled by the regular logic // below, but handling it as a special case prevents overflow/underflow // arithmetic which may trip up some machines: // if((boost::math::isnan)(x)) { if((boost::math::isnan)(y)) return std::complex(x, x); if((boost::math::isinf)(y)) { real = x; imag = std::numeric_limits::infinity(); } else return std::complex(x, x); } else if((boost::math::isnan)(y)) { if(x == 0) { real = 0; imag = y; } else if((boost::math::isinf)(x)) { real = y; imag = std::numeric_limits::infinity(); } else return std::complex(y, y); } else if((boost::math::isinf)(x)) { if((boost::math::isinf)(y)) { real = quarter_pi; imag = std::numeric_limits::infinity(); } else { real = half_pi; imag = std::numeric_limits::infinity(); } } else if((boost::math::isinf)(y)) { real = 0; imag = std::numeric_limits::infinity(); } else { // // special case for real numbers: // if((y == 0) && (x <= one)) return std::complex(std::asin(z.real()), z.imag()); // // Figure out if our input is within the "safe area" identified by Hull et al. // This would be more efficient with portable floating point exception handling; // fortunately the quantities M and u identified by Hull et al (figure 3), // match with the max and min methods of numeric_limits. // T safe_max = detail::safe_max(static_cast(8)); T safe_min = detail::safe_min(static_cast(4)); T xp1 = one + x; T xm1 = x - one; if((x < safe_max) && (x > safe_min) && (y < safe_max) && (y > safe_min)) { T yy = y * y; T r = std::sqrt(xp1*xp1 + yy); T s = std::sqrt(xm1*xm1 + yy); T a = half * (r + s); T b = x / a; if(b <= b_crossover) { real = std::asin(b); } else { T apx = a + x; if(x <= one) { real = std::atan(x/std::sqrt(half * apx * (yy /(r + xp1) + (s-xm1)))); } else { real = std::atan(x/(y * std::sqrt(half * (apx/(r + xp1) + apx/(s+xm1))))); } } if(a <= a_crossover) { T am1; if(x < one) { am1 = half * (yy/(r + xp1) + yy/(s - xm1)); } else { am1 = half * (yy/(r + xp1) + (s + xm1)); } imag = boost::math::log1p(am1 + std::sqrt(am1 * (a + one))); } else { imag = std::log(a + std::sqrt(a*a - one)); } } else { // // This is the Hull et al exception handling code from Fig 3 of their paper: // if(y <= (std::numeric_limits::epsilon() * std::fabs(xm1))) { if(x < one) { real = std::asin(x); imag = y / std::sqrt(-xp1*xm1); } else { real = half_pi; if(((std::numeric_limits::max)() / xp1) > xm1) { // xp1 * xm1 won't overflow: imag = boost::math::log1p(xm1 + std::sqrt(xp1*xm1)); } else { imag = log_two + std::log(x); } } } else if(y <= safe_min) { // There is an assumption in Hull et al's analysis that // if we get here then x == 1. This is true for all "good" // machines where : // // E^2 > 8*sqrt(u); with: // // E = std::numeric_limits::epsilon() // u = (std::numeric_limits::min)() // // Hull et al provide alternative code for "bad" machines // but we have no way to test that here, so for now just assert // on the assumption: // BOOST_MATH_ASSERT(x == 1); real = half_pi - std::sqrt(y); imag = std::sqrt(y); } else if(std::numeric_limits::epsilon() * y - one >= x) { real = x/y; // This can underflow! imag = log_two + std::log(y); } else if(x > one) { real = std::atan(x/y); T xoy = x/y; imag = log_two + std::log(y) + half * boost::math::log1p(xoy*xoy); } else { T a = std::sqrt(one + y*y); real = x/a; // This can underflow! imag = half * boost::math::log1p(static_cast(2)*y*(y+a)); } } } // // Finish off by working out the sign of the result: // if((boost::math::signbit)(z.real())) real = (boost::math::changesign)(real); if((boost::math::signbit)(z.imag())) imag = (boost::math::changesign)(imag); return std::complex(real, imag); #ifdef _MSC_VER #pragma warning(pop) #endif } } } // namespaces #endif // BOOST_MATH_COMPLEX_ASIN_INCLUDED