SILENT KILLERPanel

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


Operation   : Linux premium88.web-hosting.com 4.18.0-553.54.1.lve.el8.x86_64 #1 SMP Wed Jun 4 13:01:13 UTC 2025 x86_64
Software     : Apache
Server IP    : 185.61.154.216 | Your IP: 216.73.216.44
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

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


Warning: filesize(): stat failed for //lib/.build-id/00/9219e358382627110aa2873705f9e5a571b03b in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/00/9219e358382627110aa2873705f9e5a571b03b in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/00/a337906c91f4404dd900d1292c65fde884fc44 in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/00/a337906c91f4404dd900d1292c65fde884fc44 in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/00/ac4539aeb462508c811e4e9b589d476b7b8f3d in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/00/ac4539aeb462508c811e4e9b589d476b7b8f3d in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/00/cd2682bb03f2fd95d69809b4885cca619ab7d3 in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/00/cd2682bb03f2fd95d69809b4885cca619ab7d3 in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 137

Warning: filesize(): stat failed for //lib/.build-id/00/df9fd4e5f7cbb612777bbe59664bad56b1c0a0 in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 136

Warning: filemtime(): stat failed for //lib/.build-id/00/df9fd4e5f7cbb612777bbe59664bad56b1c0a0 in /home/ivftiowh/greeceivf.com/classwithtostring.php on line 137
NameTypeSizeLast ModifiedActions
1e329e042e7ffa9a93f8a71738c171a02fb83f File 20960 bytes May 27 2025 12:53:20.
3198aff921ebdd2b0ba306d96c9dc3bac3ba0f File 27144 bytes August 26 2025 09:08:24.
3fab781f5405e435925c669bbec43695dd9913 File 54536 bytes July 26 2023 14:22:17.
4a7a4d382f4d8d4d58eaa269507b134a5d10b8 File 1165032 bytes July 14 2025 11:29:32.
54b21f2f10b101bee258ab8285aea80cd067ed File 20872 bytes April 30 2025 15:06:42.
55939946995aecc8c3b3c29cdd92612cf56b05 File 11760 bytes July 26 2023 15:03:21.
57476727376e70548227866e8101fc5a8f22c6 File 50352 bytes October 13 2019 16:14:46.
5d090a6877f04587814c16eb641a27574a1ac0 File 42936 bytes April 01 2023 08:44:39.
65fbe6927baf3ef99c0714a97a432a1a7fb929 File 6936 bytes April 01 2023 03:54:39.
6bdb1f47c1c7911cdc9f8794798d100d71e26a File 23486232 bytes March 22 2023 11:32:44.
9219e358382627110aa2873705f9e5a571b03b File bytes January 01 1970 00:00:00.
9a74807f63adc13a202aeb90efcd61b1454d0d File 12024 bytes April 05 2023 15:24:56.
a337906c91f4404dd900d1292c65fde884fc44 File bytes January 01 1970 00:00:00.
ac4539aeb462508c811e4e9b589d476b7b8f3d File bytes January 01 1970 00:00:00.
ad6ddd8247bc9cae77eb2bb45a82a24e8e265e File 12064 bytes August 05 2025 14:12:44.
aedb4a281060fa3fa63805c5aa9039718e2498 File 12064 bytes August 05 2025 14:12:44.
b07541bcdff3ea4657a6233b76475e4c6132c9 File 355992 bytes June 03 2025 02:06:30.
b39507f9c70ad7f28ebb1a87103608274d109c File 50896 bytes April 01 2023 08:44:39.
b7a2c2f29062c324917bf99f336b490108fd7b File 11832 bytes July 26 2023 15:03:21.
b87b7499385492a856fffc628e5085a176ced0 File 32952 bytes July 26 2023 14:48:52.
c598b8a81bd4d7b59cdd1651e2af3716efe80e File 297792 bytes October 08 2021 15:22:06.
c86f1fadd5e4b0520c11dac9b4670028d0b68c File 320072 bytes March 11 2025 12:11:55.
cd2682bb03f2fd95d69809b4885cca619ab7d3 File bytes January 01 1970 00:00:00.
cf554e6fb343cad95b4c0ed2dfd2c64869725b File 318968 bytes July 26 2023 14:09:05.
d60d944767fb53acf4514d7e32f1fcb238b6df File 11816 bytes July 26 2023 14:55:54.
df790271a242aecfb729f499d3ef14f093a459 File 37672 bytes October 14 2023 20:31:02.
df9fd4e5f7cbb612777bbe59664bad56b1c0a0 File bytes January 01 1970 00:00:00.

