A PHP Error was encountered

Severity: Warning

Message: mysqli::real_connect(): (HY000/2002): Cannot assign requested address

Filename: mysqli/mysqli_driver.php

Line Number: 201

Backtrace:

File: /www/wwwroot/dash.konsole.xyz/application/core/MY_Controller.php
Line: 343
Function: __construct

File: /www/wwwroot/dash.konsole.xyz/application/controllers/Api.php
Line: 12
Function: __construct

File: /www/wwwroot/dash.konsole.xyz/index.php
Line: 316
Function: require_once

Database Error

数据库发生错误。

无法使用提供的设置连接到数据库服务器。

Filename: core/MY_Controller.php

Line Number: 343


Fatal error: Uncaught Error: Call to a member function close() on string in /www/wwwroot/dash.konsole.xyz/application/core/MY_Controller.php:349 Stack trace: #0 [internal function]: Index_Controller->__destruct() #1 {main} thrown in /www/wwwroot/dash.konsole.xyz/application/core/MY_Controller.php on line 349
HEX
HEX
Server: Apache
System: Linux sys.digiflyeg.com 4.18.0-553.62.1.lve.el8.x86_64 #1 SMP Mon Jul 21 17:50:35 UTC 2025 x86_64
User: opal (1023)
PHP: 8.1.33
Disabled: exec,passthru,shell_exec,system
Upload Files
File: //lib/.build-id/69/974b9b3d75ae8f0878cec70e0585ca8a00ca1f
ELF>�
@ 0@8@�� 00 0 �� HH H $$���  P�td���TTQ�tdR�td00 0 ��GNUi�K�=u��x���ʊ��@ ABE���|�����qX
 ��U,h� N���, F"��) � ) ?�) __gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizePySequence_GetItemPyObject_RichCompareBoolPySequence_SizePyExc_ValueErrorPyErr_SetString_PyArg_ParseTupleAndKeywords_SizeTPyList_Type_PyObject_CallMethodId_SizeT_Py_NoneStructPyList_Insert__stack_chk_failPyLong_FromSsize_tPyInit__bisectPyModule_Create2libpython3.5m.so.1.0libpthread.so.0libc.so.6_edata__bss_start_endGLIBC_2.2.5GLIBC_2.4/opt/alt/python35/lib64:/opt/alt/sqlite/usr/lib64�ui	�ii
