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
// Protocol Buffers - Google's data interchange format // Copyright 2008 Google Inc. All rights reserved. // // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file or at // https://developers.google.com/open-source/licenses/bsd #ifndef GOOGLE_PROTOBUF_COMPILER_SCC_H__ #define GOOGLE_PROTOBUF_COMPILER_SCC_H__ #include #include #include "absl/container/flat_hash_map.h" #include "absl/container/flat_hash_set.h" #include "absl/log/absl_check.h" #include "absl/memory/memory.h" #include "google/protobuf/descriptor.h" // Must be included last. #include "google/protobuf/port_def.inc" namespace google { namespace protobuf { namespace compiler { // Description of each strongly connected component. Note that the order // of both the descriptors in this SCC and the order of children is // deterministic. struct SCC { std::vector descriptors; std::vector children; const Descriptor* GetRepresentative() const { return descriptors[0]; } // All messages must necessarily be in the same file. const FileDescriptor* GetFile() const { return descriptors[0]->file(); } bool Contains(const Descriptor& message) const { return std::find(descriptors.begin(), descriptors.end(), &message) != descriptors.end(); } }; // This class is used for analyzing the SCC for each message, to ensure linear // instead of quadratic performance, if we do this per message we would get // O(V*(V+E)). template class PROTOC_EXPORT SCCAnalyzer { public: explicit SCCAnalyzer() : index_(0) {} SCCAnalyzer(const SCCAnalyzer&) = delete; SCCAnalyzer& operator=(const SCCAnalyzer&) = delete; SCCAnalyzer(SCCAnalyzer&&) = default; SCCAnalyzer& operator=(SCCAnalyzer&&) = default; const SCC* GetSCC(const Descriptor* descriptor) { auto it = cache_.find(descriptor); if (it == cache_.end()) { return DFS(descriptor).scc; } return it->second->scc; } private: struct NodeData { const SCC* scc; // if null it means its still on the stack int index; int lowlink; }; absl::flat_hash_map> cache_; std::vector stack_; int index_; std::vector> garbage_bin_; SCC* CreateSCC() { garbage_bin_.emplace_back(new SCC()); return garbage_bin_.back().get(); } // Tarjan's Strongly Connected Components algo NodeData DFS(const Descriptor* descriptor) { // Mark visited by inserting in map. auto ins = cache_.try_emplace(descriptor, absl::make_unique()); // Must not have visited already. ABSL_DCHECK(ins.second); NodeData& result = *ins.first->second; // Initialize data structures. result.index = result.lowlink = index_++; stack_.push_back(descriptor); // Recurse the fields / nodes in graph for (const auto* dep : DepsGenerator()(descriptor)) { ABSL_CHECK(dep); auto it = cache_.find(dep); if (it == cache_.end()) { // unexplored node NodeData child_data = DFS(dep); result.lowlink = std::min(result.lowlink, child_data.lowlink); } else { NodeData& child_data = *it->second; if (child_data.scc == nullptr) { // Still in the stack_ so we found a back edge result.lowlink = std::min(result.lowlink, child_data.index); } } } if (result.index == result.lowlink) { // This is the root of a strongly connected component SCC* scc = CreateSCC(); while (true) { const Descriptor* scc_desc = stack_.back(); scc->descriptors.push_back(scc_desc); // Remove from stack stack_.pop_back(); cache_[scc_desc]->scc = scc; if (scc_desc == descriptor) break; } // The order of descriptors is random and depends how this SCC was // discovered. In-order to ensure maximum stability we sort it by name. std::sort(scc->descriptors.begin(), scc->descriptors.end(), [](const Descriptor* a, const Descriptor* b) { return a->full_name() < b->full_name(); }); AddChildren(scc); } return result; } // Add the SCC's that are children of this SCC to its children. void AddChildren(SCC* scc) { absl::flat_hash_set seen; for (auto descriptor : scc->descriptors) { for (auto child_msg : DepsGenerator()(descriptor)) { ABSL_CHECK(child_msg); const SCC* child = GetSCC(child_msg); if (child == scc) continue; if (seen.insert(child).second) { scc->children.push_back(child); } } } } }; } // namespace compiler } // namespace protobuf } // namespace google #include "google/protobuf/port_undef.inc" #endif // GOOGLE_PROTOBUF_COMPILER_SCC_H__