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) 2013 The University of Western Sydney, Australia. // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Cone_spanners_2/include/CGAL/Cone_spanners_2/Plane_scan_tree.h $ // $Id: include/CGAL/Cone_spanners_2/Plane_scan_tree.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Quincy Tse, Weisheng Si /* Plane_scan_tree.h * * This header defines the class Plane_scan_tree, the data structure for the balanced search tree used in * the Narasimhan and Smid's algorithm for constructing Theta graph. * Implementations of members in this class can be found in Plane_scan_tree_impl.h. */ #ifndef CGAL_PLANE_SCAN_TREE_H #define CGAL_PLANE_SCAN_TREE_H #include #include #include #include #include #include namespace CGAL { /* This namespace contains the internal implementation of the tree for building Theta graph. * This is not meant to be imported by other code. */ namespace ThetaDetail { /* * This is the balanced tree structure needed in Narasimhan and Smid's book, * but implemented using a partial ternary B+ tree instead of red-black tree. * * This tree supports insert and search only, and, similar to a treap, is able * to determine not only the ordering according to a primary order specified * in the key_compare, but is also able to determine minimum weighted value * according to value_compare. Any single operation on this tree is guaranteed * to be at worst O(log n), and builds the tree from a list at O(nlogn). * * !!! Note: No two keys in the tree may have equal ordering * according to key_compare. Results are undefined if key_compare does not give * unique ordering of the inserted keys. The `Less_by_direction_2` functor implemented * by us guarantees the unique ordering, and is passed to Comp and VComp. * * see G. Narasimhan and M. Smid, Geometric Spanner Networks: Cambridge * University Press, 2007, p. 71 */ template , typename VComp=std::less > class Plane_scan_tree { private: typedef _Node _node_type; typedef typename _node_type::_leaf_type _leaf_type; typedef typename _node_type::_internal_type _internal_type; public: typedef typename _node_type::key_type key_type; typedef typename _node_type::mapped_type mapped_type; typedef typename _node_type::value_type value_type; typedef typename _node_type::key_compare key_compare; typedef typename _node_type::value_compare value_compare; typedef value_type& reference; typedef const value_type& const_reference; typedef value_type* pointer; typedef const value_type* const_pointer; typedef _Iterator iterator; typedef _RIterator reverse_iterator; typedef iterator const_iterator; typedef reverse_iterator const_reverse_iterator; typedef size_t size_type; /* Explicit Constructor. */ explicit Plane_scan_tree (const key_compare& comp = key_compare(), const value_compare& vcomp = value_compare()) : less (comp), vless (vcomp), root (nullptr), m_min (nullptr), m_max (nullptr), _size (0) {} /* Constructor */ template Plane_scan_tree (InputIterator first, InputIterator last, const key_compare& comp = key_compare(), const value_compare& vcomp = value_compare()) : less (comp), vless (vcomp), root (nullptr), m_min (nullptr), m_max (nullptr), _size (0) { // builds the tree /* Note: a more efficient algorithm building the tree bottom up may be worth implementing later */ for (; first != last; ++first) add (first->first, first->second); } /* Destructor. This will recursively destroy all nodes in the tree, making * all iterators and pointers to values stored in this tree invalid. */ ~Plane_scan_tree () { delete root; root = nullptr; m_min = nullptr; m_max = nullptr; _size = 0;; } /* Returns the number of key-value pairs in the tree * * @return The number of key-value pairs in the tree. */ size_t size() const { return _size; } /* Inserts a key-value pair into the tree. * @param k The key * @param v The value */ void add (const key_type& k, const mapped_type& v) { if (nullptr == root) { m_min = new _leaf_type (less, vless, this); m_max = m_min; root = m_min; } _leaf_type* l = root->leafNode(k); l->add(k, v); _size++; } /* find a key */ iterator find(const key_type& k) { _leaf_type* l = root->leafNode(k); return iterator (l, k); } /* find a constant key */ const_iterator find(const key_type& k) const { _leaf_type* l = root->leafNode(k); return const_iterator (l, k); } /* Returns the minimum value that has a key strictly greater than * the specified key. * * @param x The threshold key * @return The minimum value whose key is strictly greater than x. */ const mapped_type* minAbove (const key_type& x) const { if (nullptr == root) return nullptr; return root->minAbove(x); } /* Begin Iterator */ inline iterator begin() { return iterator (this->m_min); } /* Const Begin Iterator */ inline const_iterator begin() const { return const_iterator (this->m_min); } /* End Iterator */ inline iterator end() { return iterator(); } /* Constant End Iterator */ inline const_iterator end() const { return const_iterator(); } /* Reverse order Begin Iterator */ inline reverse_iterator rbegin() { return reverse_iterator (this->m_max); } /* Constant Reverse order Begin Iterator */ const_reverse_iterator rbegin() const { return const_reverse_iterator (this->m_max); } /* Reverse order End Iterator */ reverse_iterator rend() { return reverse_iterator(); } /* Constant Reverse order End Iterator */ const_reverse_iterator rend() const { return const_reverse_iterator(); } friend class _Leaf; friend class _Internal; friend std::ostream& operator<< (std::ostream& os, const Plane_scan_tree& pst) { os << *pst.root << std::endl; return os; } protected: private: /* key_compare funtor */ const key_compare less; /* value_compare funtor */ const value_compare vless; /* pointer to root */ _node_type* root; /* pointer to m_min */ _leaf_type* m_min; /* pointer to m_max */ _leaf_type* m_max; /* size of the tree */ size_t _size; }; } // namespace ThetaDetail } // namespace CGAL #endif