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) 2020-2021 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. * **********************************************************************/ #pragma once #include #include #include #include #include #include #include #include namespace geos { namespace index { namespace strtree { template class TemplateSTRtreeDistance { using Node = TemplateSTRNode; using NodePair = TemplateSTRNodePair; using ItemPair = std::pair; struct PairQueueCompare { bool operator()(const NodePair& a, const NodePair& b) { return a.getDistance() > b.getDistance(); } }; using PairQueue = std::priority_queue, PairQueueCompare>; public: explicit TemplateSTRtreeDistance(ItemDistance& id) : m_id(id) {} ItemPair nearestNeighbour(const Node& root1, const Node& root2) { NodePair initPair(root1, root2, m_id); return nearestNeighbour(initPair); } ItemPair nearestNeighbour(NodePair& initPair) { return nearestNeighbour(initPair, DoubleInfinity); } bool isWithinDistance(const Node& root1, const Node& root2, double maxDistance) { NodePair initPair(root1, root2, m_id); return isWithinDistance(initPair, maxDistance); } private: ItemPair nearestNeighbour(NodePair& initPair, double maxDistance) { double distanceLowerBound = maxDistance; std::unique_ptr minPair; PairQueue priQ; priQ.push(initPair); while (!priQ.empty() && distanceLowerBound > 0) { NodePair pair = priQ.top(); priQ.pop(); double currentDistance = pair.getDistance(); /* * If the distance for the first node in the queue * is >= the current minimum distance, all other nodes * in the queue must also have a greater distance. * So the current minDistance must be the true minimum, * and we are done. */ if (minPair && currentDistance >= distanceLowerBound) { break; } /* * If the pair members are leaves * then their distance is the exact lower bound. * Update the distanceLowerBound to reflect this * (which must be smaller, due to the test * immediately prior to this). */ if (pair.isLeaves()) { distanceLowerBound = currentDistance; if (minPair) { *minPair = pair; } else { minPair = detail::make_unique(pair); } } else { /* * Otherwise, expand one side of the pair, * (the choice of which side to expand is heuristically determined) * and insert the new expanded pairs into the queue */ expandToQueue(pair, priQ, distanceLowerBound); } } if (!minPair) { throw util::GEOSException("Error computing nearest neighbor"); } return minPair->getItems(); } void expandToQueue(const NodePair& pair, PairQueue& priQ, double minDistance) { const Node& node1 = pair.getFirst(); const Node& node2 = pair.getSecond(); bool isComp1 = node1.isComposite(); bool isComp2 = node2.isComposite(); /** * HEURISTIC: If both boundables are composite, * choose the one with largest area to expand. * Otherwise, simply expand whichever is composite. */ if (isComp1 && isComp2) { if (node1.getSize() > node2.getSize()) { expand(node1, node2, false, priQ, minDistance); return; } else { expand(node2, node1, true, priQ, minDistance); return; } } else if (isComp1) { expand(node1, node2, false, priQ, minDistance); return; } else if (isComp2) { expand(node2, node1, true, priQ, minDistance); return; } throw util::IllegalArgumentException("neither boundable is composite"); } void expand(const Node &nodeComposite, const Node &nodeOther, bool isFlipped, PairQueue& priQ, double minDistance) { for (const auto *child = nodeComposite.beginChildren(); child < nodeComposite.endChildren(); ++child) { NodePair sp = isFlipped ? NodePair(nodeOther, *child, m_id) : NodePair(*child, nodeOther, m_id); // only add to queue if this pair might contain the closest points if (minDistance == DoubleInfinity || sp.getDistance() < minDistance) { priQ.push(sp); } } } bool isWithinDistance(const NodePair& initPair, double maxDistance) { double distanceUpperBound = DoubleInfinity; // initialize search queue PairQueue priQ; priQ.push(initPair); while (! priQ.empty()) { // pop head of queue and expand one side of pair NodePair pair = priQ.top(); double pairDistance = pair.getDistance(); /** * If the distance for the first pair in the queue * is > maxDistance, all other pairs * in the queue must have a greater distance as well. * So can conclude no items are within the distance * and terminate with result = false */ if (pairDistance > maxDistance) return false; priQ.pop(); /** * If the maximum distance between the nodes * is less than the maxDistance, * than all items in the nodes must be * closer than the max distance. * Then can terminate with result = true. * * NOTE: using Envelope MinMaxDistance * would provide a tighter bound, * but not much performance improvement has been observed */ if (pair.maximumDistance() <= maxDistance) return true; /** * If the pair items are leaves * then their actual distance is an upper bound. * Update the distanceUpperBound to reflect this */ if (pair.isLeaves()) { // assert: currentDistance < minimumDistanceFound distanceUpperBound = pairDistance; /** * If the items are closer than maxDistance * can terminate with result = true. */ if (distanceUpperBound <= maxDistance) return true; } else { /** * Otherwise, expand one side of the pair, * and insert the expanded pairs into the queue. * The choice of which side to expand is determined heuristically. */ expandToQueue(pair, priQ, distanceUpperBound); } } return false; } ItemDistance& m_id; }; } } }