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/Tree_base.h $ // $Id: include/CGAL/Tree_base.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Gabriele Neyer #ifndef CGAL_TREE_BASE_H #define CGAL_TREE_BASE_H #include #include #include #include #include #include #include #ifndef CGAL_TREE_BASE_nullptr #define CGAL_TREE_BASE_nullptr 0 #endif #define stlvector namespace CGAL { //link type definition of an ordinary vertex of the tree template < typename Node > struct Tree_node_base { Node *parent_link; Node *left_link; Node *right_link; Tree_node_base() : parent_link(0), left_link(0), right_link(0) {} Tree_node_base(Node* ll, Node* rl) : parent_link(0), left_link(ll), right_link(rl) {} }; // ------------------------------------------------------------------- // pure virtual abstract base class. // Designed according to the Prototype Design Pattern // A tree class has to be derived from this class. template class Tree_base { protected: Tree_base(Tree_base const &); // prevent access void operator= (Tree_base const &); // prevent access public: typedef double vit; typedef int lit; typedef int lbit; typedef double vbit; typedef char oit; // typedef std::vector::iterator vit; //typedef std::list::iterator lit; //typedef std::back_insert_iterator lbit; //typedef std::back_insert_iterator vbit; typedef Tree_base Tree_base_type; Tree_base() {} virtual ~Tree_base() {} // 'clone()' returns an object which can be used as argument to 'delete' virtual Tree_base *clone() const = 0; //virtual Tree_base_type *clone() const = 0; // 'make_tree()' returns an object which can be used as argument to 'delete' virtual bool make_tree(const typename std::list::iterator& beg, const typename std::list::iterator& end, lit *dummy=0) =0; #ifdef stlvector virtual bool make_tree(const typename std::vector::iterator& beg, const typename std::vector::iterator& end, vit *dummy=0) =0; #endif #ifdef carray virtual bool make_tree(const C_Data *beg, const C_Data *end) =0; #endif virtual std::back_insert_iterator< std::list > window_query(C_Window const &win, std::back_insert_iterator< std::list > out,lbit *dummy=0 ) = 0; virtual std::back_insert_iterator< std::vector > window_query(C_Window const &win, std::back_insert_iterator< std::vector > out,vbit *dummy=0) = 0; #ifdef carray virtual C_Data * window_query( C_Window const &win, C_Data * out) = 0; #endif #ifdef ostreamiterator typedef std::ostream_iterator< C_Data> oit; virtual std::ostream_iterator< C_Data> window_query( C_Window const &win, std::ostream_iterator< C_Data> out, oit *dummy=0 ) = 0; #endif virtual std::back_insert_iterator< std::list< C_Data> > enclosing_query( C_Window const &win, std::back_insert_iterator< std::list< C_Data> > out, lbit *dummy=0 ) = 0; virtual std::back_insert_iterator< std::vector< C_Data> > enclosing_query( C_Window const &win, std::back_insert_iterator< std::vector< C_Data> > out,vbit *dummy=0 ) = 0; #ifdef carray virtual C_Data * enclosing_query( C_Window const &win, C_Data *out) = 0; #endif #ifdef ostreamiterator virtual std::ostream_iterator< C_Data> enclosing_query( C_Window const &win, std::ostream_iterator< C_Data> out, oit *dummy=0) = 0; #endif virtual bool is_inside( C_Window const &win, C_Data const& object) const =0; virtual bool is_anchor()const =0; virtual bool is_valid()const =0; }; // ------------------------------------------------------------------- // Tree Anchor: this class is used as a recursion anchor. // The derived tree classes can be nested. Use this class as the // most inner class. This class is doing nothing except stopping the recursion template class Tree_anchor: public Tree_base< C_Data, C_Window> { public: // Construct a factory with the given factory as sublayer Tree_anchor() {} virtual ~Tree_anchor(){} Tree_base *clone() const { return new Tree_anchor(); } typedef Tree_base tbt; // Tree_base_type *clone() const { return new Tree_anchor(); } bool make_tree(const typename std::list< C_Data>::iterator& /*beg*/, const typename std::list< C_Data>::iterator& /*end*/, typename tbt::lit * =0) { return true; } #ifdef stlvector bool make_tree(const typename std::vector< C_Data>::iterator& /*beg*/, const typename std::vector< C_Data>::iterator& /*end*/, typename tbt::vit * =0) { return true; } #endif #ifdef carray bool make_tree(const C_Data * /*beg*/, const C_Data * /*end*/) { return true; } #endif std::back_insert_iterator< std::list< C_Data> > window_query( C_Window const &, std::back_insert_iterator< std::list< C_Data> > out, typename tbt::lbit * =0){ return out; } std::back_insert_iterator< std::vector< C_Data> > window_query( C_Window const &, std::back_insert_iterator< std::vector< C_Data> > out, typename tbt::vbit * =0){ return out; } #ifdef carray C_Data * window_query( C_Window const &, C_Data * out){ return out; } #endif #ifdef ostreamiterator std::ostream_iterator< C_Data> window_query( C_Window const &, std::ostream_iterator< C_Data> out, typename tbt::oit *dummy=0){ return out; } #endif std::back_insert_iterator< std::list< C_Data> > enclosing_query( C_Window const &, std::back_insert_iterator< std::list< C_Data> > out, typename tbt::lbit * =0){ return out; } std::back_insert_iterator< std::vector< C_Data> > enclosing_query( C_Window const &, std::back_insert_iterator< std::vector< C_Data> > out, typename tbt::vbit * =0){ return out; } #ifdef carray C_Data * enclosing_query( C_Window const &, C_Data * out){ return out; } #endif #ifdef ostreamiterator std::ostream_iterator< C_Data> enclosing_query( C_Window const &, std::ostream_iterator< C_Data> out, typename tbt::oit *dummy=0){ return out; } #endif bool is_valid()const{ return true;} protected: bool is_inside( C_Window const &, C_Data const&) const { return true; } bool is_anchor()const {return true;} }; } //namespace CGAL #endif