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. * **********************************************************************/ #pragma once #include #include // for inlines #include #include #include // for unique_ptr #include // for inlines #include // Forward declarations namespace geos { namespace index { class ItemVisitor; namespace strtree { class Boundable; class AbstractNode; } } } namespace geos { namespace index { // geos::index namespace strtree { // geos::index::strtree /// A list of boundables. TODO: use a list typedef std::vector BoundableList; /// list contains boundables or lists of boundables. The lists are owned by /// this class, the plain boundables are held by reference only. class ItemsList; class ItemsListItem { public: enum type { item_is_geometry, item_is_list }; ItemsListItem(void* item_) : t(item_is_geometry) { item.g = item_; } ItemsListItem(ItemsList* item_) : t(item_is_list) { item.l = item_; } type get_type() const { return t; } void* get_geometry() const { assert(t == item_is_geometry); return item.g; } ItemsList* get_itemslist() const { assert(t == item_is_list); return item.l; } type t; union { void* g; ItemsList* l; } item; }; class ItemsList : public std::vector { private: typedef std::vector base_type; static void delete_item(ItemsListItem& item) { if(ItemsListItem::item_is_list == item.t) { delete item.item.l; } } public: ~ItemsList() { std::for_each(begin(), end(), &ItemsList::delete_item); } // lists of items need to be deleted in the end void push_back(void* item) { this->base_type::push_back(ItemsListItem(item)); } // lists of items need to be deleted in the end void push_back_owned(ItemsList* itemList) { this->base_type::push_back(ItemsListItem(itemList)); } }; /** \brief * Base class for STRtree and SIRtree. * * STR-packed R-trees are described in: * P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With * Application To GIS. Morgan Kaufmann, San Francisco, 2002. * * This implementation is based on Boundables rather than just AbstractNodes, * because the STR algorithm operates on both nodes and * data, both of which are treated here as Boundables. * */ class GEOS_DLL AbstractSTRtree { private: bool built; BoundableList* itemBoundables; /** * Creates the levels higher than the given level * * @param boundablesOfALevel * the level to build on * @param level * the level of the Boundables, or -1 if the boundables are item * boundables (that is, below level 0) * @return the root, which may be a ParentNode or a LeafNode */ virtual AbstractNode* createHigherLevels( BoundableList* boundablesOfALevel, int level); std::unique_ptr sortBoundablesY(const BoundableList* input); bool remove(const void* searchBounds, AbstractNode& node, void* item); bool removeItem(AbstractNode& node, void* item); ItemsList* itemsTree(AbstractNode* node); AbstractSTRtree(const AbstractSTRtree&) = delete; AbstractSTRtree& operator=(const AbstractSTRtree&) = delete; protected: /** \brief * A test for intersection between two bounds, necessary because * subclasses of AbstractSTRtree have different implementations of * bounds. */ class GEOS_DLL IntersectsOp { public: /** * For STRtrees, the bounds will be Envelopes; for * SIRtrees, Intervals; for other subclasses of * AbstractSTRtree, some other class. * @param aBounds the bounds of one spatial object * @param bBounds the bounds of another spatial object * @return whether the two bounds intersect */ virtual bool intersects(const void* aBounds, const void* bBounds) = 0; virtual ~IntersectsOp() {} }; AbstractNode* root; std::vector * nodes; // Ownership to caller (TODO: return by unique_ptr) virtual AbstractNode* createNode(int level) = 0; /** \brief * Sorts the childBoundables then divides them into groups of size M, where * M is the node capacity. */ virtual std::unique_ptr createParentBoundables( BoundableList* childBoundables, int newLevel); virtual AbstractNode* lastNode(BoundableList* nodeList) { assert(!nodeList->empty()); // Cast from Boundable to AbstractNode return static_cast(nodeList->back()); } virtual AbstractNode* getRoot() { assert(built); return root; } /// Also builds the tree, if necessary. virtual void insert(const void* bounds, void* item); /// Also builds the tree, if necessary. void query(const void* searchBounds, std::vector& foundItems); /// Also builds the tree, if necessary. void query(const void* searchBounds, ItemVisitor& visitor); void query(const void* searchBounds, const AbstractNode& node, ItemVisitor& visitor); /// Also builds the tree, if necessary. bool remove(const void* itemEnv, void* item); std::unique_ptr boundablesAtLevel(int level); // @@ should be size_t, probably std::size_t nodeCapacity; /** * @return a test for intersection between two bounds, * necessary because subclasses * of AbstractSTRtree have different implementations of bounds. * @see IntersectsOp */ virtual IntersectsOp* getIntersectsOp() = 0; public: /** \brief * Constructs an AbstractSTRtree with the specified maximum number of child * nodes that a node may have. */ AbstractSTRtree(std::size_t newNodeCapacity) : built(false), itemBoundables(new BoundableList()), nodes(new std::vector()), nodeCapacity(newNodeCapacity) { assert(newNodeCapacity > 1); } virtual ~AbstractSTRtree(); /** \brief * Creates parent nodes, grandparent nodes, and so forth up to the root * node, for the data that has been inserted into the tree. * * Can only be * called once, and thus can be called only after all of the data has been * inserted into the tree. */ virtual void build(); /** \brief * Returns the maximum number of child nodes that a node may have. */ virtual std::size_t getNodeCapacity() { return nodeCapacity; } virtual void query(const void* searchBounds, const AbstractNode* node, std::vector* matches); /** * Iterate over all items added thus far. Explicitly does not build * the tree. */ void iterate(ItemVisitor& visitor); /** * @param level -1 to get items * @param top an AbstractNode * @param boundables a BoundableList */ virtual void boundablesAtLevel(int level, AbstractNode* top, BoundableList* boundables); /** \brief * Gets a tree structure (as a nested list) corresponding to the structure * of the items and nodes in this tree. * * The returned Lists contain either Object items, or Lists which * correspond to subtrees of the tree Subtrees which do not contain * any items are not included. * * Builds the tree if necessary. * * @note The caller is responsible for releasing the list * * @return a List of items and/or Lists */ ItemsList* itemsTree(); }; } // namespace geos::index::strtree } // namespace geos::index } // namespace geos