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) 2007 INRIA Sophia-Antipolis (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org) // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h $ // $Id: include/CGAL/Hilbert_sort_median_3.h b26b07a1242 $ // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Christophe Delage #ifndef CGAL_HILBERT_SORT_MEDIAN_3_H #define CGAL_HILBERT_SORT_MEDIAN_3_H #include #include #include #include #include #ifdef CGAL_LINKED_WITH_TBB #include #endif namespace CGAL { namespace internal { template struct Hilbert_cmp_3; template struct Hilbert_cmp_3 : public CGAL::cpp98::binary_function { typedef typename K::Point_3 Point; K k; Hilbert_cmp_3 (const K &_k) : k(_k) {} bool operator() (const Point &p, const Point &q) const { return Hilbert_cmp_3 (k) (q, p); } }; template struct Hilbert_cmp_3 : public CGAL::cpp98::binary_function { typedef typename K::Point_3 Point; K k; Hilbert_cmp_3 (const K &_k) : k(_k) {} bool operator() (const Point &p, const Point &q) const { return k.less_x_3_object() (p, q); } }; template struct Hilbert_cmp_3 : public CGAL::cpp98::binary_function { typedef typename K::Point_3 Point; K k; Hilbert_cmp_3 (const K &_k) : k(_k) {} bool operator() (const Point &p, const Point &q) const { return k.less_y_3_object() (p, q); } }; template struct Hilbert_cmp_3 : public CGAL::cpp98::binary_function { typedef typename K::Point_3 Point; K k; Hilbert_cmp_3 (const K &_k) : k(_k) {} bool operator() (const Point &p, const Point &q) const { return k.less_z_3_object() (p, q); } }; } // namespace internal #ifdef __clang__ #define CGAL_VISIBILITY_MACRO __attribute__ ((visibility ("hidden"))) #else #define CGAL_VISIBILITY_MACRO #endif template class CGAL_VISIBILITY_MACRO Hilbert_sort_median_3 { public: typedef Hilbert_sort_median_3 Self; typedef K Kernel; typedef typename Kernel::Point_3 Point; private: Kernel _k; std::ptrdiff_t _limit; template struct Cmp : public internal::Hilbert_cmp_3 { Cmp (const Kernel &k) : internal::Hilbert_cmp_3 (k) {} }; public: Hilbert_sort_median_3 (const Kernel &k, std::ptrdiff_t limit = 1) : _k(k), _limit (limit) {} template void recursive_sort (RandomAccessIterator begin, RandomAccessIterator end) const { const int y = (x + 1) % 3, z = (x + 2) % 3; if (end - begin <= _limit) return; RandomAccessIterator m0 = begin, m8 = end; RandomAccessIterator m4 = internal::hilbert_split (m0, m8, Cmp< x, upx> (_k)); RandomAccessIterator m2 = internal::hilbert_split (m0, m4, Cmp< y, upy> (_k)); RandomAccessIterator m1 = internal::hilbert_split (m0, m2, Cmp< z, upz> (_k)); RandomAccessIterator m3 = internal::hilbert_split (m2, m4, Cmp< z, !upz> (_k)); RandomAccessIterator m6 = internal::hilbert_split (m4, m8, Cmp< y, !upy> (_k)); RandomAccessIterator m5 = internal::hilbert_split (m4, m6, Cmp< z, upz> (_k)); RandomAccessIterator m7 = internal::hilbert_split (m6, m8, Cmp< z, !upz> (_k)); recursive_sort (m0, m1); recursive_sort (m1, m2); recursive_sort (m2, m3); recursive_sort (m3, m4); recursive_sort (m4, m5); recursive_sort (m5, m6); recursive_sort (m6, m7); recursive_sort (m7, m8); } template struct Recursive_sort { const Self& hs; RandomAccessIterator begin,end; Recursive_sort(const Self& hs, RandomAccessIterator begin, RandomAccessIterator end) : hs(hs), begin(begin), end(end) {} void operator()() const { hs.recursive_sort(begin,end); } }; template struct Hilbert_split { RandomAccessIterator& res; RandomAccessIterator begin, end; const Comp& comp; Hilbert_split(RandomAccessIterator& res, RandomAccessIterator begin, RandomAccessIterator end, const Comp& comp) : res(res), begin(begin), end(end), comp(comp) {} void operator()() const { res = internal::hilbert_split(begin, end, comp); } }; template void sort (RandomAccessIterator begin, RandomAccessIterator end, Parallel_tag) const { #ifndef CGAL_LINKED_WITH_TBB CGAL_USE(begin); CGAL_USE(end); static_assert (!std::is_convertible::value, "Parallel_tag is enabled but TBB is unavailable."); #else const int y = (x + 1) % 3, z = (x + 2) % 3; if ((end - begin) <= _limit) return; RandomAccessIterator m0 = begin, m8 = end; if((end - begin) > 2048){ // 2^11, empirically a good cutoff RandomAccessIterator m1, m2, m3, m4, m5, m6, m7; m4 = internal::hilbert_split(m0, m8, Cmp(_k)); tbb::parallel_invoke(Hilbert_split >(m2, m0, m4, Cmp(_k)), Hilbert_split >(m6, m4, m8, Cmp(_k))); tbb::parallel_invoke(Hilbert_split >(m1, m0, m2, Cmp(_k)), Hilbert_split >(m3, m2, m4, Cmp(_k)), Hilbert_split >(m5, m4, m6, Cmp(_k)), Hilbert_split >(m7, m6, m8, Cmp(_k))); tbb::parallel_invoke(Recursive_sort(*this, m0, m1), Recursive_sort(*this, m1, m2), Recursive_sort(*this, m2, m3), Recursive_sort(*this, m3, m4), Recursive_sort(*this, m4, m5), Recursive_sort(*this, m5, m6), Recursive_sort(*this, m6, m7), Recursive_sort(*this, m7, m8)); } else { recursive_sort<0, false, false, false>(begin, end); } #endif } template void sort (RandomAccessIterator begin, RandomAccessIterator end, Sequential_tag) const { recursive_sort<0, false, false, false>(begin, end); } template void operator() (RandomAccessIterator begin, RandomAccessIterator end) const { sort <0, false, false, false> (begin, end, ConcurrencyTag()); } }; } // namespace CGAL #endif//CGAL_HILBERT_SORT_MEDIAN_3_H