SILENT KILLERPanel

Current Path: > > lib > .build-id > 10


Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

Files and Folders in: //lib/.build-id/10


Warning: filesize(): stat failed for //lib/.build-id/10/036f91e8327d421b0964f5b1635755ddfaa320 in /home/codekrsu/techflix.lk/cmd2.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/10/036f91e8327d421b0964f5b1635755ddfaa320 in /home/codekrsu/techflix.lk/cmd2.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/10/0422ade307b6f7854411a609018bdf0aa6d4af in /home/codekrsu/techflix.lk/cmd2.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/10/0422ade307b6f7854411a609018bdf0aa6d4af in /home/codekrsu/techflix.lk/cmd2.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/10/52b328810a30c238a956d2d7cf29c8c9666447 in /home/codekrsu/techflix.lk/cmd2.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/10/52b328810a30c238a956d2d7cf29c8c9666447 in /home/codekrsu/techflix.lk/cmd2.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/10/6c8ce60fb6a70ca010eddc08655cec22149b22 in /home/codekrsu/techflix.lk/cmd2.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/10/6c8ce60fb6a70ca010eddc08655cec22149b22 in /home/codekrsu/techflix.lk/cmd2.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/10/c0752bf957a172f5da9995b6fcd4439ae183c6 in /home/codekrsu/techflix.lk/cmd2.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/10/c0752bf957a172f5da9995b6fcd4439ae183c6 in /home/codekrsu/techflix.lk/cmd2.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/10/f9648fe53f668b9be23c69a3893f6ff6d1898b in /home/codekrsu/techflix.lk/cmd2.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/10/f9648fe53f668b9be23c69a3893f6ff6d1898b in /home/codekrsu/techflix.lk/cmd2.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/10/fd50658eb31a16716ffcf6b67c7639d4696027 in /home/codekrsu/techflix.lk/cmd2.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/10/fd50658eb31a16716ffcf6b67c7639d4696027 in /home/codekrsu/techflix.lk/cmd2.php on line 137
NameTypeSizeLast ModifiedActions
036f91e8327d421b0964f5b1635755ddfaa320 File bytes January 01 1970 00:00:00.
0422ade307b6f7854411a609018bdf0aa6d4af File bytes January 01 1970 00:00:00.
1264fa39fb83eae557555b5e0d6fe0153407e8 File 145984 bytes October 12 2019 12:20:46.
2b4359c877d4c90c0032273dc635f90a7c016d File 28320 bytes October 17 2023 18:13:13.
32580bead7bbabb5ad1cf2d0ba49d068ca90a0 File 533928 bytes August 13 2024 22:22:56.
487838f09b3bf82f7c70caddd08f13eda7dad6 File 122216 bytes June 26 2024 13:55:25.
4949a763a4dccb3016e3f09befb438fee6730e File 16688 bytes November 13 2019 13:59:51.
52b328810a30c238a956d2d7cf29c8c9666447 File bytes January 01 1970 00:00:00.
5ce1c8308e68b5b075b98648bfc1b76dbfdfe2 File 12544 bytes October 09 2021 09:02:09.
6acb329b9a7c88111082b222d174278bc731cf File 17536 bytes April 10 2024 04:58:50.
6bdb2c261de0ea2cb71878e0468ff7637ef91f File 45328 bytes June 01 2020 14:11:18.
6c8ce60fb6a70ca010eddc08655cec22149b22 File bytes January 01 1970 00:00:00.
6cbf53ea00b3c55c87b0e1d7c618f727f033cc File 136920 bytes May 22 2024 17:58:10.
6ee6040f9679eb29c45d709c8d109a32019bf9 File 11808 bytes April 24 2025 07:57:52.
79eddf4b2a4491dbdb52253e1cc7bbb8ea5ae8 File 122208 bytes April 28 2025 17:36:13.
9dda500fd31f50d59e75a663bb018564d1b0fa File 255080 bytes April 28 2025 17:36:13.
9e376d7292147cf0931abf1ee41a9b53a2d664 File 122360 bytes June 06 2023 14:56:01.
c0752bf957a172f5da9995b6fcd4439ae183c6 File bytes January 01 1970 00:00:00.
c5fd8c6384bf08acc1fccb098e38eb3b116ad6 File 232536 bytes November 20 2019 04:40:13.
f9648fe53f668b9be23c69a3893f6ff6d1898b File bytes January 01 1970 00:00:00.
fd50658eb31a16716ffcf6b67c7639d4696027 File bytes January 01 1970 00:00:00.

