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 ETH Zurich (Switzerland). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/SearchStructures/include/CGAL/Segment_tree_k.h $ // $Id: include/CGAL/Segment_tree_k.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Gabriele Neyer #ifndef CGAL_SEGMENT_TREE_K_H #define CGAL_SEGMENT_TREE_K_H #include // Predefined k-dimensional Segment Trees (k=1..4) // The trees can either be templated with d arbitrary types // (e.g., Segment_tree_3) // or with an unary type for each dimension // (e.g., Segment_tree_uni_4). // The container class and sequence container class as well as the // data accessors are defined in these classes. #include #include #include #include #include #include namespace CGAL { template class Segment_tree_1 { public: typedef C_Traits_1 Traits; typedef typename C_Traits_1::Key Key; typedef typename C_Traits_1::Interval Interval; typedef typename C_Traits_1::Key_1 Key_1; typedef typename C_Traits_1::key_1 key_1; typedef typename C_Traits_1::low_1 low_1; typedef typename C_Traits_1::high_1 high_1; typedef typename C_Traits_1::compare_1 compare_1; typedef tree_interval_traits I1; typedef Tree_anchor Tree_anchor_type; Tree_anchor_type *anchor; typedef Segment_tree_d Segment_tree_1_type; Segment_tree_1_type * segment_tree_1; Segment_tree_1() : anchor(new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)) {} template Segment_tree_1(const T& first, const T& last) : anchor(new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)) { segment_tree_1->make_tree(first,last); } template bool make_tree(const T& first, const T& last) { delete segment_tree_1; delete anchor; anchor = new Tree_anchor_type; segment_tree_1 = new Segment_tree_1_type(*anchor); return segment_tree_1->make_tree(first,last); } template T window_query(Interval const &win, const T& result) { return segment_tree_1->window_query(win, result); } template T enclosing_query(Interval const &win, const T& result) { return segment_tree_1->enclosing_query(win, result); } ~Segment_tree_1() { if (segment_tree_1!=0) delete segment_tree_1; if (anchor!=0) delete anchor; } }; //------------------------------------------------------------------- // A two dimensional Segment Tree is defined in this class. // Ti is the type of each dimension of the tree. template class Segment_tree_2 { public: typedef C_Traits_2 Traits; typedef typename C_Traits_2::Key Key; typedef typename C_Traits_2::Interval Interval; typedef typename C_Traits_2::Key_2 Key_2; typedef typename C_Traits_2::Key_1 Key_1; typedef typename C_Traits_2::key_1 key_1; typedef typename C_Traits_2::key_2 key_2; typedef typename C_Traits_2::low_1 low_1; typedef typename C_Traits_2::high_1 high_1; typedef typename C_Traits_2::low_2 low_2; typedef typename C_Traits_2::high_2 high_2; typedef typename C_Traits_2::compare_1 compare_1; typedef typename C_Traits_2::compare_2 compare_2; typedef typename std::list::iterator l_iterator; typedef typename std::vector::iterator v_iterator; typedef tree_interval_traits I1; typedef tree_interval_traits I2; typedef Tree_anchor Tree_anchor_type; Tree_anchor_type *anchor; typedef Segment_tree_d Segment_tree_1_type; Segment_tree_1_type * segment_tree_1; typedef Segment_tree_d Segment_tree_2_type; Segment_tree_2_type *segment_tree_2; Segment_tree_2() : anchor( new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)), segment_tree_2(new Segment_tree_2_type(*segment_tree_1)) {} template Segment_tree_2(const T& first, const T& last) : anchor( new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)), segment_tree_2(new Segment_tree_2_type(*segment_tree_1)) { segment_tree_2->make_tree(first,last); } template bool make_tree(const T& first, const T& last) { delete segment_tree_2; delete segment_tree_1; delete anchor; anchor = new Tree_anchor_type; segment_tree_1 = new Segment_tree_1_type(*anchor); segment_tree_2 = new Segment_tree_2_type(*segment_tree_1); return segment_tree_2->make_tree(first,last); } template T window_query(Interval const &win, const T& result) { return segment_tree_2->window_query(win, result); } template T enclosing_query(Interval const &win, const T& result) { return segment_tree_2->enclosing_query(win, result); } ~Segment_tree_2() { if (segment_tree_2!=0) delete segment_tree_2; if (segment_tree_1!=0) delete segment_tree_1; if (anchor!=0) delete anchor; } }; //------------------------------------------------------------------- // A three dimensional Segment Tree is defined in this class. // Ti is the type of each dimension of the tree. template class Segment_tree_3 { public: typedef C_Traits_3 Traits; typedef typename C_Traits_3::Key Key; typedef typename C_Traits_3::Interval Interval; typedef typename C_Traits_3::Key_1 Key_1; typedef typename C_Traits_3::Key_2 Key_2; typedef typename C_Traits_3::Key_3 Key_3; typedef typename C_Traits_3::key_1 key_1; typedef typename C_Traits_3::key_2 key_2; typedef typename C_Traits_3::key_3 key_3; typedef typename C_Traits_3::low_1 low_1; typedef typename C_Traits_3::high_1 high_1; typedef typename C_Traits_3::low_2 low_2; typedef typename C_Traits_3::high_2 high_2; typedef typename C_Traits_3::low_3 low_3; typedef typename C_Traits_3::high_3 high_3; typedef typename C_Traits_3::compare_1 compare_1; typedef typename C_Traits_3::compare_2 compare_2; typedef typename C_Traits_3::compare_3 compare_3; typedef typename std::list::iterator l_iterator; typedef typename std::vector::iterator v_iterator; typedef tree_interval_traits I1; typedef tree_interval_traits I2; typedef tree_interval_traits I3; typedef Tree_anchor Tree_anchor_type; Tree_anchor_type *anchor; typedef Segment_tree_d Segment_tree_1_type; Segment_tree_1_type * segment_tree_1; typedef Segment_tree_d Segment_tree_2_type; Segment_tree_2_type *segment_tree_2; typedef Segment_tree_d Segment_tree_3_type; Segment_tree_3_type *segment_tree_3; Segment_tree_3() : anchor(new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)), segment_tree_2(new Segment_tree_2_type(*segment_tree_1)), segment_tree_3(new Segment_tree_3_type(*segment_tree_2)) {} template Segment_tree_3(const T& first, const T& last) : anchor(new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)), segment_tree_2(new Segment_tree_2_type(*segment_tree_1)), segment_tree_3(new Segment_tree_3_type(*segment_tree_2)) { segment_tree_3->make_tree(first,last); } template bool make_tree(const T& first, const T& last) { delete segment_tree_3; delete segment_tree_2; delete segment_tree_1; delete anchor; anchor = new Tree_anchor_type; segment_tree_1 = new Segment_tree_1_type(*anchor); segment_tree_2 = new Segment_tree_2_type(*segment_tree_1); segment_tree_3 = new Segment_tree_3_type(*segment_tree_2); return segment_tree_3->make_tree(first,last); } template T window_query(Interval const &win, const T& result) { return (*segment_tree_3).window_query(win, result); } template T enclosing_query(Interval const &win, const T& result) { return (*segment_tree_3).enclosing_query(win, result); } ~Segment_tree_3() { if (segment_tree_3!=0) delete segment_tree_3; if (segment_tree_2!=0) delete segment_tree_2; if (segment_tree_1!=0) delete segment_tree_1; if (anchor!=0) delete anchor; } }; //------------------------------------------------------------------- // A three dimensional Segment Tree is defined in this class. // Ti is the type of each dimension of the tree. template class Segment_tree_4 { public: typedef C_Traits_4 Traits; typedef typename C_Traits_4::Key Key; typedef typename C_Traits_4::Interval Interval; typedef typename C_Traits_4::Key_1 Key_1; typedef typename C_Traits_4::Key_2 Key_2; typedef typename C_Traits_4::Key_3 Key_3; typedef typename C_Traits_4::Key_4 Key_4; typedef typename C_Traits_4::key_1 key_1; typedef typename C_Traits_4::key_2 key_2; typedef typename C_Traits_4::key_4 key_4; typedef typename C_Traits_4::key_3 key_3; typedef typename C_Traits_4::low_1 low_1; typedef typename C_Traits_4::high_1 high_1; typedef typename C_Traits_4::low_2 low_2; typedef typename C_Traits_4::high_2 high_2; typedef typename C_Traits_4::low_3 low_3; typedef typename C_Traits_4::high_3 high_3; typedef typename C_Traits_4::low_4 low_4; typedef typename C_Traits_4::high_4 high_4; typedef typename C_Traits_4::compare_1 compare_1; typedef typename C_Traits_4::compare_2 compare_2; typedef typename C_Traits_4::compare_3 compare_3; typedef typename C_Traits_4::compare_4 compare_4; typedef typename std::list::iterator l_iterator; typedef typename std::vector::iterator v_iterator; typedef tree_interval_traits I1; typedef tree_interval_traits I2; typedef tree_interval_traits I3; typedef tree_interval_traits I4; typedef Tree_anchor Tree_anchor_type; Tree_anchor_type *anchor; typedef Segment_tree_d Segment_tree_1_type; Segment_tree_1_type * segment_tree_1; typedef Segment_tree_d Segment_tree_2_type; Segment_tree_2_type *segment_tree_2; typedef Segment_tree_d Segment_tree_3_type; Segment_tree_3_type *segment_tree_3; typedef Segment_tree_d Segment_tree_4_type; Segment_tree_4_type *segment_tree_4; Segment_tree_4() : anchor(new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)), segment_tree_2(new Segment_tree_2_type(*segment_tree_1)), segment_tree_3(new Segment_tree_3_type(*segment_tree_2)), segment_tree_4(new Segment_tree_4_type(*segment_tree_3)) {} template Segment_tree_4(const T& first, const T& last) : anchor(new Tree_anchor_type), segment_tree_1(new Segment_tree_1_type(*anchor)), segment_tree_2(new Segment_tree_2_type(*segment_tree_1)), segment_tree_3(new Segment_tree_3_type(*segment_tree_2)), segment_tree_4(new Segment_tree_4_type(*segment_tree_3)) { segment_tree_4->make_tree(first,last); } template bool make_tree(const T& first, const T& last) { delete segment_tree_4; delete segment_tree_3; delete segment_tree_2; delete segment_tree_1; delete anchor; anchor = new Tree_anchor_type; segment_tree_1 = new Segment_tree_1_type(*anchor); segment_tree_2 = new Segment_tree_2_type(*segment_tree_1); segment_tree_3 = new Segment_tree_3_type(*segment_tree_2); segment_tree_4 = new Segment_tree_4_type(*segment_tree_3); return segment_tree_4->make_tree(first,last); } template T window_query(Interval const &win, const T& result) { return (*segment_tree_4).window_query(win, result); } template T enclosing_query(Interval const &win, const T& result) { return (*segment_tree_4).enclosing_query(win, result); } ~Segment_tree_4() { if (segment_tree_4!=0) delete segment_tree_4; if (segment_tree_3!=0) delete segment_tree_3; if (segment_tree_2!=0) delete segment_tree_2; if (segment_tree_1!=0) delete segment_tree_1; if (anchor!=0) delete anchor; } }; } //namespace CGAL #endif