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) 2016 Daniel Baston * * 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/distance/IndexedFacetDistance.java (f6187ee2 JTS-1.14) * **********************************************************************/ #pragma once #include namespace geos { namespace operation { namespace distance { /// \brief Computes the distance between the facets (segments and vertices) /// of two [Geometrys](\ref geom::Geometry) using a Branch-and-Bound algorithm. /// /// The Branch-and-Bound algorithm operates over a traversal of R-trees built /// on the target and the query geometries. /// /// This approach provides the following benefits: /// /// - Performance is dramatically improved due to the use of the R-tree index /// and the pruning due to the Branch-and-Bound approach /// - The spatial index on the target geometry is cached which allow reuse in /// an repeated query situation. /// /// Using this technique is usually much more performant than using the /// brute-force geom::Geometry::distance() when one /// or both input geometries are large, or when evaluating many distance /// computations against a single geometry. /// /// \author Martin Davis class GEOS_DLL IndexedFacetDistance { public: /// \brief Creates a new distance-finding instance for a given target geom::Geometry. /// /// Distances will be computed to all facets of the input geometry. /// The facets of the geometry are the discrete segments and points /// contained in its components. /// In the case of lineal and puntal inputs, this is equivalent to computing /// the conventional distance. /// In the case of polygonal inputs, this is equivalent to computing the /// distance to the polygon boundaries. /// /// \param g a Geometry, which may be of any type. IndexedFacetDistance(const geom::Geometry* g) : cachedTree(FacetSequenceTreeBuilder::build(g)), baseGeometry(*g) {} /// \brief Computes the distance between facets of two geometries. /// /// For geometries with many segments or points, this can be faster than /// using a simple distance algorithm. /// /// \param g1 a geometry /// \param g2 a geometry /// \return the distance between facets of the geometries static double distance(const geom::Geometry* g1, const geom::Geometry* g2); /// \brief Computes the nearest points of the facets of two geometries. /// /// \param g1 a geometry /// \param g2 a geometry /// \return the nearest points on the facets of the geometries static std::unique_ptr nearestPoints(const geom::Geometry* g1, const geom::Geometry* g2); /// \brief Computes the distance from the base geometry to the given geometry. /// /// \param g the geometry to compute the distance to /// /// \return the computed distance double distance(const geom::Geometry* g) const; /// \brief Tests whether the base geometry lies within a specified distance of the given geometry. /// /// \param g the geometry to test /// \param maxDistance the maximum distance to test /// /// \return true of the geometry lies within the specified distance bool isWithinDistance(const geom::Geometry* g, double maxDistance) const; /// \brief Computes the nearest locations on the base geometry and the given geometry. /// /// \param g the geometry to compute the nearest location to /// \return the nearest locations std::vector nearestLocations(const geom::Geometry* g) const; /// \brief Compute the nearest locations on the target geometry and the given geometry. /// /// \param g the geometry to compute the nearest point to /// \return the nearest points std::unique_ptr nearestPoints(const geom::Geometry* g) const; private: struct FacetDistance { double operator()(const FacetSequence* a, const FacetSequence* b) const { return a->distance(*b); } }; std::unique_ptr> cachedTree; const geom::Geometry& baseGeometry; }; } } }