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://geos.osgeo.org * * Copyright (C) 2006 Refractions Research Inc. * * 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 // for inheritance #include // for composition #include #include // Forward declarations namespace geos { namespace algorithm { class LineIntersector; } namespace noding { class SegmentString; } } namespace geos { namespace noding { // geos.noding /** * \brief Finds non-noded intersections in a set of {@link SegmentString}s, if any exist. * * Non-noded intersections include: * * - intersections which lie in the interior of a segment * - intersections at a vertex in the interior of a SegmentString * (e.g. with a segment string endpoint or other interior vertex) * * @version 1.7 */ class NodingIntersectionFinder: public SegmentIntersector { public: /** \brief * Creates an intersection finder which finds an interior intersection * if one exists * * @param newLi the LineIntersector to use */ NodingIntersectionFinder(algorithm::LineIntersector& newLi) : li(newLi), interiorIntersection(geom::Coordinate::getNull()), intersectionCount(0), isCheckEndSegmentsOnly(false), findAllIntersections(false) { } /** \brief * Tests whether an intersection was found. * * @return true if an intersection was found */ bool hasIntersection() const { return !interiorIntersection.isNull(); } /** \brief * Gets the computed location of the intersection. * Due to round-off, the location may not be exact. * * @return the coordinate for the intersection location */ const geom::Coordinate& getInteriorIntersection() const { return interiorIntersection; } /** \brief * Gets the count of intersections found. * * @return the intersection count */ size_t count() const { return intersectionCount; } /** \brief * Sets whether only end segments should be tested for interior intersection. * * This is a performance optimization that may be used if the segments * have been previously noded by an appropriate algorithm. * It may be known that any potential noding failures will occur only in * end segments. * * @param isCESO whether to test only end segments */ void setCheckEndSegmentsOnly(bool isCESO) { isCheckEndSegmentsOnly = isCESO; } /** \brief * Sets whether all intersections should be computed. * * When this is `false` (the default value) the value of * #isDone() is `true` after the first intersection is found. * * Default is `false`. * * @param fAI whether all intersections should be computed */ void setFindAllIntersections(bool fAI) { findAllIntersections = fAI; } /** \brief * Gets the endpoints of the intersecting segments. * * @return an array of the segment endpoints (p00, p01, p10, p11) */ const std::vector& getIntersectionSegments() const { return intSegments; } /** \brief * This method is called by clients of the SegmentIntersector class to process * intersections for two segments of the [SegmentStrings](@ref SegmentString) * being intersected. * * @note Some clients (such as `MonotoneChains`) may optimize away * this call for segment pairs which they have determined do not intersect * (e.g. by an disjoint envelope test). */ void processIntersections( SegmentString* e0, std::size_t segIndex0, SegmentString* e1, std::size_t segIndex1) override; bool isDone() const override { return !interiorIntersection.isNull(); } private: algorithm::LineIntersector& li; geom::Coordinate interiorIntersection; std::size_t intersectionCount; bool isCheckEndSegmentsOnly; bool findAllIntersections; std::vector intSegments; // Declare type as noncopyable NodingIntersectionFinder(const NodingIntersectionFinder& other) = delete; NodingIntersectionFinder& operator=(const NodingIntersectionFinder& rhs) = delete; /** \brief * Tests if two vertices with at least one in a segmentString interior * are equal. * * @param p0 a segment vertex * @param p1 a segment vertex * @param isEnd0 true if vertex is a segmentString endpoint * @param isEnd1 true if vertex is a segmentString endpoint * @return true if an intersection is found */ static bool isInteriorVertexIntersection( const geom::Coordinate& p0, const geom::Coordinate& p1, bool isEnd0, bool isEnd1) { // Intersections between endpoints are valid nodes, so not reported if (isEnd0 && isEnd1) { return false; } if (p0.equals2D(p1)) { return true; } return false; }; /** \brief * Tests if an intersection occurs between a SegmentString interior vertex and another vertex. * * @note intersections between two endpoint vertices are valid noding, * and are not flagged. * * @param p00 a segment vertex * @param p01 a segment vertex * @param p10 a segment vertex * @param p11 a segment vertex * @param isEnd00 true if vertex is a segmentString endpoint * @param isEnd01 true if vertex is a segmentString endpoint * @param isEnd10 true if vertex is a segmentString endpoint * @param isEnd11 true if vertex is a segmentString endpoint * @return true if an intersection is found */ static bool isInteriorVertexIntersection( const geom::Coordinate& p00, const geom::Coordinate& p01, const geom::Coordinate& p10, const geom::Coordinate& p11, bool isEnd00, bool isEnd01, bool isEnd10, bool isEnd11) { if (isInteriorVertexIntersection(p00, p10, isEnd00, isEnd10)) { return true; } if (isInteriorVertexIntersection(p00, p11, isEnd00, isEnd11)) { return true; } if (isInteriorVertexIntersection(p01, p10, isEnd01, isEnd10)) { return true; } if (isInteriorVertexIntersection(p01, p11, isEnd01, isEnd11)) { return true; } return false; }; /** \brief * Tests whether a segment in a SegmentString is an end segment. * (either the first or last). * * @param segStr a segment string * @param index the index of a segment in the segment string * @return true if the segment is an end segment */ static bool isEndSegment(const SegmentString* segStr, std::size_t index) { if (index == 0) { return true; } if (index >= segStr->size() - 2) { return true; } return false; }; }; } // namespace geos.noding } // namespace geos