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) 2005-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: planargraph/PlanarGraph.java rev. 107/138 (JTS-1.10) * **********************************************************************/ #pragma once #include #include // for composition #include // for typedefs #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 Coordinate; } namespace planargraph { class DirectedEdge; class Edge; class Node; } } namespace geos { namespace planargraph { // geos.planargraph /** * \class PlanarGraph * \brief * Represents a directed graph which is embeddable in a planar surface. * * This class and the other classes in this package serve as a framework for * building planar graphs for specific algorithms. This class must be * subclassed to expose appropriate methods to construct the graph. This allows * controlling the types of graph components (DirectedEdge, Edge and Node) * which can be added to the graph. An application which uses the graph * framework will almost always provide subclasses for one or more graph * components, which hold application-specific data and graph algorithms. */ class GEOS_DLL PlanarGraph { protected: std::vector edges; std::vector dirEdges; NodeMap nodeMap; /** * \brief * Adds a node to the std::map, replacing any that is already at that * location. * * Only subclasses can add Nodes, to ensure Nodes are * of the right type. */ void add(Node* node) { nodeMap.add(node); } /** * \brief * Adds the Edge and its DirectedEdges with this PlanarGraph. * * Assumes that the Edge has already been created with its associated * DirectEdges. * Only subclasses can add Edges, to ensure the edges added are of * the right class. */ void add(Edge* edge); /** * \brief * Adds the Edge to this PlanarGraph. * * Only subclasses can add DirectedEdges, * to ensure the edges added are of the right class. */ void add(DirectedEdge* dirEdge) { dirEdges.push_back(dirEdge); } public: typedef std::vector EdgeContainer; typedef EdgeContainer::iterator EdgeIterator; /** * \brief * Constructs a PlanarGraph without any Edges, DirectedEdges, or Nodes. */ PlanarGraph() {} virtual ~PlanarGraph() {} /** * \brief * Returns the Node at the given location, * or null if no Node was there. */ Node* findNode(const geom::Coordinate& pt) { return nodeMap.find(pt); } /** * \brief * Returns an Iterator over the Nodes in this PlanarGraph. */ NodeMap::container::iterator nodeIterator() { return nodeMap.begin(); } NodeMap::container::iterator nodeBegin() { return nodeMap.begin(); } NodeMap::container::const_iterator nodeBegin() const { return nodeMap.begin(); } NodeMap::container::iterator nodeEnd() { return nodeMap.end(); } NodeMap::container::const_iterator nodeEnd() const { return nodeMap.end(); } /** * \brief * Returns the Nodes in this PlanarGraph. * * @param nodes : the nodes are push_back'ed here */ void getNodes(std::vector& nodes) { nodeMap.getNodes(nodes); } /** * \brief * Returns an Iterator over the DirectedEdges in this PlanarGraph, * in the order in which they were added. * * @see add(Edge) * @see add(DirectedEdge) */ std::vector::iterator dirEdgeIterator() { return dirEdges.begin(); } std::vector::iterator dirEdgeBegin() { return dirEdges.begin(); } std::vector::iterator dirEdgeEnd() { return dirEdges.end(); } /// Alias for edgeBegin() std::vector::iterator edgeIterator() { return edges.begin(); } /// Returns an iterator to first Edge in this graph. // /// Edges are stored in the order they were added. /// @see add(Edge) /// std::vector::iterator edgeBegin() { return edges.begin(); } /// Returns an iterator to one-past last Edge in this graph. // /// Edges are stored in the order they were added. /// @see add(Edge) /// std::vector::iterator edgeEnd() { return edges.end(); } /** * Returns the Edges that have been added to this PlanarGraph * @see PlanarGraph::add(Edge* edge) */ std::vector* getEdges() { return &edges; } /** * \brief * Removes an Edge and its associated DirectedEdges from their * from-Nodes and from this PlanarGraph. * * Note: This method does not remove the Nodes associated * with the Edge, even if the removal of the Edge reduces the * degree of a Node to zero. */ void remove(Edge* edge); /** * \brief * Removes DirectedEdge from its from-Node and from this PlanarGraph. * * Note: * This method does not remove the Nodes associated with the * DirectedEdge, even if the removal of the DirectedEdge reduces * the degree of a Node to zero. */ void remove(DirectedEdge* de); /** * \brief * Removes a node from the graph, along with any associated * DirectedEdges and Edges. */ void remove(Node* node); /** * \brief * Returns all Nodes with the given number of Edges around it. * The return value is a newly allocated vector of existing nodes */ std::vector* findNodesOfDegree(std::size_t degree); /** * \brief * Get all Nodes with the given number of Edges around it. * * Found nodes are pushed to the given vector */ void findNodesOfDegree(std::size_t degree, std::vector& to); }; } // namespace geos::planargraph } // namespace geos #ifdef _MSC_VER #pragma warning(pop) #endif