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) 2009-2014 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/Triangulation/include/CGAL/Triangulation_ds_full_cell.h $ // $Id: include/CGAL/Triangulation_ds_full_cell.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Samuel Hornus #ifndef CGAL_TRIANGULATION_DS_FULL_CELL_H #define CGAL_TRIANGULATION_DS_FULL_CELL_H #include #include #include #include #include #include #include #include namespace CGAL { template< class TDS = void, typename FullCellStoragePolicy = Default > class Triangulation_ds_full_cell { typedef typename Default::Get::type Storage_policy; typedef Triangulation_ds_full_cell Self; typedef typename TDS::Maximal_dimension Maximal_dimension; public: typedef TDS Triangulation_data_structure; typedef typename TDS::Face Face; typedef typename TDS::Vertex_handle Vertex_handle; /* Concept */ typedef typename TDS::Vertex_const_handle Vertex_const_handle; typedef typename TDS::Full_cell_handle Full_cell_handle; /* Concept */ typedef typename TDS::Full_cell_const_handle Full_cell_const_handle; typedef typename TDS::Full_cell_data TDS_data; /* data that the TDS wants to be stored here */ template< typename TDS2 > struct Rebind_TDS /* Concept */ { typedef Triangulation_ds_full_cell Other; }; private: // STORAGE typedef TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, Storage_policy > Combinatorics; friend struct TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, Storage_policy >; // array of vertices typedef typename Combinatorics::Vertex_handle_array Vertex_handle_array; // neighbor simplices typedef typename Combinatorics::Full_cell_handle_array Full_cell_handle_array; // NOT DOCUMENTED... typename Combinatorics::Xor_type xor_of_vertices(const int cur_dim) const { return combinatorics_.xor_of_vertices(cur_dim); } public: typedef typename Vertex_handle_array::const_iterator Vertex_handle_const_iterator; typedef Vertex_handle_const_iterator Vertex_handle_iterator; /* Concept */ Triangulation_ds_full_cell(const int dmax) /* Concept */ : combinatorics_(dmax), tds_data_() { CGAL_assertion( dmax > 0 ); for( int i = 0; i <= dmax; ++i ) { set_neighbor(i, Full_cell_handle()); set_vertex(i, Vertex_handle()); set_mirror_index(i, -1); } } Triangulation_ds_full_cell(const Triangulation_ds_full_cell & s) /* Concept */ : combinatorics_(s.combinatorics_), tds_data_(s.tds_data_) {} ~Triangulation_ds_full_cell() {} int maximal_dimension() const /* Concept */ { return static_cast(vertices().size() - 1); } Vertex_handle_const_iterator vertices_begin() const /* Concept */ { return vertices().begin(); } Vertex_handle_const_iterator vertices_end() const /* Concept */ { return vertices().end(); } Vertex_handle vertex(const int i) const /* Concept */ { CGAL_precondition(0<=i && i<=maximal_dimension()); return vertices()[i]; } Full_cell_handle neighbor(const int i) const /* Concept */ { CGAL_precondition(0<=i && i<=maximal_dimension()); return neighbors()[i]; } int mirror_index(const int i) const /* Concept */ { CGAL_precondition(0<=i && i<=maximal_dimension()); return combinatorics_.mirror_index(i); } // Advanced... Vertex_handle mirror_vertex(const int i, const int cur_dim) const /* Concept */ { CGAL_precondition(0<=i && i<=maximal_dimension()); return combinatorics_.mirror_vertex(i, cur_dim); } int index(Full_cell_const_handle s) const /* Concept */ { // WE ASSUME THE FULL CELL WE ARE LOOKING FOR INDEED EXISTS ! CGAL_precondition(has_neighbor(s)); int index(0); while( neighbor(index) != s ) ++index; return index; } int index(Vertex_const_handle v) const /* Concept */ { // WE ASSUME THE VERTEX WE ARE LOOKING FOR INDEED EXISTS ! CGAL_precondition(has_vertex(v)); int index(0); while( vertex(index) != v ) ++index; return index; } void set_vertex(const int i, Vertex_handle v) /* Concept */ { CGAL_precondition(0<=i && i<=maximal_dimension()); vertices()[i] = v; } void set_neighbor(const int i, Full_cell_handle s) /* Concept */ { CGAL_precondition(0<=i && i<=maximal_dimension()); neighbors()[i] = s; } void set_mirror_index(const int i, const int index) /* Concept */ { CGAL_precondition(0<=i && i<=maximal_dimension()); combinatorics_.set_mirror_index(i, index); } bool has_vertex(Vertex_const_handle v) const /* Concept */ { int index; return has_vertex(v, index); } bool has_vertex(Vertex_const_handle v, int & index) const /* Concept */ { const int d = maximal_dimension(); index = 0; while( (index <= d) && (vertex(index) != v) ) ++index; return (index <= d); } bool has_neighbor(Full_cell_const_handle s) const /* Concept */ { int index; return has_neighbor(s, index); } bool has_neighbor(Full_cell_const_handle s, int & index) const /* Concept */ { const int d = maximal_dimension(); index = 0; while( (index <= d) && (neighbor(index) != s) ) ++index; return (index <= d); } void swap_vertices(const int d1, const int d2) /* Concept */ { CGAL_precondition(0 <= d1 && d1<=maximal_dimension()); CGAL_precondition(0 <= d2 && d2<=maximal_dimension()); combinatorics_.swap_vertices(d1, d2); } const TDS_data & tds_data() const { return tds_data_; } /* Concept */ TDS_data & tds_data() { return tds_data_; } /* Concept */ void* for_compact_container() const { return combinatorics_.for_compact_container(); } void for_compact_container(void* p){ combinatorics_.for_compact_container(p); } bool is_valid(bool verbose = false, int = 0) const /* Concept */ { const int d = maximal_dimension(); int i(0); // test that the non-null Vertex_handles come first, before all null ones while( i <= d && vertex(i) != Vertex_handle() ) ++i; while( i <= d && vertex(i) == Vertex_handle() ) ++i; if( i <= d ) { if( verbose ) CGAL_warning_msg(false, "full cell has garbage handles to vertices."); return false; } for( i = 0; i <= d; ++i ) { if( Vertex_handle() == vertex(i) ) break; // there are no more vertices Full_cell_handle n(neighbor(i)); if( Full_cell_handle() != n ) { int mirror_idx(mirror_index(i)); if( n->neighbor(mirror_idx) == Full_cell_handle() ) { if( verbose ) CGAL_warning_msg(false, "neighbor has no back-neighbor."); return false; } if( &(*(n->neighbor(mirror_idx))) != this ) { if( verbose ) CGAL_warning_msg(false, "neighbor does not point back to correct full cell."); return false; } } } return true; } private: // access to data members: Full_cell_handle_array & neighbors() {return combinatorics_.neighbors_; } const Full_cell_handle_array & neighbors() const {return combinatorics_.neighbors_; } Vertex_handle_array & vertices() {return combinatorics_.vertices_; } const Vertex_handle_array & vertices() const {return combinatorics_.vertices_; } // DATA MEMBERS // With the Itanium ABI, [[no_unique_address]] allows tda_data_ to reuse the // padding bytes at the end of combinatorics_ when using the mirror policy. CGAL_NO_UNIQUE_ADDRESS Combinatorics combinatorics_; mutable TDS_data tds_data_; }; // FUNCTIONS THAT ARE NOT MEMBER FUNCTIONS: template < typename TDS, typename SSP > std::ostream & operator<<(std::ostream & O, const Triangulation_ds_full_cell &) /* Concept */ { /*if( IO::is_ascii(O) ) { // os << '\n'; } else {}*/ return O; } template < typename TDS, typename SSP > std::istream & operator>>(std::istream & I, Triangulation_ds_full_cell &) /* Concept */ { /*if( IO::is_ascii(I) ) {} else {}*/ return I; } // Special case: specialization when template parameter is void. // we must declare it for each possible full_cell storage policy because : // (GCC error:) default template arguments may not be used in partial specializations template< typename StoragePolicy > class Triangulation_ds_full_cell { public: typedef internal::Triangulation::Dummy_TDS TDS; typedef TDS Triangulation_data_structure; typedef TDS::Vertex_handle Vertex_handle; typedef TDS::Vertex_const_handle Vertex_const_handle; typedef TDS::Full_cell_handle Full_cell_handle; typedef TDS::Full_cell_const_handle Full_cell_const_handle; typedef TDS::Vertex_handle_const_iterator Vertex_handle_const_iterator; typedef TDS::Full_cell_data TDS_data; template struct Rebind_TDS { typedef Triangulation_ds_full_cell Other; }; Vertex_handle_const_iterator vertices_begin(); Vertex_handle_const_iterator vertices_end(); }; } //namespace CGAL #include #endif // CGAL_TRIANGULATION_DS_FULL_CELL_H