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) 2005 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/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/intersection.h $ // $Id: include/CGAL/Boolean_set_operations_2/intersection.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s): Baruch Zukerman // Ron Wein // Efi Fogel // Simon Giraudot #ifndef CGAL_BOOLEAN_SET_OPERATIONS_2_INTERSECTION_H #define CGAL_BOOLEAN_SET_OPERATIONS_2_INTERSECTION_H #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace CGAL { /// \name intersection() functions. //@{ // Polygon_2, Polygon_2 ======================================================== // With Traits template inline OutputIterator intersection(const Polygon_2& pgn1, const Polygon_2& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // With Tag_true template inline OutputIterator intersection(const Polygon_2& pgn1, const Polygon_2& pgn2, OutputIterator out, Tag_true = Tag_true()) { return s_intersection(pgn1, pgn2, out); } // With Tag_false template inline OutputIterator intersection(const Polygon_2& pgn1, const Polygon_2& pgn2, OutputIterator out, Tag_false) { // Use the first polygon to determine the (default) traits typedef Polygon_2 Polygon; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } // Polygon_2, Polygon_with_holes_2 ============================================= // With Traits template inline OutputIterator intersection(const Polygon_2& pgn1, const Polygon_with_holes_2& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // With Tag_true template inline OutputIterator intersection(const Polygon_2& pgn1, const Polygon_with_holes_2& pgn2, OutputIterator out, Tag_true = Tag_true()) { return s_intersection(pgn1, pgn2, out); } // With Tag_false template inline OutputIterator intersection(const Polygon_2& pgn1, const Polygon_with_holes_2& pgn2, OutputIterator out, Tag_false) { // Use the first polygon to determine the (default) traits typedef Polygon_2 Polygon; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } // Polygon_with_holes_2, Polygon_2 ============================================= // With Traits template inline OutputIterator intersection(const Polygon_with_holes_2& pgn1, const Polygon_2& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // With Tag_true template inline OutputIterator intersection(const Polygon_with_holes_2& pgn1, const Polygon_2& pgn2, OutputIterator out, Tag_true = Tag_true()) { return s_intersection(pgn1, pgn2, out); } // With Tag_false template inline OutputIterator intersection(const Polygon_with_holes_2& pgn1, const Polygon_2& pgn2, OutputIterator out, Tag_false) { // Use the first polygon to determine the (default) traits typedef Polygon_with_holes_2 Polygon_with_holes; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } // Polygon_with_holes_2, Polygon_with_holes_2 ================================== // With Traits template inline OutputIterator intersection(const Polygon_with_holes_2& pgn1, const Polygon_with_holes_2& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // With Tag_true template inline OutputIterator intersection(const Polygon_with_holes_2& pgn1, const Polygon_with_holes_2& pgn2, OutputIterator out, Tag_true = Tag_true()) { return s_intersection(pgn1, pgn2, out); } // With Tag_false template inline OutputIterator intersection(const Polygon_with_holes_2& pgn1, const Polygon_with_holes_2& pgn2, OutputIterator out, Tag_false) { // Use the first polygon to determine the (default) traits typedef Polygon_with_holes_2 Polygon_with_holes; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } // General_polygon_2, General_polygon_2 ======================================== // With Traits template inline OutputIterator intersection(const General_polygon_2& pgn1, const General_polygon_2& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // Without Traits template inline OutputIterator intersection(const General_polygon_2& pgn1, const General_polygon_2& pgn2, OutputIterator out) { // Use the first polygon to determine the (default) traits typedef General_polygon_2 Polygon; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } // General_polygon_2, General_polygon_with_holes_2 ============================= // With traits template inline OutputIterator intersection(const General_polygon_2& pgn1, const General_polygon_with_holes_2 >& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // Without Traits template inline OutputIterator intersection(const General_polygon_2& pgn1, const General_polygon_with_holes_2 >& pgn2, OutputIterator out) { // Use the first polygon to determine the (default) traits typedef General_polygon_2 Polygon; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } // General_polygon_with_holes_2, General_polygon_2 ============================= // With traits template inline OutputIterator intersection(const General_polygon_with_holes_2 >& pgn1, const General_polygon_2& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // Without Traits template inline OutputIterator intersection(const General_polygon_with_holes_2 >& pgn1, const General_polygon_2& pgn2, OutputIterator out) { // Use the first polygon to determine the (default) traits typedef General_polygon_2 Polygon; typedef General_polygon_with_holes_2 Polygon_with_holes; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } // General_polygon_with_holes_2, General_polygon_with_holes_2 ================= // With traits template inline OutputIterator intersection(const General_polygon_with_holes_2& pgn1, const General_polygon_with_holes_2& pgn2, OutputIterator out, Traits& traits) { return s_intersection(pgn1, pgn2, out, traits); } // Without Traits template inline OutputIterator intersection(const General_polygon_with_holes_2& pgn1, const General_polygon_with_holes_2& pgn2, OutputIterator out) { // Use the first polygon to determine the (default) traits typedef General_polygon_with_holes_2 Polygon_with_holes; typename Gps_default_traits::Traits traits; return s_intersection(pgn1, pgn2, out, traits); } //@} /// \name Aggregated intersection() functions. //@{ // With Traits template inline OutputIterator intersection(InputIterator begin, InputIterator end, OutputIterator oi, Traits& traits, unsigned int k=5) { return r_intersection(begin, end, oi, traits, k); } // Without Traits // Tag_true => convert to polylines template inline OutputIterator intersection(InputIterator begin, InputIterator end, OutputIterator oi, Tag_true = Tag_true(), unsigned int k=5, Enable_if_Polygon_2_iterator* = 0) { return r_intersection(begin, end, oi, k); } // Tag_false => do not convert to polylines template inline OutputIterator intersection(InputIterator begin, InputIterator end, OutputIterator oi, Tag_false, unsigned int k=5, Enable_if_Polygon_2_iterator* = 0) { typename Iterator_to_gps_traits::Traits traits; return r_intersection(begin, end, oi, traits, k); } // General polygons or polygons with holes template inline OutputIterator intersection(InputIterator begin, InputIterator end, OutputIterator oi, unsigned int k=5, // workaround to avoid ambiguous calls with kernel functions std::enable_if_t::value>* = 0, Disable_if_Polygon_2_iterator* = 0) { typename Iterator_to_gps_traits::Traits traits; return r_intersection(begin, end, oi, traits, k); } // Inersect two ranges of simple polygons and polygons with holes. // With Traits template inline OutputIterator intersection(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, Traits& traits, unsigned int k=5) { return r_intersection(begin1, end1, begin2, end2, oi, traits, k); } // Without Traits // Tag_true => convert to polylines template inline OutputIterator intersection(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, Tag_true = Tag_true(), unsigned int k=5, Enable_if_Polygon_2_iterator* = 0) { return r_intersection(begin1, end1, begin2, end2, oi, k); } // Tag_false => do not convert to polylines template inline OutputIterator intersection(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, Tag_false, unsigned int k=5, Enable_if_Polygon_2_iterator* = 0) { typename Iterator_to_gps_traits::Traits traits; return r_intersection(begin1, end1, begin2, end2, oi, traits, k); } // General polygons or polygons with holes template inline OutputIterator intersection(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, unsigned int k=5, Disable_if_Polygon_2_iterator* = 0) { typename Iterator_to_gps_traits::Traits traits; return r_intersection(begin1, end1, begin2, end2, oi, traits, k); } //@} } //namespace CGAL #include #endif