Reading File: //lib/.build-id/00/3198aff921ebdd2b0ba306d96c9dc3bac3ba0f

ELF>�@�b@8	@�1�1 0=0= 0= �� H=H= H= 888$$x1x1x1  S�tdx1x1x1  P�td0,0,0,��Q�tdR�td0=0= 0= ��GNU1���!��+��l�úú�@ ���|CE���qX��lv �� , F"��1"P��a�] �] �] B+X__gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizelibcrypto.so.1.1libpython3.6m.so.1.0libpthread.so.0libc.so.6PyObject_RichCompareBoolPyExc_RuntimeErrorPyErr_SetStringPyExc_IndexErrorPyList_SetSlicePyExc_TypeErrorPyArg_UnpackTuplePyList_Append_Py_NoneStruct__stack_chk_failPyInit__heapqPyModule_Create2PyUnicode_DecodeUTF8PyModule_AddObject_edata__bss_start_endGLIBC_2.4GLIBC_2.2.5�ii
�ui	�0= *8= �)@= @= �[ �+�[ ��[ �C �[ �+�[ ��[ �B �[ �+�[ @�[ `B �[ �+�[ ��[ �@ \ �+\ �*\ `@  \ �+(\ *8\ @@ @\ �+H\ pX\  @ `\ �+h\ �*x\ @ �\ �+�\ D �\ �[ �? �? �? �? �? �? 	�? 
�? p? x? �? �? �? �? 
�? �? �? �? ��H��H�q4 H��t��H����5�3 �%�3 ��h�������h��������h�������h�������h�������h�������h�������h��q������h��a������h	��Q�������%U3 D���%M3 D���%E3 D���%=3 D���%53 D���%-3 D���%%3 D���%3 D���%3 D���%
3 DI�N�D$L���Q0I�m�D$��������H�I�GI9o��L�3 H�5I�:�������D$I�EL��P0I�.�D$t0����M;g��L�=�2 H�5�I�?�I������cI�v�D$L���V0�D$�L�~2 H�5�I�;�������1L�
`2 H�5�I�9������I�u�D$L��V0�D$���������L�
�1 H�5�E1�I�9����I�,$tE1��M�D$L��E1�A�P0�yH��1 H�5VH�8�v����H�s�D$H�<$H��V0H�<$�D$�sH�D$�M�N�D$L��A�Q0I�m�D$uM�U�D$L��A�R0�D$���(��M�_H�I;o��H�
T1 H�5eH�9����H�11 H�5�H�:������M�F�D$L��A�P0H�m�D$t)����M9otKL�=�0 H�5I�?����L�M�D$H��A�Q0�D$��L��0 H�57I�;�W����k�����3H�-�0 H�5H�}�.�����	H�z0 H�5�H�:������	I�t$�D$H�|$L��V0H�|$�D$�K	H�mt$1��
H�0 H�5�1�H�8�����p
L�UH��1�A�R0�^
M�\$�D$L��H�L$A�S0H�L$�D$�Q
L��/ H�5VI�8�v����H��/ H�5;H�:�[����I�,$uM�|$L��A�W0H�D$�QM�U�D$L��L�\$A�R0L�\$�D$�H�
d/ H�5�H�9�����H�I/ H�5�H�:�����I�L$�D$<L��Q0�D$<��M�^�D$ L��L�$A�S0L�$�D$ �H�=�. H�5oH�?���1��]���AWAVAUATUSH��(H�oH�t$H9��/���H��I��H�H�D$H9��eH�GI��K�$H�ZH��L�,�H9�}zL�4�L��1�I�L��I�E���I�.�%���I�m�	������#��H�I�GI;o�7���H�<�N�$�L�,8I�$M�uI�UM�4$H9\$~7I���q���H�<�N��L�8M�M�M�M�
H;\$|�ff.��M�gI9��d���L�48H9\$��H�k�1�L��H�L�,�H��H�L$I�EL��I��&���I�m�����I�.�����xNM;g�������t/I�GH�|$H��H�L�3L�L�7L�H��H9l$|�f�1�H��([]A\A]A^A_���f.���AWH����AVH�5�AUATUSH��8dH�%(H�D$(1�L�L$L�D$ �������H�|$ H�G�����H�t$�#�������L�|$ I�L�o�L9������M�GK��M��~xH�M�e�H�<$1�H��I�K�,�H�N�4�H�EH�����H�mH�<$��H�+�n�����xkI;uO��t!M�GO��M�M��M�I�I�M�
M��u�f�H�, H�H�L$(dH3%(uCH��8[]A\A]A^A_�L��+ H�5�I�;�p���1���L�=�+ H�5II�?�V���1���
���H�M�D$H�<$H��Q0H�+H�<$�D$�J������@��AWH����AVH�5AUATUSH��HdH�%(H�D$81�L�L$0L�D$(�k����������H�D$(H�P����H�x��H�HH�t$0H�H�H�1L�|$(H�\$I�oH�������H��H�H�|$��M�_E1�O�$I�XI��M�,�L9�~GO�4�1�L��I�L��I�E�1���I�.��I�m������xA��M�_H�I;o����H��O�$�I�I�$H�1H�I�4$H9\$~oI���w���H�t$L�.L�l$I��L�.�{���H�nH���U0H�D$f.�H�t$8dH34%(H�D$��H��H[]A\A]A^A_��M�oL9���I�,L�c�1�H��I�O�4�J�<�H�|$I�L��H�E�1���I�.�r���H�m��������=���M9o�}������b���M�_N��I��M�H�+I�I�*H�L��M���x����2������H�=.) H�5�H�?����H�D$�	���L�5�( H�5�I�>���H�D$����#�����AWAVAUATUSH��(L�wI9��H���M��I��H��H�GI�L9���H��H�	H�ZH��H�4�H�<0L�'L9��L�,�I�$1�L��H�L$I�EL��L�D$��I�,$L�D$H�L$tPI�mtw������H�I�GM;w��H�4�H��L�0H�
M�+I�L�*I9���H���V����D$I�D$L��H�L$L�D$�P0I�mL�D$�D$H�L$u&H�L$I�ML��D$L�D$�Q0H�L$�D$L�D$�����H�I�GM9w��H�4�H�<0L�'ff.��L��M�L�M�!L9��W���M�oI9������H�H9���L�&L�C�1�L��I�N�4�L�D$L�t$N�4�I�$I�L����I�.H�|$��I�,$�������xdM;ouc��t3I�GL�L$H��I�L�#M�M�!L�H��H9�|�ff.�@1�H��([]A\A]A^A_�L��& H�5�I�;�9����L�=�& H�5�I�?����D$I�FH�|$L���P0I�,$H�|$�D$�T��������UH����SH�5�H��8dH�%(H�D$(1�L�L$L�D$ �C������H�D$ H�P��������H�xH�l$��H�H1�H��H�H�H���]�H�+tk���z�����u$H�l$H�EH�L$(dH3%(H��usH��8[]�H�|$ H�tCL�GL�L$1�I�(I�M�H�|$ �|�����t�����H�E�H�s�D$H��V0�D$�L�9% H�5�1�I�;����z�����fD��AWH����AVH�5�AUATUSH��HdH�%(H�D$81�L�L$0L�D$(�����H�D$(H�P�����H�x�^H�HH�t$0H�H�H�1L�|$(H�\$I�oH�����H��H�H�|$��M�_E1�O�$I�XI��H��I�L�)L9��<O�4�I�E1�L��I�L�����I�m��I�.����xY��M�_H�I;o�'H��O�4�I�4M�H�>L�I�>H9\$��I���f���L�=�# H�5�I�?�`�H�t$L�.L�l$I��L�.��L�NH��A�Q0H�D$f�H�t$8dH34%(H�D$�H��H[]A\A]A^A_�M�M�D$L��A�Q0I�.�D$uM�V�D$L��A�R0�D$���t�����M�_H�I;o�BH��I�L�)�O�$�I�$H�M�,$H9\$����M�oL9��&M�$L�K�1�L��I�K�,�I�$N�4�L�L$H�EH���F�H�mH�L$��I�,$��������M9o���������M�_I��M�L�#I�M�&H�H��H���y���������L�5E" H�5�
I�>���H�D$���H�-" H�5�
H�}��H�D$�{���L�U�D$H��H�L$A�R0I�,$H�L$�D$�H������H�=�! H�5�
H�?�h��������ff.���AWAVAUATUSH��(H�F����vH�^H��H����H�V1�H�s�H��L�d�H��I�$�������H���+L�UI�:M�"L�eH�|$M�����L��H�H�L$��E1�O�D-I�XI��L��K�L�0M9��'O�<�I�1�L��I�L���n�I�.��I�/����xU��L�UH�L;eu/L��O�<�K�<M�H�L�I�H9\$��I���k���H�=�  H�5�H�?��L�D$M�0L�t$I��M�0���I�pL��V0H�D$H�D$H��([]A\A]A^A_�I�v�D$L���V0I�/�D$uM�O�D$L��A�Q0�D$��x���L�UH�L;e�f���L��K�L�0ff.�O�,�I�UH�M�uH9\$�'���L�uL9��%O�,H�s�1�L��H�M�$�I�EL�<�H�t$I�$L����I�,$L�\$��I�m��������L9uu������L�UI��M�L�+I�M�/H�L��M��u�����L�d$����L�
� H�5�
I�9��H�D$���L�%� H�5]
I�<$�|�H�D$���H�-� H�5�
H�}�W��A���M�L$�D$L��L�\$A�Q0I�mL�\$�D$�.�������'�ff.�@AWAVAUATUSH��HH�GH�t$����1H�wI��H��H�H�\$0H���	�0H�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�\$�Ӆ��zI��L��L��H�D$�Ѕ��aI��L��L��H�l$�Յ��HI��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�� H�H��H[]A\A]A^A_�L��H�l$�Յ�uOI������D$<I�FL���P0I�,$�D$<����x%L�D$M;G�=H�. H�5?H�:��1��L�%� H�5�I�<$��1��r���H�{1�H���H��u�H��H��L�G�L�O�L�D$(L�L$L9��H��H�t$ H�\$L���L9T$��M�_L9����L��I�GH�H9���H�4$H��M��H�\$I��L��O�4?I�nI��L��J�<L�'L9���N�4�I�$1�L��I�L�����I�,$tPI�.�:���������H�I�EI;]����L��J��N�L�I�3M�H�2H9,$~jI���k����D$<I�D$L��P0I�.�D$<�����������H�I�EI;]�q���L��J�<L�'�N�<�M�L�M�'H9,$�M��M�mH�\$I9��c�I�H9���L�l$M� H�$H��H�k�1�L��H�L�4�I�$L�,�I�L����I�.�����I�,$��������H�|$I;������t"I�GH��I�L�#M�MM�eL�H��H9,$|�H�$���eH�l$L�\$L;\$ ���H�t$0H��H�t$H9t$(����fDH�\$H���H9T$��M�gL9��g�M��I�GI�L9���I��K�6L�iH��J�4�L�0I�+I9��RL�T$L��1�H��H�EI�L��L�$��H�mH�<$L�T$��H�/����������I�I�GM;g�����J�4�J��H�0H�:L�H�9L�M9���M���R���H��L��H�l$�Յ��t������wH�l$H�\$H9\$(�������ff.��H����L�E�D$ H�|$H��L�$A�P0H�|$L�$�D$ H�/u�D$H�GL�$�P0�D$L�$�������I�I�GM;g����J�4�L�0I�+ff.�N�4�M�M�I�.M9�����M�gM9����H�L9��!���L�6M�U�1�L��I�J�,�I�J�4�H�t$H�EH��L�$��H�mL�$��I�.�>����<���M;g�����������I�GH�L$N�,�H�M�uL�L�1M�EM��L9��q������f.�H��}���H��L��L�d$A�ԅ��$���1��`���I�N�D$<L���Q0�D$<�����D$ H�EH��L�$�P0I�.L�$�D$ �M�����f.��H�=�3 H��3 H9�tH�f H��t	�����H�=�3 H�5z3 H)�H��H��H��?H�H�tH�- H��t��fD�����==3 u+UH�=
 H��tH�=^ �Y��d����3 ]������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�=\ H�5�E1�H�?�����H�m�=�H�uH��E1�V0��fD��H��H�5B����ff.�f���H��H�5����ff.�f���S��H�=�1 �Z�H��H��t5L�� 1�H��1�L���L��H��H�q��_�H�5qH��H����H��[���H��H���index out of rangeheap argument must be a listheappushheapreplaceheappushpop__about__heappopheapify_heappop_max_heapreplace_max_heapify_max_heapqlist changed size during iteration;�0��������������x��dt����$
������� ��@����p�x����8P�������������������$zRx�$H���FJw�?:*3$"D����H\���F�B�B �B(�A0�A8�D`�
8A0A(B BBBA zRx�`������(���,�4����F�A�A �i
ABAzRx� ���$���AHD���F�O�I �B(�A0�A8�Dp	
8A0A(B BBBA zRx�p������(T��:L����F�O�I �B(�A0�A8�D�g
8A0A(B BBBI$zRx��������,��
HT���F�B�B �B(�A0�A8�D`$
8A0A(B BBBA����Y(���*E�N�KP�
AAAzRx�P�� ���=L��bF�O�I �B(�A0�A8�D��
8A0A(B BBBAL���YHt��1F�B�B �B(�A0�A8�D`c
8A0A(B BBBA~��yL����B�B�B �B(�A0�A8�D��
8A0A(B BBBA���U8����L����`����XE�RGNU�*�)@= Uf{�@
X+0= 8= ���o`��
�X? �P
��	���o���o����o�o`���oH= p��������Maxheap variant of heapify.Maxheap variant of heapreplaceMaxheap variant of heappop.Transform list into a heap, in-place, in O(len(heap)) time.heapreplace(heap, item) -> value. 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)
Pop the smallest item off the heap, maintaining the heap invariant.heappushpop(heap, item) -> value. 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(heap, item) -> None. 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! :-)
�+��C �+��B �+@`B �+��@ �+�*`@ �+*@@ �+p @ �+�*@ �+D ���������[ GA$3a1@e+_heapq.cpython-36m-x86_64-linux-gnu.so-3.6.8-71.el8_10.alma.1.x86_64.debug�;�z�7zXZ�ִF!t/���]?�E�h=��ڊ�2N���a �����t|��&4����$\�����Y93�꫺	��AD��L-�0��b�m�.��Vh
�L�$
���L�M����X��l���L��k�+�ؕe�CC��u����n,k�b�Pq�El�"hKU�j�P��N�Ъs~H3��ҽ�d���n:�76���,��#5Ѓ"���m���N�;�ל�?�Z\�~ytC;��\��0�POZ�$-}�������._�7�{6��9y^,g�UK��X�U������cnX���Z�	{��_���B���*�9��]2P|�f����L��$
7~lhxX<�?E/��#����/���^ڛ�t��dw��=�[أF=���3
���Sk��
0�J��K�?��Ȱ4V�(��ftx�ܿ�9\:M��9AsZ�Fx������*b���D��R���ѫv=�f���j(k߳�Rd/:���P��m���M��M�n韘sv?n1��Z�*�fY"O��L�p�z\r��F�y�� ���(! �w���ͽ7��2AZ8!���oe�yf�T���Wb�I\%���%�3�0ګ�)~=;Ω:쨫[	��h�x��,��;z,�i��L=��cO�]'b�͸�$㶥T�KsJU�-oy��$p�Z�O�"���4U"bJ�����P���+ߤ�}�4.��0|P���/�
JxH����?�
�o�ywvP�th.7�e�^��},WaN�T�F��q�H��%&�F��W��cmFeQN�$Y�XϜ:�>��|�����
����]��Ź4�K��ݞynD��:�	'vL،`ݨ��;=4b<�=�
�Bc�P�B%9�a�/o�:��bo���	��>(&��7�Q����k�j��P6���&������g�y�y��"�-1)��o�&x���a����?\7CZ,��cAd4�nB���	[�8���Wd���p��"�YD���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���o��0T���^BP
P
�h@@c``�n�w���}X+X+
�2h+h+��0,0,���,�,|�x1x1 �0= 0=�8= 8=�@= @=�H= H=�X? X?��@ @ �] ]�]`]$
,]P|]$�a(

SILENT KILLER Tool