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) 1997-2000 // Utrecht University (The Netherlands), // ETH Zurich (Switzerland), // INRIA Sophia-Antipolis (France), // Max-Planck-Institute Saarbruecken (Germany), // and Tel-Aviv University (Israel). All rights reserved. // // This file is part of CGAL (www.cgal.org) // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Hash_map/include/CGAL/Hash_map/internal/chained_map.h $ // $Id: include/CGAL/Hash_map/internal/chained_map.h b26b07a1242 $ // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Courtesy of LEDA #ifndef CGAL_HASH_MAP_INTERNAL_CHAINED_MAP_H #define CGAL_HASH_MAP_INTERNAL_CHAINED_MAP_H #include #include #include #include #include #include namespace CGAL { namespace internal { template class chained_map; template class chained_map_elem; template class chained_map_elem { template friend class chained_map; std::size_t k; T i; chained_map_elem* succ; }; template class chained_map { static constexpr std::size_t nullkey = (std::numeric_limits::max)(); chained_map_elem* table; chained_map_elem* table_end; chained_map_elem* freelist; std::size_t table_size; std::size_t table_size_1; typedef std::allocator_traits Allocator_traits; typedef typename Allocator_traits::template rebind_alloc > allocator_type; allocator_type alloc; std::size_t reserved_size; T def; public: T& xdef() { return def; } const T& cxdef() const { return def; } private: void init_inf(T& x) const { x = def; } chained_map_elem* HASH(std::size_t x) const { return table + (x & table_size_1); } void init_table(std::size_t n); void rehash(); inline void insert(std::size_t x, T y); void destroy(chained_map_elem* item) { typedef std::allocator_traits Allocator_type_traits; Allocator_type_traits::destroy(alloc,item); } public: static constexpr std::size_t min_size = 32; static constexpr std::size_t default_size = 512; typedef chained_map_elem* Item; std::size_t index(Item it) const { return it->k; } T& inf(Item it) const { return it->i; } chained_map(std::size_t n = default_size, const T& d = T()); chained_map(const chained_map& D); chained_map& operator=(const chained_map& D); chained_map(chained_map&& D) noexcept(std::is_nothrow_move_constructible_v && std::is_nothrow_move_constructible_v); chained_map& operator=(chained_map&& D) noexcept(std::is_nothrow_move_assignable_v && std::is_nothrow_move_assignable_v); void reserve(std::size_t n); void clear(); ~chained_map() { if(!table) return; for (Item item = table ; item != table_end ; ++item) destroy(item); alloc.deallocate(table, table_end - table); } T& access(Item p, std::size_t x); T& access(std::size_t x); Item lookup(std::size_t x) const; void statistics() const; }; template inline T& chained_map::access(std::size_t x) { if(!table) init_table(reserved_size); Item p = HASH(x); if ( p->k == x ) { return p->i; } else { if ( p->k == nullkey ) { p->k = x; init_inf(p->i); // initializes p->i to xdef return p->i; } else return access(p,x); } } template void chained_map::init_table(std::size_t n) { std::size_t t = min_size; while (t < n) t <<= 1; table_size = t; table_size_1 = t-1; table = alloc.allocate(t + t/2); for (std::size_t i = 0 ; i < t + t/2 ; ++i){ std::allocator_traits::construct(alloc,table + i); } freelist = table + t; table_end = table + t + t/2; for (Item p = table; p < freelist; ++p) { p->succ = nullptr; p->k = nullkey; } } template inline void chained_map::insert(std::size_t x, T y) { Item q = HASH(x); if ( q->k == nullkey ) { q->k = x; q->i = y; } else { freelist->k = x; freelist->i = y; freelist->succ = q->succ; q->succ = freelist++; } } template void chained_map::rehash() { chained_map_elem* old_table = table; chained_map_elem* old_table_end = table_end; Item old_table_mid = table + table_size; init_table(2*table_size); Item p; for(p = old_table; p < old_table_mid; ++p) { std::size_t x = p->k; if ( x != nullkey ) // list p is non-empty { Item q = HASH(x); q->k = x; q->i = p->i; } } while (p < old_table_end) { std::size_t x = p->k; insert(x,p->i); ++p; } for (Item item = old_table ; item != old_table_end ; ++item) destroy(item); alloc.deallocate(old_table, old_table_end - old_table); } template T& chained_map::access(Item p, std::size_t x) { Item q = p->succ; while (q && q->k != x) q = q->succ; if (q) { return q->i; } // index x not present, insert it if (freelist == table_end) // table full: rehash { rehash(); p = HASH(x); } if (p->k == nullkey) { p->k = x; init_inf(p->i); // initializes p->i to xdef return p->i; } q = freelist++; q->k = x; init_inf(q->i); // initializes q->i to xdef q->succ = p->succ; p->succ = q; return q->i; } template chained_map::chained_map(std::size_t n, const T& d) : table(nullptr), reserved_size(n), def(d) { } template chained_map::chained_map(const chained_map& D) { init_table(D.table_size); for(Item p = D.table; p < D.freelist; ++p) { if (p->k != nullkey || p >= D.table + D.table_size) { insert(p->k,p->i); //D.copy_inf(p->i); // see chapter Implementation } } } template chained_map::chained_map(chained_map&& D) noexcept(std::is_nothrow_move_constructible_v && std::is_nothrow_move_constructible_v) : table(std::exchange(D.table, nullptr)) , table_end(std::exchange(D.table_end, nullptr)) , freelist(std::exchange(D.freelist, nullptr)) , table_size(std::exchange(D.table_size, 0)) , table_size_1(std::exchange(D.table_size_1, 0)) , alloc(std::move(D.alloc)) , reserved_size(std::exchange(D.reserved_size, 0)) , def(std::move(D.def)) {} template chained_map& chained_map::operator=(const chained_map& D) { clear(); init_table(D.table_size); for(Item p = D.table; p < D.freelist; ++p) { if (p->k != nullkey || p >= D.table + D.table_size) { insert(p->k,p->i); //copy_inf(p->i); // see chapter Implementation } } return *this; } template chained_map& chained_map::operator=(chained_map&& D) noexcept(std::is_nothrow_move_assignable_v && std::is_nothrow_move_assignable_v) { clear(); table = std::exchange(D.table, nullptr); table_end = std::exchange(D.table_end, nullptr); freelist = std::exchange(D.freelist, nullptr); table_size = std::exchange(D.table_size, 0); table_size_1 = std::exchange(D.table_size_1, 0); alloc = std::move(D.alloc); reserved_size = std::exchange(D.reserved_size, 0); def = std::move(D.def); return *this; } template void chained_map::reserve(std::size_t n) { CGAL_assertion(!table); reserved_size = n; } template void chained_map::clear() { if(!table) return; for (Item item = table ; item != table_end ; ++item) destroy(item); alloc.deallocate(table, table_end - table); table = nullptr; } template typename chained_map::Item chained_map::lookup(std::size_t x) const { if(!table) return nullptr; Item p = HASH(x); while (p && p->k != x) { p = p->succ; } return p; } template void chained_map::statistics() const { std::cout << "table_size: " << table_size <<"\n"; std::size_t n = 0; for (Item p = table; p < table + table_size; ++p) if (p ->k != nullkey) ++n; std::size_t used_in_overflow = freelist - (table + table_size ); n += used_in_overflow; std::cout << "number of entries: " << n << "\n"; std::cout << "fraction of entries in first position: " << ((double) (n - used_in_overflow))/n <<"\n"; std::cout << "fraction of empty lists: " << ((double) (n - used_in_overflow))/table_size<<"\n"; } } // namespace internal } //namespace CGAL #endif // CGAL_HASH_MAP_INTERNAL_CHAINED_MAP_H