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) 2011 Sandro Santilli * Copyright (C) 2005-2006 Refractions Research Inc. * Copyright (C) 2001-2002 Vivid Solutions 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: geomgraph/GeometryGraph.java r428 (JTS-1.12+) * **********************************************************************/ #pragma once #include #include #include #include #include #include #include // for unique_ptr #include #include #include // for LineStringLT #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 LineString; class LinearRing; class Polygon; class Geometry; class GeometryCollection; class Point; class Envelope; } namespace algorithm { class LineIntersector; class BoundaryNodeRule; } namespace geomgraph { class Edge; class Node; namespace index { class EdgeSetIntersector; } } } namespace geos { namespace geomgraph { // geos.geomgraph /** \brief * A GeometryGraph is a graph that models a given Geometry. */ class GEOS_DLL GeometryGraph final: public PlanarGraph { using PlanarGraph::add; using PlanarGraph::findEdge; private: const geom::Geometry* parentGeom; /** * The lineEdgeMap is a map of the linestring components of the * parentGeometry to the edges which are derived from them. * This is used to efficiently perform findEdge queries * * Following the above description there's no need to * compare LineStrings other then by pointer value. */ std::unordered_map lineEdgeMap; /** * If this flag is true, the Boundary Determination Rule will * used when deciding whether nodes are in the boundary or not */ bool useBoundaryDeterminationRule; const algorithm::BoundaryNodeRule& boundaryNodeRule; /** * the index of this geometry as an argument to a spatial function * (used for labelling) */ uint8_t argIndex; /// Cache for fast responses to getBoundaryPoints std::unique_ptr< geom::CoordinateSequence > boundaryPoints; std::unique_ptr< std::vector > boundaryNodes; bool hasTooFewPointsVar; geom::Coordinate invalidPoint; /// Allocates a new EdgeSetIntersector. Remember to delete it! index::EdgeSetIntersector* createEdgeSetIntersector(); void add(const geom::Geometry* g); // throw(UnsupportedOperationException); void addCollection(const geom::GeometryCollection* gc); void addPoint(const geom::Point* p); void addPolygonRing(const geom::LinearRing* lr, geom::Location cwLeft, geom::Location cwRight); void addPolygon(const geom::Polygon* p); void addLineString(const geom::LineString* line); void insertPoint(uint8_t p_argIndex, const geom::Coordinate& coord, geom::Location onLocation); /** \brief * Adds candidate boundary points using the current * algorithm::BoundaryNodeRule. * * This is used to add the boundary * points of dim-1 geometries (Curves/MultiCurves). */ void insertBoundaryPoint(uint8_t p_argIndex, const geom::Coordinate& coord); void addSelfIntersectionNodes(uint8_t p_argIndex); /** \brief * Add a node for a self-intersection. * * If the node is a potential boundary node (e.g. came from an edge * which is a boundary) then insert it as a potential boundary node. * Otherwise, just add it as a regular node. */ void addSelfIntersectionNode(uint8_t p_argIndex, const geom::Coordinate& coord, geom::Location loc); // Declare type as noncopyable GeometryGraph(const GeometryGraph& other) = delete; GeometryGraph& operator=(const GeometryGraph& rhs) = delete; public: static bool isInBoundary(int boundaryCount); static geom::Location determineBoundary(int boundaryCount); static geom::Location determineBoundary( const algorithm::BoundaryNodeRule& boundaryNodeRule, int boundaryCount); GeometryGraph(uint8_t newArgIndex, const geom::Geometry* newParentGeom); GeometryGraph(uint8_t newArgIndex, const geom::Geometry* newParentGeom, const algorithm::BoundaryNodeRule& boundaryNodeRule); ~GeometryGraph() override {}; const geom::Geometry* getGeometry() { return parentGeom; }; /// Returned object is owned by this GeometryGraph void getBoundaryNodes(std::vector& bdyNodes) { nodes->getBoundaryNodes(static_cast(argIndex), bdyNodes); }; std::vector* getBoundaryNodes(); /// Returned object is owned by this GeometryGraph geom::CoordinateSequence* getBoundaryPoints(); Edge* findEdge(const geom::LineString* line) const; void computeSplitEdges(std::vector* edgelist); void addEdge(Edge* e); void addPoint(geom::Coordinate& pt); /** * \brief * Compute self-nodes, taking advantage of the Geometry type to minimize * the number of intersection tests. (E.g. rings are not tested for * self-intersection, since they are assumed to be valid). * * @param li the LineIntersector to use * @param computeRingSelfNodes if `false`, intersection checks are optimized * to not test rings for self-intersection * @param env an Envelope * * @return the SegmentIntersector used, containing information about * the intersections found */ std::unique_ptr computeSelfNodes( algorithm::LineIntersector* li, bool computeRingSelfNodes, const geom::Envelope* env = nullptr) { return computeSelfNodes(*li, computeRingSelfNodes, env); } // Quick inline calling the function above, the above should probably // be deprecated. std::unique_ptr computeSelfNodes( algorithm::LineIntersector& li, bool computeRingSelfNodes, const geom::Envelope* env = nullptr); std::unique_ptr computeEdgeIntersections(GeometryGraph* g, algorithm::LineIntersector* li, bool includeProper, const geom::Envelope* env = nullptr); std::vector* getEdges(); bool hasTooFewPoints(); const geom::Coordinate& getInvalidPoint(); const algorithm::BoundaryNodeRule& getBoundaryNodeRule() const { return boundaryNodeRule; } }; } // namespace geos.geomgraph } // namespace geos #ifdef _MSC_VER #pragma warning(pop) #endif