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. * ********************************************************************** * * Last port: operation/overlay/PolygonBuilder.java rev. 1.20 (JTS-1.10) * **********************************************************************/ #pragma once #include #include #include #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class #endif // Forward declarations namespace geos { namespace geom { class Geometry; class Coordinate; class GeometryFactory; } namespace geomgraph { class EdgeRing; class Node; class PlanarGraph; class DirectedEdge; } namespace operation { namespace overlay { class MaximalEdgeRing; class MinimalEdgeRing; } } } namespace geos { namespace operation { // geos::operation namespace overlay { // geos::operation::overlay /** \brief * Forms Polygon out of a graph of geomgraph::DirectedEdge. * * The edges to use are marked as being in the result Area. */ class GEOS_DLL PolygonBuilder { public: PolygonBuilder(const geom::GeometryFactory* newGeometryFactory); ~PolygonBuilder(); /** * Add a complete graph. * The graph is assumed to contain one or more polygons, * possibly with holes. */ void add(geomgraph::PlanarGraph* graph); // throw(const TopologyException &) /** * Add a set of edges and nodes, which form a graph. * The graph is assumed to contain one or more polygons, * possibly with holes. */ void add(const std::vector* dirEdges, const std::vector* nodes); // throw(const TopologyException &) std::vector> getPolygons(); private: const geom::GeometryFactory* geometryFactory; std::vector shellList; /** * For all DirectedEdges in result, form them into MaximalEdgeRings * * @param maxEdgeRings * Formed MaximalEdgeRings will be pushed to this vector. * Ownership of the elements is transferred to caller. */ void buildMaximalEdgeRings( const std::vector* dirEdges, std::vector& maxEdgeRings); // throw(const TopologyException &) void buildMinimalEdgeRings( std::vector& maxEdgeRings, std::vector& newShellList, std::vector& freeHoleList, std::vector& edgeRings); /** * This method takes a list of MinimalEdgeRings derived from a * MaximalEdgeRing, and tests whether they form a Polygon. * This is the case if there is a single shell * in the list. In this case the shell is returned. * The other possibility is that they are a series of connected * holes, in which case no shell is returned. * * @return the shell geomgraph::EdgeRing, if there is one * @return NULL, if all the rings are holes */ geomgraph::EdgeRing* findShell(std::vector* minEdgeRings); /** * This method assigns the holes for a Polygon (formed from a list of * MinimalEdgeRings) to its shell. * Determining the holes for a MinimalEdgeRing polygon serves two * purposes: * * - it is faster than using a point-in-polygon check later on. * - it ensures correctness, since if the PIP test was used the point * chosen might lie on the shell, which might return an incorrect * result from the PIP test */ void placePolygonHoles(geomgraph::EdgeRing* shell, std::vector* minEdgeRings); /** * For all rings in the input list, * determine whether the ring is a shell or a hole * and add it to the appropriate list. * Due to the way the DirectedEdges were linked, * a ring is a shell if it is oriented CW, a hole otherwise. */ void sortShellsAndHoles(std::vector& edgeRings, std::vector& newShellList, std::vector& freeHoleList); struct FastPIPRing { geomgraph::EdgeRing* edgeRing; algorithm::locate::IndexedPointInAreaLocator* pipLocator; }; /** \brief * This method determines finds a containing shell for all holes * which have not yet been assigned to a shell. * * These "free" holes should all be properly contained in * their parent shells, so it is safe to use the * findEdgeRingContaining method. * This is the case because any holes which are NOT * properly contained (i.e. are connected to their * parent shell) would have formed part of a MaximalEdgeRing * and been handled in a previous step. * * @throws TopologyException if a hole cannot be assigned to a shell */ void placeFreeHoles(std::vector& newShellList, std::vector& freeHoleList); // throw(const TopologyException&) /** \brief * Find the innermost enclosing shell geomgraph::EdgeRing containing the * argument geomgraph::EdgeRing, if any. * * The innermost enclosing ring is the smallest enclosing ring. * The algorithm used depends on the fact that: * * ring A contains ring B iff envelope(ring A) * contains envelope(ring B) * * This routine is only safe to use if the chosen point of the hole * is known to be properly contained in a shell * (which is guaranteed to be the case if the hole does not touch * its shell) * * @return containing geomgraph::EdgeRing, if there is one * @return NULL if no containing geomgraph::EdgeRing is found */ geomgraph::EdgeRing* findEdgeRingContaining(geomgraph::EdgeRing* testEr, std::vector& newShellList); std::vector> computePolygons( std::vector& newShellList); /** * Checks the current set of shells (with their associated holes) to * see if any of them contain the point. */ }; } // namespace geos::operation::overlay } // namespace geos::operation } // namespace geos #ifdef _MSC_VER #pragma warning(pop) #endif