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 2022 Google LLC // SPDX-License-Identifier: Apache-2.0 // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // Per-target include guard #if defined(HIGHWAY_HWY_CONTRIB_ALGO_TRANSFORM_INL_H_) == \ defined(HWY_TARGET_TOGGLE) #ifdef HIGHWAY_HWY_CONTRIB_ALGO_TRANSFORM_INL_H_ #undef HIGHWAY_HWY_CONTRIB_ALGO_TRANSFORM_INL_H_ #else #define HIGHWAY_HWY_CONTRIB_ALGO_TRANSFORM_INL_H_ #endif #include #include "hwy/highway.h" HWY_BEFORE_NAMESPACE(); namespace hwy { namespace HWY_NAMESPACE { // These functions avoid having to write a loop plus remainder handling in the // (unfortunately still common) case where arrays are not aligned/padded. If the // inputs are known to be aligned/padded, it is more efficient to write a single // loop using Load(). We do not provide a TransformAlignedPadded because it // would be more verbose than such a loop. // // Func is either a functor with a templated operator()(d, v[, v1[, v2]]), or a // generic lambda if using C++14. The d argument is the same as was passed to // the Generate etc. functions. Due to apparent limitations of Clang, it is // currently necessary to add HWY_ATTR before the opening { of the lambda to // avoid errors about "always_inline function .. requires target". // // We do not check HWY_MEM_OPS_MIGHT_FAULT because LoadN/StoreN do not fault. // Fills `out[0, count)` with the vectors returned by `func(d, index_vec)`, // where `index_vec` is `Vec>`. On the first call to `func`, // the value of its lane i is i, and increases by `Lanes(d)` after every call. // Note that some of these indices may be `>= count`, but the elements that // `func` returns in those lanes will not be written to `out`. template > void Generate(D d, T* HWY_RESTRICT out, size_t count, const Func& func) { const RebindToUnsigned du; using TU = TFromD; const size_t N = Lanes(d); size_t idx = 0; Vec vidx = Iota(du, 0); if (count >= N) { for (; idx <= count - N; idx += N) { StoreU(func(d, vidx), d, out + idx); vidx = Add(vidx, Set(du, static_cast(N))); } } // `count` was a multiple of the vector length `N`: already done. if (HWY_UNLIKELY(idx == count)) return; const size_t remaining = count - idx; HWY_DASSERT(0 != remaining && remaining < N); StoreN(func(d, vidx), d, out + idx, remaining); } // Calls `func(d, v)` for each input vector; out of bound lanes with index i >= // `count` are instead taken from `no[i % Lanes(d)]`. template > void Foreach(D d, const T* HWY_RESTRICT in, const size_t count, const Vec no, const Func& func) { const size_t N = Lanes(d); size_t idx = 0; if (count >= N) { for (; idx <= count - N; idx += N) { const Vec v = LoadU(d, in + idx); func(d, v); } } // `count` was a multiple of the vector length `N`: already done. if (HWY_UNLIKELY(idx == count)) return; const size_t remaining = count - idx; HWY_DASSERT(0 != remaining && remaining < N); const Vec v = LoadNOr(no, d, in + idx, remaining); func(d, v); } // Replaces `inout[idx]` with `func(d, inout[idx])`. Example usage: multiplying // array elements by a constant. template > void Transform(D d, T* HWY_RESTRICT inout, size_t count, const Func& func) { const size_t N = Lanes(d); size_t idx = 0; if (count >= N) { for (; idx <= count - N; idx += N) { const Vec v = LoadU(d, inout + idx); StoreU(func(d, v), d, inout + idx); } } // `count` was a multiple of the vector length `N`: already done. if (HWY_UNLIKELY(idx == count)) return; const size_t remaining = count - idx; HWY_DASSERT(0 != remaining && remaining < N); const Vec v = LoadN(d, inout + idx, remaining); StoreN(func(d, v), d, inout + idx, remaining); } // Replaces `inout[idx]` with `func(d, inout[idx], in1[idx])`. Example usage: // multiplying array elements by those of another array. template > void Transform1(D d, T* HWY_RESTRICT inout, size_t count, const T* HWY_RESTRICT in1, const Func& func) { const size_t N = Lanes(d); size_t idx = 0; if (count >= N) { for (; idx <= count - N; idx += N) { const Vec v = LoadU(d, inout + idx); const Vec v1 = LoadU(d, in1 + idx); StoreU(func(d, v, v1), d, inout + idx); } } // `count` was a multiple of the vector length `N`: already done. if (HWY_UNLIKELY(idx == count)) return; const size_t remaining = count - idx; HWY_DASSERT(0 != remaining && remaining < N); const Vec v = LoadN(d, inout + idx, remaining); const Vec v1 = LoadN(d, in1 + idx, remaining); StoreN(func(d, v, v1), d, inout + idx, remaining); } // Replaces `inout[idx]` with `func(d, inout[idx], in1[idx], in2[idx])`. Example // usage: FMA of elements from three arrays, stored into the first array. template > void Transform2(D d, T* HWY_RESTRICT inout, size_t count, const T* HWY_RESTRICT in1, const T* HWY_RESTRICT in2, const Func& func) { const size_t N = Lanes(d); size_t idx = 0; if (count >= N) { for (; idx <= count - N; idx += N) { const Vec v = LoadU(d, inout + idx); const Vec v1 = LoadU(d, in1 + idx); const Vec v2 = LoadU(d, in2 + idx); StoreU(func(d, v, v1, v2), d, inout + idx); } } // `count` was a multiple of the vector length `N`: already done. if (HWY_UNLIKELY(idx == count)) return; const size_t remaining = count - idx; HWY_DASSERT(0 != remaining && remaining < N); const Vec v = LoadN(d, inout + idx, remaining); const Vec v1 = LoadN(d, in1 + idx, remaining); const Vec v2 = LoadN(d, in2 + idx, remaining); StoreN(func(d, v, v1, v2), d, inout + idx, remaining); } template > void Replace(D d, T* HWY_RESTRICT inout, size_t count, T new_t, T old_t) { const size_t N = Lanes(d); const Vec old_v = Set(d, old_t); const Vec new_v = Set(d, new_t); size_t idx = 0; if (count >= N) { for (; idx <= count - N; idx += N) { Vec v = LoadU(d, inout + idx); StoreU(IfThenElse(Eq(v, old_v), new_v, v), d, inout + idx); } } // `count` was a multiple of the vector length `N`: already done. if (HWY_UNLIKELY(idx == count)) return; const size_t remaining = count - idx; HWY_DASSERT(0 != remaining && remaining < N); const Vec v = LoadN(d, inout + idx, remaining); StoreN(IfThenElse(Eq(v, old_v), new_v, v), d, inout + idx, remaining); } template > void ReplaceIf(D d, T* HWY_RESTRICT inout, size_t count, T new_t, const Func& func) { const size_t N = Lanes(d); const Vec new_v = Set(d, new_t); size_t idx = 0; if (count >= N) { for (; idx <= count - N; idx += N) { Vec v = LoadU(d, inout + idx); StoreU(IfThenElse(func(d, v), new_v, v), d, inout + idx); } } // `count` was a multiple of the vector length `N`: already done. if (HWY_UNLIKELY(idx == count)) return; const size_t remaining = count - idx; HWY_DASSERT(0 != remaining && remaining < N); const Vec v = LoadN(d, inout + idx, remaining); StoreN(IfThenElse(func(d, v), new_v, v), d, inout + idx, remaining); } // NOLINTNEXTLINE(google-readability-namespace-comments) } // namespace HWY_NAMESPACE } // namespace hwy HWY_AFTER_NAMESPACE(); #endif // HIGHWAY_HWY_CONTRIB_ALGO_TRANSFORM_INL_H_