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,2005 // 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/Stream_support/include/CGAL/IO/OFF/Scanner_OFF.h $ // $Id: include/CGAL/IO/OFF/Scanner_OFF.h b26b07a1242 $ // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Lutz Kettner // Ralf Osbild #ifndef CGAL_IO_OFF_SCANNER_OFF_H #define CGAL_IO_OFF_SCANNER_OFF_H 1 #include #include #include #include #include #include namespace CGAL { // The Facet_iterator's value type is vector // that contains the vertex indices. template class I_Scanner_OFF_vertex_iterator { public: typedef std::input_iterator_tag iterator_category; typedef Pt value_type; typedef std::ptrdiff_t difference_type; typedef const Pt* pointer; typedef const Pt& reference; private: File_scanner_OFF* m_scan; std::size_t m_cnt; Pt m_point; void next_vertex() { CGAL_assertion( m_scan != nullptr); if ( m_cnt < m_scan->size_of_vertices()) { file_scan_vertex( *m_scan, m_point); m_scan->skip_to_next_vertex( m_cnt); ++m_cnt; } else m_cnt = m_scan->size_of_vertices() + 1; } public: typedef Pt Point; typedef File_scanner_OFF Scanner; typedef I_Scanner_OFF_vertex_iterator Self; I_Scanner_OFF_vertex_iterator(std::size_t cnt) : m_scan(nullptr), m_cnt(cnt+1) {} I_Scanner_OFF_vertex_iterator( Scanner& s, int cnt) : m_scan(&s), m_cnt(cnt) { next_vertex(); } std::size_t count() const { return m_cnt; } bool operator==( const Self& i) const { return m_cnt == i.m_cnt; } bool operator!=( const Self& i) const { return m_cnt != i.m_cnt; } Self& operator++() { next_vertex(); return *this; } Self operator++(int) { Self tmp = *this; ++(*this); return tmp; } const Point& operator*() const { CGAL_assertion( m_scan != nullptr); return m_point; } const Point* operator->() const { return & operator*(); } }; template class I_Scanner_OFF_vertex_and_normals_iterator { public: typedef Pt Point; typedef Nrm Normal; typedef File_scanner_OFF Scanner; typedef I_Scanner_OFF_vertex_and_normals_iterator Self; typedef std::input_iterator_tag iterator_category; typedef std::pair value_type; typedef std::ptrdiff_t difference_type; typedef const value_type* pointer; typedef const value_type& reference; private: File_scanner_OFF* m_scan; std::size_t m_cnt; value_type m_current; void next() { CGAL_assertion( m_scan != nullptr); if ( m_cnt < m_scan->size_of_vertices()) { file_scan_vertex( *m_scan, m_current.first); if ( m_scan->has_normals()) file_scan_normal( *m_scan, m_current.second); m_scan->skip_to_next_vertex( m_cnt); ++m_cnt; } else m_cnt = m_scan->size_of_vertices() + 1; } public: I_Scanner_OFF_vertex_and_normals_iterator( int cnt) : m_scan(nullptr), m_cnt(cnt+1) {} I_Scanner_OFF_vertex_and_normals_iterator( Scanner& s, int cnt) : m_scan(&s), m_cnt(cnt) { next(); } std::size_t count() const { return m_cnt; } bool operator==( const Self& i) const { return m_cnt == i.m_cnt; } bool operator!=( const Self& i) const { return m_cnt != i.m_cnt; } Self& operator++() { next(); return *this; } Self operator++(int) { Self tmp = *this; ++(*this); return tmp; } reference operator*() const { CGAL_assertion( m_scan != nullptr); return m_current; } pointer operator->() const { return & operator*(); } }; class I_Scanner_OFF_facet_iterator { public: typedef std::input_iterator_tag iterator_category; typedef std::vector value_type; typedef std::ptrdiff_t difference_type; typedef value_type* pointer; typedef value_type& reference; private: File_scanner_OFF* m_scan; std::size_t m_cnt; value_type m_indices; void next_facet() { CGAL_assertion( m_scan != nullptr); if ( m_cnt < m_scan->size_of_facets()) { m_indices.erase( m_indices.begin(), m_indices.end()); std::size_t no; m_scan->scan_facet( no, m_cnt); m_indices.reserve( no); std::size_t index = (std::numeric_limits::max)(); // A huge value helps to detect a potential // error in the function scan_facet_vertex_index for (std::size_t i = 0; i < no; ++i) { m_scan->scan_facet_vertex_index( index, i+1, m_cnt); m_indices.push_back( index); } m_scan->skip_to_next_facet( m_cnt); ++ m_cnt; } else m_cnt = m_scan->size_of_facets() + 1; } public: value_type::size_type size_of_indices () const // RO { return m_indices.size(); } typedef value_type::size_type indices_size_type; // RO public: typedef File_scanner_OFF Scanner; typedef I_Scanner_OFF_facet_iterator Self; typedef value_type::iterator iterator; I_Scanner_OFF_facet_iterator( std::size_t cnt) : m_scan(nullptr), m_cnt(cnt+1) {} I_Scanner_OFF_facet_iterator( Scanner& s, std::size_t cnt) : m_scan(&s), m_cnt(cnt) { next_facet(); } std::size_t count() const { return m_cnt; } bool operator==( const Self& i) const { return m_cnt == i.m_cnt; } bool operator!=( const Self& i) const { return m_cnt != i.m_cnt; } Self& operator++() { next_facet(); return *this; } Self operator++(int) { Self tmp = *this; ++(*this); return tmp; } value_type& operator*() { CGAL_assertion( m_scan != nullptr); return m_indices; } const value_type& operator*() const { CGAL_assertion( m_scan != nullptr); return m_indices; } value_type* operator->() { return & operator*(); } const value_type* operator->() const { return & operator*(); } }; // The distance function is implemented to work in // constant time for both iterators. template inline void distance( const I_Scanner_OFF_vertex_iterator& first, const I_Scanner_OFF_vertex_iterator& last, Distance& n) { n = Distance( last.count() - first.count()); } template inline void distance( const I_Scanner_OFF_facet_iterator& first, const I_Scanner_OFF_facet_iterator& last, Distance& n) { n = Distance( last.count() - first.count()); } template inline std::ptrdiff_t distance( const I_Scanner_OFF_vertex_iterator& first, const I_Scanner_OFF_vertex_iterator& last) { return last.count() - first.count(); } inline std::ptrdiff_t distance( const I_Scanner_OFF_facet_iterator& first, const I_Scanner_OFF_facet_iterator& last) { return last.count() - first.count(); } template class Scanner_OFF { File_scanner_OFF m_scan; public: typedef typename Kernel::Point_3 Point; typedef Point Pt; typedef typename Kernel::Vector_3 Normal; typedef Scanner_OFF Self; typedef I_Scanner_OFF_vertex_iterator Vertex_iterator; typedef I_Scanner_OFF_vertex_and_normals_iterator Vertex_and_normals_iterator; typedef I_Scanner_OFF_facet_iterator Facet_iterator; typedef I_Scanner_OFF_facet_iterator::iterator Index_iterator; Scanner_OFF( std::istream& in, bool verbose = false) : m_scan( in, verbose) {} Scanner_OFF( std::istream& in, const File_header_OFF& header) : m_scan( in, header) {} std::size_t size_of_vertices() const { return m_scan.size_of_vertices(); } std::size_t size_of_halfedges() const { return m_scan.size_of_halfedges();} std::size_t size_of_facets() const { return m_scan.size_of_facets(); } bool verbose() const { return m_scan.verbose(); } bool skel() const { return m_scan.skel(); } bool off() const { return m_scan.off(); } bool binary() const { return m_scan.binary(); } bool ascii() const { return m_scan.ascii(); } bool has_colors() const { return m_scan.has_colors(); } bool has_normals() const { return m_scan.has_normals(); } File_header_OFF& header() { return m_scan; } const File_header_OFF& header() const { return m_scan; } Vertex_iterator vertices_begin(){ return Vertex_iterator( m_scan,0);} Vertex_iterator vertices_end() { return Vertex_iterator( size_of_vertices()); } Facet_iterator facets_begin() { return Facet_iterator( m_scan,0); } Facet_iterator facets_end() { return Facet_iterator( size_of_facets()); } Vertex_and_normals_iterator vertices_and_normals_begin(){ return Vertex_and_normals_iterator( m_scan,0); } Vertex_and_normals_iterator vertices_and_normals_end() { return Vertex_and_normals_iterator( size_of_vertices()); } }; } //namespace CGAL #endif // CGAL_IO_OFF_SCANNER_OFF_H // // EOF //