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
/********************************************************************** * * GEOS - Geometry Engine Open Source * http://libgeos.org * * Copyright (c) 2021 Martin Davis * Copyright (C) 2022 Paul Ramsey * * This is free software; you can redistribute and/or modify it under * the terms of the GNU Lesser General Public Licence as published * by the Free Software Foundation. * See the COPYING file for more information. * **********************************************************************/ #pragma once #include // Forward declarations namespace geos { namespace geom { class CoordinateXY; } } using geos::geom::CoordinateXY; namespace geos { namespace algorithm { // geos::algorithm /** * Functions to compute topological information * about nodes (ring intersections) in polygonal geometry. * * @author mdavis * */ class GEOS_DLL PolygonNodeTopology { public: /* * Check if the segments at a node between two rings (or one ring) cross. * The node is topologically valid if the rings do not cross. * This function assumes that the segments are not collinear. * * @param nodePt the node location * @param a0 the previous segment endpoint in a ring * @param a1 the next segment endpoint in a ring * @param b0 the previous segment endpoint in the other ring * @param b1 the next segment endpoint in the other ring * @return true if the rings cross at the node */ static bool isCrossing(const CoordinateXY* nodePt, const CoordinateXY* a0, const CoordinateXY* a1, const CoordinateXY* b0, const CoordinateXY* b1); /** * Tests whether an segment node-b lies in the interior or exterior * of a corner of a ring formed by the two segments a0-node-a1. * The ring interior is assumed to be on the right of the corner * (i.e. a CW shell or CCW hole). * The test segment must not be collinear with the corner segments. * * @param nodePt the node location * @param a0 the first vertex of the corner * @param a1 the second vertex of the corner * @param b the other vertex of the test segment * @return true if the segment is interior to the ring corner */ static bool isInteriorSegment(const CoordinateXY* nodePt, const CoordinateXY* a0, const CoordinateXY* a1, const CoordinateXY* b); /** * Compares the angles of two vectors * relative to the positive X-axis at their origin. * Angles increase CCW from the X-axis. * * @param origin the origin of the vectors * @param p the endpoint of the vector P * @param q the endpoint of the vector Q * @return a negative integer, zero, or a positive integer as this vector P has angle less than, equal to, or greater than vector Q */ static int compareAngle( const CoordinateXY* origin, const CoordinateXY* p, const CoordinateXY* q); private: /** * Tests if an edge p is between edges e0 and e1, * where the edges all originate at a common origin. * The "inside" of e0 and e1 is the arc which does not include the origin. * The edges are assumed to be distinct (non-collinear). * * @param origin the origin * @param p the destination point of edge p * @param e0 the destination point of edge e0 * @param e1 the destination point of edge e1 * @return true if p is between e0 and e1 */ static bool isBetween(const CoordinateXY* origin, const CoordinateXY* p, const CoordinateXY* e0, const CoordinateXY* e1); /** * Compares whether an edge p is between or outside the edges e0 and e1, * where the edges all originate at a common origin. * The "inside" of e0 and e1 is the arc which does not include * the positive X-axis at the origin. * If p is collinear with an edge 0 is returned. * * @param origin the origin * @param p the destination point of edge p * @param e0 the destination point of edge e0 * @param e1 the destination point of edge e1 * @return a negative integer, zero or positive integer as the vector P lies outside, collinear with, or inside the vectors E0 and E1 */ static int compareBetween(const CoordinateXY* origin, const CoordinateXY* p, const CoordinateXY* e0, const CoordinateXY* e1); /** * Tests if the angle with the origin of a vector P is greater than that of the * vector Q. * * @param origin the origin of the vectors * @param p the endpoint of the vector P * @param q the endpoint of the vector Q * @return true if vector P has angle greater than Q */ static bool isAngleGreater(const CoordinateXY* origin, const CoordinateXY* p, const CoordinateXY* q); static int quadrant(const CoordinateXY* origin, const CoordinateXY* p); }; } // namespace geos::algorithm } // namespace geos