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
// Copyright (c) 2002,2011 Utrecht University (The Netherlands). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Spatial_searching/include/CGAL/Weighted_Minkowski_distance.h $ // $Id: include/CGAL/Weighted_Minkowski_distance.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Hans Tangelder () // Note: Use p=0 to denote the weighted Linf-distance // For 0 #include #include #include #include #include #include #include #include namespace CGAL { namespace internal { template struct Array_or_vector_selector { typedef std::vector type; static void resize(type&v, std::size_t d) { v.resize(d); } }; template struct Array_or_vector_selector > { typedef std::array type; static void resize(type&, std::size_t CGAL_assertion_code(d)) { CGAL_assertion(d==D); } }; } template class Weighted_Minkowski_distance { SearchTraits traits; public: typedef typename SearchTraits::Point_d Point_d; typedef Point_d Query_item; typedef typename SearchTraits::FT FT; typedef typename internal::Get_dimension_tag::Dimension Dimension; typedef internal::Array_or_vector_selector Weight_vector_traits; typedef typename Weight_vector_traits::type Weight_vector; private: typedef typename SearchTraits::Cartesian_const_iterator_d Coord_iterator; double power; Weight_vector the_weights; FT pow(FT ft) const { return FT(std::pow(to_double(ft), power)); } FT pow(FT ft, FT p) const { return FT(std::pow(to_double(ft), to_double(p))); } public: // default constructor Weighted_Minkowski_distance(const SearchTraits& traits_=SearchTraits()) : traits(traits_),power(2) {} Weighted_Minkowski_distance(const int d,const SearchTraits& traits_=SearchTraits()) : traits(traits_),power(2), the_weights(d) { for (int i = 0; i < d; ++i) the_weights[i]=FT(1); } //default copy constructor and destructor template Weighted_Minkowski_distance (FT pow, int dim, InputIterator begin, InputIterator CGAL_assertion_code(end), const SearchTraits& traits_=SearchTraits()) : traits(traits_),power(to_double(pow)) { CGAL_assertion(is_positive(power)); Weight_vector_traits::resize(the_weights, dim); for (int i = 0; i < dim; ++i){ the_weights[i] = *begin; ++begin; CGAL_assertion(the_weights[i]>=FT(0)); } CGAL_assertion(begin == end); } inline FT transformed_distance(const Query_item& q, const Point_d& p) const { return transformed_distance(q,p, Dimension()); } //Dynamic version for runtime dimension inline FT transformed_distance(const Query_item& q, const Point_d& p, Dynamic_dimension_tag) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), qe = construct_it(q,1), pit = construct_it(p); if (is_zero(power)) { for (unsigned int i = 0; qit != qe; ++qit, ++i) if (the_weights[i] * CGAL::abs((*qit) - (*pit)) > distance) distance = the_weights[i] * CGAL::abs((*qit)-(*pit)); } else for (unsigned int i = 0; qit != qe; ++qit, ++i) distance += the_weights[i] * pow(CGAL::abs((*qit)-(*pit))); return distance; } //Generic version for DIM > 3 template inline FT transformed_distance(const Query_item& q, const Point_d& p, Dimension_tag) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), qe = construct_it(q,1), pit = construct_it(p); if (is_zero(power)) { for (unsigned int i = 0; qit != qe; ++qit, ++i) if (the_weights[i] * CGAL::abs((*qit) - (*pit)) > distance) distance = the_weights[i] * CGAL::abs((*qit)-(*pit)); } else for (unsigned int i = 0; qit != qe; ++qit, ++i) distance += the_weights[i] * pow(CGAL::abs((*qit)-(*pit))); return distance; } //DIM = 2 loop unrolled inline FT transformed_distance(const Query_item& q, const Point_d& p, Dimension_tag<2>) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), pit = construct_it(p); if (is_zero(power)) { if (the_weights[0] * CGAL::abs((*qit) - (*pit)) > distance) distance = the_weights[0] * CGAL::abs((*qit)-(*pit)); qit++;pit++; if (the_weights[1] * CGAL::abs((*qit) - (*pit)) > distance) distance = the_weights[1] * CGAL::abs((*qit)-(*pit)); } else{ distance += the_weights[0] * pow(CGAL::abs((*qit)-(*pit))); qit++;pit++; distance += the_weights[1] * pow(CGAL::abs((*qit)-(*pit))); } return distance; } //DIM = 3 loop unrolled inline FT transformed_distance(const Query_item& q, const Point_d& p, Dimension_tag<3>) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), pit = construct_it(p); if (is_zero(power)) { if (the_weights[0] * CGAL::abs((*qit) - (*pit)) > distance) distance = the_weights[0] * CGAL::abs((*qit)-(*pit)); qit++;pit++; if (the_weights[1] * CGAL::abs((*qit) - (*pit)) > distance) distance = the_weights[1] * CGAL::abs((*qit)-(*pit)); qit++;pit++; if (the_weights[2] * CGAL::abs((*qit) - (*pit)) > distance) distance = the_weights[2] * CGAL::abs((*qit)-(*pit)); } else{ distance += the_weights[0] * pow(CGAL::abs((*qit)-(*pit))); qit++;pit++; distance += the_weights[1] * pow(CGAL::abs((*qit)-(*pit))); qit++;pit++; distance += the_weights[2] * pow(CGAL::abs((*qit)-(*pit))); } return distance; } inline FT min_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), qe = construct_it(q,1); if (is_zero(power)) { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if (the_weights[i]*(r.min_coord(i) - (*qit)) > distance) distance = the_weights[i] * (r.min_coord(i)- (*qit)); if (the_weights[i] * ((*qit) - r.max_coord(i)) > distance) distance = the_weights[i] * ((*qit)-r.max_coord(i)); } } else { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if ((*qit) < r.min_coord(i)) distance += the_weights[i] * pow(r.min_coord(i)-(*qit)); if ((*qit) > r.max_coord(i)) distance += the_weights[i] * pow((*qit)-r.max_coord(i)); } }; return distance; } inline FT min_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r,std::vector& dists) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), qe = construct_it(q,1); if (is_zero(power)) { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if (the_weights[i]*(r.min_coord(i) - (*qit)) > distance){ dists[i] = (r.min_coord(i)- (*qit)); distance = the_weights[i] * dists[i]; } if (the_weights[i] * ((*qit) - r.max_coord(i)) > distance){ dists[i] = ((*qit)-r.max_coord(i)); distance = the_weights[i] * dists[i]; } } } else { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if ((*qit) < r.min_coord(i)){ dists[i] = r.min_coord(i)-(*qit); distance += the_weights[i] * pow(dists[i]); } if ((*qit) > r.max_coord(i)){ dists[i] = (*qit)-r.max_coord(i); distance += the_weights[i] * pow(dists[i]); } } }; return distance; } inline FT max_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r) const { FT distance=FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), qe = construct_it(q,1); if (is_zero(power)) { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if ((*qit) >= (r.min_coord(i) + r.max_coord(i))/FT(2.0)) { if (the_weights[i] * ((*qit) - r.min_coord(i)) > distance) distance = the_weights[i] * ((*qit)-r.min_coord(i)); else if (the_weights[i] * (r.max_coord(i) - (*qit)) > distance) distance = the_weights[i] * ( r.max_coord(i)-(*qit)); } } } else { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if ((*qit) <= (r.min_coord(i)+r.max_coord(i))/FT(2.0)) distance += the_weights[i] * pow(r.max_coord(i)-(*qit)); else distance += the_weights[i] * pow((*qit)-r.min_coord(i)); } }; return distance; } inline FT max_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r,std::vector& dists) const { FT distance=FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it= traits.construct_cartesian_const_iterator_d_object(); Coord_iterator qit = construct_it(q), qe = construct_it(q,1); if (is_zero(power)) { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if ((*qit) >= (r.min_coord(i) + r.max_coord(i))/FT(2.0)) { if (the_weights[i] * ((*qit) - r.min_coord(i)) > distance){ dists[i] = (*qit)-r.min_coord(i); distance = the_weights[i] * (dists[i]); } else if (the_weights[i] * (r.max_coord(i) - (*qit)) > distance){ dists[i] = r.max_coord(i)-(*qit); distance = the_weights[i] * (dists[i]); } } } } else { for (unsigned int i = 0; qit != qe; ++qit, ++i) { if ((*qit) <= (r.min_coord(i)+r.max_coord(i))/FT(2.0)){ dists[i] = r.max_coord(i)-(*qit); distance += the_weights[i] * pow(dists[i]); } else{ dists[i] = (*qit)-r.min_coord(i); distance += the_weights[i] * pow(dists[i]); } } }; return distance; } inline FT new_distance(FT dist, FT old_off, FT new_off, int cutting_dimension) const { FT new_dist; if (is_zero(power)) { if (the_weights[cutting_dimension]*CGAL::abs(new_off) > dist) new_dist= the_weights[cutting_dimension]*CGAL::abs(new_off); else new_dist=dist; } else { new_dist = dist + the_weights[cutting_dimension] * (pow(CGAL::abs(new_off))-pow(CGAL::abs(old_off))); } return new_dist; } inline FT transformed_distance(FT d) const { if (! is_positive(power)) return d; else return pow(d); } inline FT inverse_of_transformed_distance(FT d) const { if (! is_positive(power)) return d; else return pow(d,1/power); } }; // class Weighted_Minkowski_distance } // namespace CGAL #endif // CGAL_WEIGHTED_MINKOWSKI_DISTANCE_H