�0 �8 P@ @ �& ��& ��& ��& ��& ��& ��& ��& � ' �(' �0' �8' �`' �h' �p' �x' ��' ��'   �'  (  ( }(( P8( % @( �H( PX( 0! `( Xh( �x( $ �( ��( ��( ! �( k�( ��( `" �( C�( ��( `! ) �� � � 
� 
� � � p x � � � � � 	� � � � ��H��H�� H��t��H����5� �%� ��h�������h��������h�������h�������h�������h�������h�������h��q������h��a������h	��Q������h
��A�������%5 D���%- D���%% D���% D���% D���%
 D���% D���%� D���%� D���%� D���%� DH�=1 H�* H9�tH�� H��t	�����H�= H�5� H)�H��H��H��?H�H�tH�� H��t��fD�����=� u+UH�=� H��tH�=� �Y����d����� ]������w����AWAVAUATUSH��H�t$H����I��I��I��H���tuM9�|�ZfDL�eM9�~KK�,,L��H��H���m���H��H��t]H�t$1�H���v���H�+Lc�u
H�SH��R0M��x6u�I��M9��H��L��[]A\A]A^A_�f��K���I��H���z����H�����H��[]A\A]A^A_�H�[ H�5�H�8����H���������H��8H��H�
� H��dH�%(H�D$(1�H�D$ H�|H�D$H�D$ ����PH�D$ P1�L�L$ L�D$����ZY����H�L$ H�T$H�t$H�|$���H��xmH�|$L�D$H�
� H9OtFH��H�1�H�5� �n���H��t9H�(t;H�� H�H�L$(dH3%(u,H��8�L��H�������yΐ1���@H�PH��R0�����AWAVAUATUSH��H�t$H����I��I��I��H���tuM9�|�ZfDL�eM9�~KK�,,L��H��H���m���H��H��t]H�|$1�H���v���H�+Lc�u
H�SH��R0M��x6t�I��M9��H��L��[]A\A]A^A_�f��K���I��H���z����H�����H��[]A\A]A^A_�H�[ H�5�H�8����H���������H��8H��H�
> H��dH�%(H�D$(1�H�D$ H��H�D$H�D$ ����PH�D$ P1�L�L$ L�D$����ZY����H�L$ H�T$H�t$H�|$���H��xmH�|$L�D$H�
�
 H9OtFH��H�1�H�5� �n���H��t9H�(t;H��
 H�H�L$(dH3%(u,H��8�L��H�������yΐ1���@H�PH��R0�������H��8H��H�
n H��dH�%(H�D$(1�H�D$ H��H�D$H�D$ ����PH�D$ P1�L�L$ L�D$����ZY��t?H�L$ H�T$H�t$H�|$���H��x!H���I���H�L$(dH3%(u
H��8�@1���������H��8H��H�
> H��dH�%(H�D$(1�H�D$ H��H�D$H�D$ ����PH�D$ P1�L�L$ L�D$����ZY��t?H�L$ H�T$H�t$H�|$����H��x!H�����H�L$(dH3%(u
H��8�@1����G��������H�=� �����H��H���lo must be non-negativeOO|nn:insort_leftnOOO|nn:insort_rightOO|nn:bisect_leftOO|nn:bisect_rightaxlohi_bisectinsortinsert;P	���l����������8����������T���zRx�$P����FJw�?:*3$"D���`\@����B�B�B �B(�A0�A8�DP�
8D0A(B BBBCc
8A0A(B BBBA$����	H@|HFPRHA@
D`������B�B�B �B(�A0�A8�DP�
8D0A(B BBBCc
8A0A(B BBBA$L@���	H@|HFPRHA@
D$t(����H@|HFPRHA@~
E$������H@|HFPRHA@~
E�8���GNU��P@ _t��H
0 8 ���o(p`
�X @��	���o���o����o�o^���o)H ��������

 
Bisection algorithms.

This module provides support for maintaining a list in sorted order without
having to sort the list after each insertion. For long lists of items with
expensive comparison operations, this can be an improvement over the more
common approach.
Alias for insort_right().
Alias for bisect_right().
insort_left(a, x[, lo[, hi]])

Insert item x in list a, and keep it sorted assuming a is sorted.

If x is already in a, insert it to the left of the leftmost x.

Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
bisect_left(a, x[, lo[, hi]]) -> index

Return the index where to insert item x in list a, assuming a is sorted.

The return value i is such that all e in a[:i] have e < x, and all e in
a[i:] have e >= x.  So if x already appears in the list, i points just
before the leftmost x already there.

Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
insort_right(a, x[, lo[, hi]])

Insert item x in list a, and keep it sorted assuming a is sorted.

If x is already in a, insert it to the right of the rightmost x.

Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
bisect_right(a, x[, lo[, hi]]) -> index

Return the index where to insert item x in list a, assuming a is sorted.

The return value i is such that all e in a[:i] have e <= x, and all e in
a[i:] have e > x.  So if x already appears in the list, i points just
beyond the rightmost x already there

Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
�����������������  �������� ( }P% �P0! X�$ ��! k�`" C�`! �GA$3a1�
�
GA$3a1 GA$3a1�
�GA$3p864�GA$gcc 8.2.1 20180905GA*GOW*EGA*GA+stack_clashGA*cf_protectionGA+GLIBCXX_ASSERTIONS
GA*FORTIFYGA*GA!GA*GA!stack_realignGA$3a1^cGA$3a1 %_bisect.cpython-35m-x86_64-linux-gnu.so-3.5.7-4.el8.x86_64.debug�vJ&�7zXZ�ִF!t/���M]?�E�h=��ڊ�2N���L��#v���ة��^!�3;�zA"t��uC�Z�k�o��vq���/`Q�6yҔº�f�&(�������e0�^4�U�	��u��q�+-���@�;#�`�����=�2k�%��?�D�6����I���
��=�
��6J>?4w ;;u8u�ݳ�V	]�ɓ��!!���GQ�46�q"\+��nQQy9�)� ><�ҳ8I�28��'���tT'"j�����m�[��N��.9�����X6qL�&���dU�HI�Qo#^��Q>;���E�SKg>#̩��2c��
�0	�Te%��	Fj�*��U�>����z��6yӑ�g�Rr�ʓz<6"m���@���f��4�(��[q�}ԅ����q�{
�m�xx�C��9�
�i22�2K��^��r$�=�,�J���3`ݤ�É?�a�Ľ���]̢U�ъ y�n��Ú��h/-�G�ŀlB�%;:�}~�-�wQ�����T��'p[܌K�g;�
a|�H�D)�r�-�����9�/����Ǜc/A=�K֤[d�V�ױ3��tv�uF ���Q�ף$N~�S�PH���)��
��Ƥ��x7U�_�jT��r��9�Ϧ��w��k��rR���8�oq�������W���}�=���;t�b��,��u�@8�Ҋ�W��-���7@�n��s�n�A꾌gIG��g2>�YZ�o%
�
�s�;��MǷG�~��	�V��.�L�Y���Ty���.��g����[�͐%�p��_�ό�B/$�
՝Jei�hf�|��>Ƒ�9ؽ���͖9����t��g�YZ.shstrtab.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.plt.sec.text.fini.rodata.eh_frame_hdr.eh_frame.note.gnu.property.init_array.fini_array.data.rel.ro.dynamic.got.data.bss.gnu.build.attributes.gnu_debuglink.gnu_debugdata$���o((4(``0pp�8���o^^,E���o��0T���^B@@hHHcpp�n0
0
�w�
�
5}
�2%%����T����� �0 0�8 8�@ @�H H�X X��   	 �) )� )`)
 +Hh+��.(