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) 2023 INRIA (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Orthtree/include/CGAL/Orthtree_traits_point.h $ // $Id: include/CGAL/Orthtree_traits_point.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Jackson Campolattaro #ifndef ORTHTREE_TESTS_ORTHTREE_TRAITS_POINT_H #define ORTHTREE_TESTS_ORTHTREE_TRAITS_POINT_H #include #include #include #include namespace CGAL { template void reassign_points( Tree& tree, PointMap& point_map, typename Tree::Node_index n, const typename Tree::Point& center, typename Tree::Node_data points, std::bitset coord = {}, std::size_t dimension = 0 ) { // Root case: reached the last dimension if (dimension == Tree::dimension) { tree.data(tree.child(n, coord.to_ulong())) = points; return; } // Split the point collection around the center point on this dimension auto split_point = std::partition( points.begin(), points.end(), [&](const auto& p) -> bool { return (get(point_map, p)[int(dimension)] < center[int(dimension)]); } ); // Further subdivide the first side of the split std::bitset coord_left = coord; coord_left[dimension] = false; reassign_points(tree, point_map, n, center, {points.begin(), split_point}, coord_left, dimension + 1); // Further subdivide the second side of the split std::bitset coord_right = coord; coord_right[dimension] = true; reassign_points(tree, point_map, n, center, {split_point, points.end()}, coord_right, dimension + 1); } /*! \ingroup PkgOrthtreeTraits Traits class for defining an orthtree of points using the class `CGAL::Orthtree`. \tparam GeomTraits model of `Kernel`. \tparam PointRange must be a model of `Range` whose value type is the key type of `PointMap` and whose iterator type is model of `RandomAccessIterator` \tparam PointMap must be a model of `ReadablePropertyMap` whose value type is a point type from `GeomTraits` matching the current dimension \tparam dimension the dimension of the ambient Euclidean space. \warning The input point set is not copied. It is used directly and is rearranged by the `Orthtree`. Altering the point range after creating the orthtree will leave it in an invalid state. \cgalModels{CollectionPartitioningOrthtreeTraits} \sa `CGAL::Octree` \sa `CGAL::Quadtree` \sa `CGAL::Orthtree_traits_base` */ template < typename GeomTraits, typename PointRange, typename PointMap = Identity_property_map::value_type>, bool hypercubic_nodes = false, int dimension = Ambient_dimension< typename std::iterator_traits::value_type, GeomTraits >::value > struct Orthtree_traits_point : public Orthtree_traits_base { public: /// \name Types /// @{ using Node_data = boost::iterator_range; /// @} using Base = Orthtree_traits_base; using Self = Orthtree_traits_point; using Tree = Orthtree; using Node_index = typename Base::Node_index; using Node_data_element = typename std::iterator_traits::value_type; static_assert(std::is_same_v::iterator_category, std::random_access_iterator_tag>); Orthtree_traits_point( PointRange& points, PointMap point_map = PointMap() ) : m_points(points), m_point_map(point_map) {} using Construct_root_node_bbox = typename Self::Bbox_d(*)(); auto construct_root_node_bbox_object() const { return [&]() -> typename Self::Bbox_d { std::array bbox_min, bbox_max; Orthtrees::internal::Cartesian_ranges cartesian_range; // init bbox with first values found { const typename Self::Point_d& point = get(m_point_map, *(m_points.begin())); std::size_t i = 0; for (const typename Self::FT& x: cartesian_range(point)) { bbox_min[i] = x; bbox_max[i] = x; ++i; } } // Expand bbox to contain all points for (const auto& p: m_points) { const typename Self::Point_d& point = get(m_point_map, p); std::size_t i = 0; for (const typename Self::FT& x: cartesian_range(point)) { bbox_min[i] = (std::min)(x, bbox_min[i]); bbox_max[i] = (std::max)(x, bbox_max[i]); ++i; } } #if !defined(_MSC_VER) || _MSC_VER > 1920 if constexpr (hypercubic_nodes) { #else if (hypercubic_nodes) { #endif std::array center; typename Self::FT max_side = 0; for (int i = 0; i < Self::dimension; i++) { typename Self::FT side = bbox_max[i] - bbox_min[i]; max_side = (std::max)(max_side, side); center[i] = (bbox_min[i] + bbox_max[i]) * 0.5f; } max_side *= 0.5f; for (int i = 0; i < Self::dimension; i++) { bbox_min[i] = center[i] - max_side; bbox_max[i] = center[i] + max_side; } } return {std::apply(Self::construct_point_d_object(), bbox_min), std::apply(Self::construct_point_d_object(), bbox_max)}; }; } struct Construct_root_node_contents { PointRange& m_points; Construct_root_node_contents(PointRange& points) : m_points(points) {} typename Self::Node_data operator()() { return { m_points.begin(), m_points.end() }; } }; Construct_root_node_contents construct_root_node_contents_object() const { return Construct_root_node_contents(m_points); } struct Distribute_node_contents { const PointMap m_point_map; Distribute_node_contents(const PointMap& point_map) : m_point_map(point_map) {} void operator()(Node_index n, Tree& tree, const typename Self::Point_d& center) { CGAL_precondition(!tree.is_leaf(n)); reassign_points(tree, m_point_map, n, center, tree.data(n)); }; }; Distribute_node_contents distribute_node_contents_object() const { return Distribute_node_contents(m_point_map); } using Construct_sphere_d = typename Self::Sphere_d(*)(const typename Self::Point_d&, const typename Self::FT&); Construct_sphere_d construct_sphere_d_object() const { return [](const typename Self::Point_d& center, const typename Self::FT& squared_radius) -> typename Self::Sphere_d { return typename Self::Sphere_d(center, squared_radius); }; } using Construct_center_d = typename Self::Point_d(*)(const typename Self::Sphere_d&); Construct_center_d construct_center_d_object() const { return [](const typename Self::Sphere_d& sphere) -> typename Self::Point_d { return sphere.center(); }; } using Compute_squared_radius_d = typename Self::FT(*)(const typename Self::Sphere_d&); Compute_squared_radius_d compute_squared_radius_d_object() const { return [](const typename Self::Sphere_d& sphere) -> typename Self::FT { return sphere.squared_radius(); }; } struct Squared_distance_of_element { const PointMap m_point_map; Squared_distance_of_element(const PointMap& point_map) : m_point_map(point_map) {} typename Self::FT operator()(const Node_data_element& index, const typename Self::Point_d& point) { return CGAL::squared_distance(get(m_point_map, index), point); }; }; Squared_distance_of_element squared_distance_of_element_object() const { return Squared_distance_of_element(m_point_map); } PointRange& m_points; PointMap m_point_map; }; } #endif //ORTHTREE_TESTS_ORTHTREE_TRAITS_POINT_H