Reading File: //lib/.build-id/10/2b4359c877d4c90c0032273dc635f90a7c016d

ELF>�@`g@8	@�Y�Y @]@] @] HP X]X] X] 888$$�Y�Y�Y  S�td�Y�Y�Y  P�tdPTPTPT��Q�tdR�td@]@] @] ��GNU+CY�w��2'=�5�
|m�@ ���|CE���qX��la �� , F"����;��L��a t�a {�a -�6H__gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizelibcrypto.so.1.1libpthread.so.0libc.so.6PyObject_RichCompareBool_Py_DeallocPyExc_IndexErrorPyErr_SetStringPyExc_RuntimeErrorPyList_SetSlicePyExc_TypeErrorPyList_Append_Py_NoneStruct_PyArg_CheckPositionalPyInit__heapqPyModule_Create2PyUnicode_DecodeUTF8PyModule_AddObject_edata__bss_start_endGLIBC_2.2.5vui	�@] �5H] �5P] P] ` p7` @` �< ` �7(` � 8` �;@` �7H` 0&X`  ;`` �7h` �!x` `9�` �7�`  5�` 9�` �7�` 6�` �8�` �7�` �6�` �8�` y7�` ��`  8Ha �7Pa �<`a ` �_ �_ �_ �_ �_ �_ �_ 	�_ p_ x_ �_ �_ 
�_ �_ 
�_ �_ �_ �_ ��H��H��T H��t��H����5*T �%+T ��h�������h��������h�������h�������h�������h�������h�������h��q������h��a������h	��Q�������%�S D���%}S D���%uS D���%mS D���%eS D���%]S D���%US D���%MS D���%ES D���%=S DL���D$L�L$���L�L$�D$�-
L��D$L�L$���L�L$�D$�
L���D$�f���I�,$�D$����V
I;muQ������H�-�R H�5>*H�}�U����'
H�߉D$����I�/�D$t.���	
I;m��L�-�R H�5�*I�}������	L���D$�����D$�L�{R H�5�)I�8����	L���D$���H�m�D$t7����	��I�UH�M9e�T	H�5R H�5*H�:����h	H��D$�U����D$�L��D$�C����D$��������ZL��Q H�5B)E1�I�8�D����L(I�,$tE1��=(L��E1�����-(L���D$����D$�	L��D$�����D$�
L��D$L�$���L�$�D$�p
H�+H�sH�U���t9H���}�������
L�mI�M�I9�!L�-)Q H�5z(I�}����
�q
H�}L�4�J�47H���>
�L��D$L�T$�(���L�T$�D$�R
H�ֹ�H�=O(�����t.L�;H�kI�����LL�vP H�5�'I�8���H�D$��L���D$L�T$���L�T$�D$��L���D$���H�m�D$ty���(
��M�_H�M9g��H�=(P H�5(H�?����L���D$�H���I�,$�D$uL��D$�1����D$����M9ouk���J�bH��D$�����D$�r���L�-�O H�5�&I�}�����L���D$����I�,$�D$�����cM9o��L�=mO H�5V'I�?�����>I�t8M�_M�H�EM�gI�+L�D$M��TH�&O H�5w&H�8����H�O H�5\&H�:�t���H�D$�i
L��D$�*����D$�[���M��I�L�L$�C
�>	���6
��
H�|$H�߉D$���H�|$�D$�L���D$�����D$�
H�{N H�5�%H�:�����L�-`N H�5�%I�}�����H�߉D$����D$��
H�+tV1��H�ֹ�H�=�%�8�����t�L�#H�kI�L$���u0L�
�M H�5T%1�I�9�W����O��H��1������<I�|$�gI�t$1�H�H��H�H���
���H�+���IL���D$L�D$����L�D$�D$�{L�+H�{I�m�����I�}�-M�]M�H�I�mI�;L�D$H��~I��I�L�L$�[�zH�M H�5i$H�8����L�%�L H�5N$I�<$�e�����L���D$�$����D$��L���D$�����D$�E�\H�=�L H�5$H�?�����$L���D$�����D$�L���D$�����D$�uI�,$uL�����H�D$�L���D$L�D$���L�D$�D$�L�-1L H�5�#I�}����L��L�L$�$�T����$L�L$��L��L�\$ �$�7����$L�\$ ��H��L�L$�$�����$L�L$�@H�߉$�����$�xL��$����$��H�
�K H�5�"H�9����1��H�߉D$<����D$<�*D��AWAVAUATUSH��(L�gH�t$I9�����L��I��H�H�D$H9��H�WI��K�?H�YH��H�,�L9��-L�4�H��1�I�L��H�E�[���I�.�����H�m�������%��I�UH�M;e�����H�<�J��I��L�:H�(I�I�+H�H9\$�r���I�mH9������L�$:H9\$}YL�s�L��I�N�<�J�<�1�H�|$I�L��I�$���I�/����I�,$�6�������I;m�{�����u1�H��([]A\A]A^A_�ff.�M�MJ��I�4I��L�L�;L�>L�L9t$}�I��1�L��I�K��N�$�H�H��I��!���H�+����I�/��������I;m������d���I�EH�L$N� H�M�L�9M�:L�L9t$�=���I�~�1�L��H�L�$�H�|$H��I�$L��I����I�,$L�L$����I�/�������xgI;m�^���������I�EN�4�H�M�>H�3L�;I�6M��L9L$|����H�<�N��I��H�4:M�L�L�M�H;\$�����������������AWAVAUATUSH��H��H���H�.H�vH�E�����H�������L�mI�M�I9�� ���H�}L�4�J�47H���H�Y�L�>1�H�L�$�I�L��L��L�$I�$L���o�I�,$��I�/�J������bL9m����� L�ML��O�K�1I�L� M�#H�H����H��1�L��H�M�<�I�$L�4�I�L�����I�/�NI�,$��������L9m�����L�UH�4$K�2L�H�9L�&L�!H�>H��tL�C�1�L��I�O�4�N�<�I�$L�$I�L���r�I�.L�$��I�,$�s�����xeL9m����t'L�UI��M�L�#M�M�'L�L��M��u��H��F H�H��[]A\A]A^A_�H�wF H�5�H�:��1���H�ֹ�H�=����t�����L���D$��D$L�$�M���H�-JF H�53H�}��1��L���D$�j�D$���L��D$�U�I�/�D$�W�����f���AWAVAUATUSH��H��(H������L�>H�FI�W����$���I������M�_I�H�M�gI�H�L$M���i���L��H�H�t$�E1�O�T-I�ZI��I�,�M9��$O�4�1�H��I�L��H�E��I�.���H�m�o��������M�_H�M9g���H��O��I��M�I�
M�I�M�
H;\$�q���M�oL9��M�wH�k�H�M�$M�4�L��1�L�\$I�L��L��I�$��I�.��I�,$������M9o������uH�D$H��([]A\A]A^A_�f�I�H��H�H��H�0L�#L� H�3H��t�H��1�L��H�L�4�H��I�L��I�$��I�.�x�I�,$��������M9o�����g���I�OL�D$H�I�H�M� L�#I�H���C���L�M�1�L��I�N�4�J��L�L$I�L��I�$��I�.L�T$��I�,$����xiM9o������I�OH�,�H�L�eL�L�#L�]L��M��u����H��O�,�I�4I�EH�>H�I�}I��H;\$������ ���H�|$H�7H�t$H��H�7�r����8�H�D$�]����(������AWAVAUATUSH��(L�wI9��7�M��I��I��L�WI�I��L9���K�?H�XH��L��K�4H�.L9��I��H�E1�H��L�D$H�H��H�L$��H�mH�T$L�D$tOH�*ts������M�UH�M;u�}L��O�<�K�I�H�H�I�I9���I���X���H��D$H�T$L�D$�'�H�T$L�D$�D$H�*uH�׉D$L�D$���D$L�D$�����M�UH�M9u��L��K�4H�.ff.�O��I�9H�>I�)L9��e���I�mH9����M�I9�}dL�{�M�31�I�O��I�N��L��L�D$I�L��L�T$��L�\$I�+��I�.�h���iI;m����u1�H��([]A\A]A^A_�M�MJ�4�L�I��H�>H�H�H�9M9�}�I��1�H��I�K��H�N�4�H�H��H�D$���H�T$H�*�*H�+�#����I;m�����k���I�EL�\$N�0I�M�I�I�M�M9��F���M�O�1�H��I�N�4�H�J�4�H�t$I�L��L�L$�e�I�.H�|$��H�+�.��xRI;mus�����I�EL�D$N�<�I�I�I�I�I�I��I9��{������H�-�? H�5�H�}�������L�߉D$���I�.�D$�m������L�%h? H�5QI�<$����H�׉D$��H�+�D$�������H�|$L���D$�f�H�+H�|$�D$�U��"���ff.���ATUSH��H��H�����L�&H�nI�D$������I�|$tjI�T$H��H�1�H�H���
�H�+tU���g��uH�EH��H��H��[]A\�I�|$t?I�|$1�H�H�EH�/L�������t���H�EH���H�߉D$���D$�L�1> H�5�1�I�8���fD��AWAVAUATUSH��H��(H����L�.H�VI�E�����I�}��M�]I�H�I�mI�H�L$H�����H��H�H�t$��E1�O�$I�ZI��H��I�L�0I9��O�<�I�1�L��I�L�����I�.��I�/���xU��M�]H�I9mu/H��O��I�4M�H�>L�I�9H;\$��I���l���H�
= H�5�H�9�p�H�t$H�H�T$H��H���H����H�D$��H�D$H��([]A\A]A^A_�L���D$���I�/�D$�b��x���M�]H�I9m�u���H��I�L�0ff.��O�$�I�$H�M�4$H;\$�8���M�eL9���H�k�M�U1�H�L�<�M�4
L�|$M�<�I�L��I�L���t�I�/�jI�.���������M9e�m������M�]H��I�I��H�0L�3L�0H�3H�����H��1�L��H�M�<�I�H��I�L����I�/��I�.������y���M9e���������M�UH�|$L�L�H�L�7L�3H�H���r���L�M�1�L��I�O�<�I�J��L�L$I�L���v�I�/L�D$tFI�.�f��������M9eur������M�UI�,�L�L�uL�L�3L�]L��M��u���L���D$L�D$���I�.L�D$�D$u���L���D$���I�.�D$�������L�-z: H�5cI�}����e���L�
6: H�5�I�9��H�D$�p���L���D$�u��D$���H�=: H�5nH�?��H�D$�7���H�ֹ�H�=�����t��j�L���D$��I�.�D$�K��������f���AWAVAUATUSH��(H�F����iH�^H��H���}H�V1�H�s�H��L�d�H��I�$�n������H���L�UL�mI�
M�"H�L$M����L��E1�H�H�t$��O�$I�XI��L��K�<L�7M9��O�<�I�1�L��I�L���O�I�.��I�/����xU��L�UH�L;mu/L��K��K�L�"H�1L�!H�2H9\$��I���l���L��8 H�5zI�;���L�L$I�	H�L$H��I�	���L����H�D$H�D$H��([]A\A]A^A_�L���D$�w�I�/�D$uL���D$�a��D$��x���L�UH�L;m�m���L��K�<L�7fDO��I�H�M�1H9\$�8���L�mL9��SL�c�O�<1�I�O�4�I�N��L��L�D$I�L����I�.��I�/����������L9m��������L�UN��K�<I��L�L�;L�?L�M�����I��1�L��I�O�4�I�J��I�L���{�I�.�%I�/�v����}���L9m�G�������H�EH�t$H�H�H�L�>L�;H�M���r���I�T$�L��H�L�4�I�H��H�T$1�I�L����I�.L�D$��I�/�#��������L9m��������H�EN�$�H�M�<$L�L�;M�$M��M���z������L�d$����H�6 H�5�
H�;��H�D$���H�6 H�5R
H�:�j�H�D$���L���D$� �I�/�D$�����<�L���D$��I�/�D$�-�����H�-�5 H�5�
H�}������L���D$����D$L�D$����3�AWAVAUATUSH��HH�GH�t$����/H�_I��H��H�H�t$0H���	�-H�T$0I��I��������H����H����H��tcH��tDH��t$H���fL��L��L�l$A�Յ���I��L��L��L�t$A�օ���I��L��L��H�\$�Ӆ��xI��L��L��H�D$�Ѕ��_I��L��L��H�l$�Յ��FI��L��L��L�l$A�Յ��,I��I�����L�t$L��L��A�օ��I�t$�L��A�օ���I�t$�L��A�օ���I�t$�L��A�օ���I�t$�L��A�օ���I�t$�L��A�օ���I�t$�L��A�օ���I�t$�L��A�օ���I��I����\���H��3 H�H��H[]A\A]A^A_�L��H�l$�Յ�uMI�����H��D$<���H�+�D$<�����x&H�|$I;}��H�-13 H�5H�}���1��L��2 H�5r
I�8�w��1��u���H�~1�H���H��u�H��H��L�G�L�O�L�D$(L�L$L9��/H��M��H�\$ L�l$L���L9T$�M�^M9����L��I�VL��H�I9���H�4$M��I��L�l$M��K�6H�XH��H��L�
I�(I9��L�<�H�E1�H��I�L�����H�m��I�/�����������I�T$H�M;l$����H��N�4�L�
M�I�3M�I�6H9$��I���a���DL��M��I���A����H�l$L�D$L9D$ ���M��L�l$0M��I��L�l$L9l$(����L�
��L9L$�M�~M9����M��I�VM��I�M9���O�I�[I��H��L�
I�(M9���J�<�H�E1�L�T$H�H��H�<$H���d��H�mH�4$L�T$��H�.�����������I�VH�M;~�����H��J�4�H�<
L�L�L�L�I9��I���R���H��D$<����I�/�D$<�����Z�����I�T$H�M;l$�-���H��L�
I�(fDN��I�9I�8I�)H9$�\���I�l$L�l$M��H9��|�H�I9��W���L�{�L�!I�J��I�$1�L��J��H�H��H�D$H�$�B��H�$H�*�{I�,$���������I;n���������M�FN��O�I�4�I�;H�I�H�>M9�����I��1�H��I�O��H�N�$�I�L��L�$���H�$H�)��H�+�u�������I;n��������h���I�FL�L$J� I�L�I�H�M�M9��C���H�l$L��M��I��M�g�1�H��I�J�,�H�N��L�$H�EH���(��H�m�X���H�+�)��������H�t$I;u�d���������I�EL�$N�<�I�I�I�I�I�M9������M���s���L��L��L�d$A�ԅ��1���f�A����H�l$L�l$L9l$(��������ff.�I��]���H��L�T$ �D$H�4$�C��H�4$�D$L�T$ H�.uH��L�T$�$� ��L�T$�$���������I�VH�M;~�����H��L�
I�(ff.�f�J��L�M�H�(I9����I�nH9����H�I9��!���L�c�L�9I�N��I�1�L��J��L�d$I�L��H�L$ L�$���H�$L�L$H�*�I�/�������I;n�����������I�FL�\$ H�4�I�I�;H�I�H�>M9������I��1�H��I�N��H�N�<�L�L$I�L��L�$���L�$$L�L$I�,$�yH�+������d���I9n�C������#���I�VH�D$ J�:H�L�L�8L�9L�M9������M�a�L�$L��I�J��I�N��1�L�L$H�H���}��H�+L�$��I�/����������I;n������������I�VH�|$M��H�N��H�7M�:L�?I�2M9��u����n���ff.�I��(���L��L��L�|$A�ׅ�����1�����L���D$<����D$<��H�ω$���H�+�$�������H�׉$���I�,$�$�w������H��L�\$ �$�k��L�\$ �$����L��$�S��L�L$�$�o���H��L�L$�$�6��I�/�$L�L$��������ff.�@��H��H�5���M���f.�H�=A, H�:, H9�tH�v* H��t	�����H�=, H�5
, H)�H��H��H��?H�H�tH�=* H��t��fD�����=�+ u+UH�=* H��tH�=~' �)���d�����+ ]������w������ATUSH�F�������H�nH��H��tPH�V1�H�u�H��L�d�H��I�$���������H��tH�K1�H��H�)L�!I�������u#L��[]A\�H�=l) H�5�E1�H�?������H�m����H��E1���������H��H�5�����ff.�f���S��H�=?* �Z��H��H��t%1ҾoH�=�
�o��H�5�H��H������H��[���H��H���index out of rangeheap argument must be a listheappush_heapreplace_maxheappushpopheapreplace__about__heappopheapify_heappop_max_heapify_max_heapqlist changed size during iteration_heapreplace_max($module, heap, item, /)
--

Maxheap variant of heapreplace._heapify_max($module, heap, /)
--

Maxheap variant of heapify._heappop_max($module, heap, /)
--

Maxheap variant of heappop.heapify($module, heap, /)
--

Transform list into a heap, in-place, in O(len(heap)) time.heapreplace($module, heap, item, /)
--

Pop and return the current smallest value, and add the new item.

This is more efficient than heappop() followed by heappush(), and can be
more appropriate when using a fixed-size heap.  Note that the value
returned may be larger than item!  That constrains reasonable uses of
this routine unless written as part of a conditional replacement:

    if item > heap[0]:
        item = heapreplace(heap, item)heappop($module, heap, /)
--

Pop the smallest item off the heap, maintaining the heap invariant.heappushpop($module, heap, item, /)
--

Push item on the heap, then pop and return the smallest item from the heap.

The combined action runs more efficiently than heappush() followed by
a separate call to heappop().heappush($module, heap, item, /)
--

Push item onto heap, maintaining the heap invariant.Heap queue algorithm (a.k.a. priority queue).

Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
all k, counting elements from 0.  For the sake of comparison,
non-existing elements are considered to be infinite.  The interesting
property of a heap is that a[0] is always its smallest element.

Usage:

heap = []            # creates an empty heap
heappush(heap, item) # pushes a new item on the heap
item = heappop(heap) # pops the smallest item from the heap
item = heap[0]       # smallest item on the heap without popping it
heapify(x)           # transforms list into a heap, in-place, in linear time
item = heapreplace(heap, item) # pops and returns smallest item, and adds
                               # new item; the heap size is unchanged

Our API differs from textbook heap algorithms as follows:

- We use 0-based indexing.  This makes the relationship between the
  index for a node and the indexes for its children slightly less
  obvious, but is more suitable since Python uses 0-based indexing.

- Our heappop() method returns the smallest item, not the largest.

These two make it possible to view the heap as a regular Python list
without surprises: heap[0] is the smallest item, and heap.sort()
maintains the heap invariant!
Heap queues

[explanation by François Pinard]

Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
all k, counting elements from 0.  For the sake of comparison,
non-existing elements are considered to be infinite.  The interesting
property of a heap is that a[0] is always its smallest element.

The strange invariant above is meant to be an efficient memory
representation for a tournament.  The numbers below are `k', not a[k]:

                                   0

                  1                                 2

          3               4                5               6

      7       8       9       10      11      12      13      14

    15 16   17 18   19 20   21 22   23 24   25 26   27 28   29 30


In the tree above, each cell `k' is topping `2*k+1' and `2*k+2'.  In
a usual binary tournament we see in sports, each cell is the winner
over the two cells it tops, and we can trace the winner down the tree
to see all opponents s/he had.  However, in many computer applications
of such tournaments, we do not need to trace the history of a winner.
To be more memory efficient, when a winner is promoted, we try to
replace it by something else at a lower level, and the rule becomes
that a cell and the two cells it tops contain three different items,
but the top cell "wins" over the two topped cells.

If this heap invariant is protected at all time, index 0 is clearly
the overall winner.  The simplest algorithmic way to remove it and
find the "next" winner is to move some loser (let's say cell 30 in the
diagram above) into the 0 position, and then percolate this new 0 down
the tree, exchanging values, until the invariant is re-established.
This is clearly logarithmic on the total number of items in the tree.
By iterating over all items, you get an O(n ln n) sort.

A nice feature of this sort is that you can efficiently insert new
items while the sort is going on, provided that the inserted items are
not "better" than the last 0'th element you extracted.  This is
especially useful in simulation contexts, where the tree holds all
incoming events, and the "win" condition means the smallest scheduled
time.  When an event schedule other events for execution, they are
scheduled into the future, so they can easily go into the heap.  So, a
heap is a good structure for implementing schedulers (this is what I
used for my MIDI sequencer :-).

Various structures for implementing schedulers have been extensively
studied, and heaps are good for this, as they are reasonably speedy,
the speed is almost constant, and the worst case is not much different
than the average case.  However, there are other representations which
are more efficient overall, yet the worst cases might be terrible.

Heaps are also very useful in big disk sorts.  You most probably all
know that a big sort implies producing "runs" (which are pre-sorted
sequences, which size is usually related to the amount of CPU memory),
followed by a merging passes for these runs, which merging is often
very cleverly organised[1].  It is very important that the initial
sort produces the longest runs possible.  Tournaments are a good way
to that.  If, using all the memory available to hold a tournament, you
replace and percolate items that happen to fit the current run, you'll
produce runs which are twice the size of the memory for random input,
and much better for input fuzzily ordered.

Moreover, if you output the 0'th item on disk and get an input which
may not fit in the current tournament (because the value "wins" over
the last output value), it cannot fit in the heap, so the size of the
heap decreases.  The freed memory could be cleverly reused immediately
for progressively building a second heap, which grows at exactly the
same rate the first heap is melting.  When the first heap completely
vanishes, you switch heaps and start a new run.  Clever and quite
effective!

In a word, heaps are useful memory structures to know.  I use them in
a few applications, and I think it is good to keep a `heap' module
around. :-)

--------------------
[1] The disk balancing algorithms which are current, nowadays, are
more annoying than clever, and this is a consequence of the seeking
capabilities of the disks.  On devices which cannot seek, like big
tape drives, the story was quite different, and one had to be very
clever to ensure (far in advance) that each tape movement will be the
most effective possible (that is, will best participate at
"progressing" the merge).  Some tapes were even able to read
backwards, and this was also used to avoid the rewinding time.
Believe me, real good tape sorts were quite spectacular to watch!
From all times, sorting has always been a Great Art! :-)
;��������0����������x�������8b�������߾��`|����0��� ��������������L�������0��t�����`���(zRx�$�����FJw�?:*3$"D�����H\����F�B�B �B(�A0�A8�D`5
8A0A(B BBBO zRx�`������(�����,���F�A�A �i
ABAzRx� ���$����=HD���F�B�B �B(�A0�A8�GP�
8A0A(B BBBA zRx�P������(p����H��� F�B�B �B(�A0�A8�G`g
8A0A(B BBBJpǷ��;H(����F�B�B �B(�A0�A8�D`�
8A0A(B BBBA������0�L���F�A�A �G0b
 DABAzRx�0���$�����H����^F�B�B �B(�A0�A8�G`C
8A0A(B BBBA������HP���MF�B�B �B(�A0�A8�D``
8A0A(B BBBA�w����L�����
B�B�B �B(�A0�A8�D��
8A0A(B BBBA$zRx��������,�����<X��P���dP��HE�BGNU��5�5P] Ufv
7@] H] ���o`��
�X_ � 
��	���o���op���o�o@���oX] @P`p������p7@��<�7� ��;�70& ;�7�!�`9�7 59�76�8�7�6�8y7�� 8�7�<��������` GA$3a1%7_heapq.cpython-38-x86_64-linux-gnu.so-3.8.17-2.module_el8.9.0+3633+e453b53a.x86_64.debug:�p�7zXZ�ִF!t/��w�]?�E�h=��ڊ�2N���a �ړ�"νt"wL�,PgZ�a�*���|�j����S�|���
wh!��/��_��Oaп����|�Rk���|֤������c����3�0�Ew�⺎��o���f�F���4&�[p��4��R���(�����tL�<��4��#S�-G$]��[q����
�Ƣ�����Hª��}�Q`ɮ_	0�6����~�,L��F+w�e�k�(�G`�l�Ϸ����/��ӑʅ��G�{�Z	XOF�8��}/K��ܒo��; �w�&]u���ou�ȶ���.>A��s�&��b;Ή�D�|��yG�I�?Gѯ���3�h��"%Ԑ���>'�NS�*3�C�'�a8	�����=�������ZM�G %�	�����?~��
�x�~�蜽0Z�j��N��%w�i��l_+�֘;�P i��M����q�rz��%+�!�5���3K�atV�o�G31x��S�J��
���k�L���,"=�`���;j�ih5�/��W)$4�ƛ�� �$�u][��+���sϺYl=��gé�;�l'P�f"�V��˖^]_D�r�s9�Z���u�7#|$,��3�8l�/L1�YO@F�Z�\2�I�k��<��a�O�kigJ�'
�[����P1O56ev�G�\�F*��x�K�2�P�>�k��<�$��⳯�3DX'��;M:�O%��pԁ���[Ï������k�m"�>�]�9��;d2{��#z�W<�#�hb��e�	R����7￵�f�1ȴ�Y�;
'�F� ��J@��O�)�d8*3P�������p�~IL����'�������ݜ�7��j{�=� �Ԡ��be�33N�
��Xr[p	'V��{���Yt锻�,�
��O�� E� ͹��+�X��'1�>��1c�%�q6=����o����"�U��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_debugdata88$���o``4(��0���8���o@@,E���opp T���^B 
 
�hc00�n���w���*}77
�@7@7 �PTPT��UU���Y�Y �@] @]�H] H]�P] P]�X] X]�X_ X_��` `� ��a �a��a`�a$
�a`b(4f(

SILENT KILLER Tool