/opt/alt/python34/lib64/python3.4/lib-dynload
NameSizeModeActions
array.cpython-34m.so499680755editdlrm
audioop.cpython-34m.so325280755editdlrm
binascii.cpython-34m.so259680755editdlrm
cmath.cpython-34m.so448800755editdlrm
fcntl.cpython-34m.so148640755editdlrm
grp.cpython-34m.so120640755editdlrm
math.cpython-34m.so380000755editdlrm
mmap.cpython-34m.so259520755editdlrm
nis.cpython-34m.so125920755editdlrm
ossaudiodev.cpython-34m.so300720755editdlrm
parser.cpython-34m.so465440755editdlrm
pyexpat.cpython-34m.so2171680755editdlrm
readline.cpython-34m.so280160755editdlrm
resource.cpython-34m.so118080755editdlrm
select.cpython-34m.so248320755editdlrm
spwd.cpython-34m.so125920755editdlrm
syslog.cpython-34m.so92320755editdlrm
termios.cpython-34m.so255200755editdlrm
time.cpython-34m.so294560755editdlrm
unicodedata.cpython-34m.so7667600755editdlrm
xxlimited.cpython-34m.so88800755editdlrm
zlib.cpython-34m.so334240755editdlrm
_bisect.cpython-34m.so131680755editdlrm
_bz2.cpython-34m.so177680755editdlrm
_codecs_cn.cpython-34m.so1469600755editdlrm
_codecs_hk.cpython-34m.so1554080755editdlrm
_codecs_iso2022.cpython-34m.so220400755editdlrm
_codecs_jp.cpython-34m.so2633120755editdlrm
_codecs_kr.cpython-34m.so1343200755editdlrm
_codecs_tw.cpython-34m.so1096800755editdlrm
_crypt.cpython-34m.so53600755editdlrm
_csv.cpython-34m.so326080755editdlrm
_ctypes.cpython-34m.so1246400755editdlrm
_curses.cpython-34m.so850400755editdlrm
_curses_panel.cpython-34m.so136880755editdlrm
_datetime.cpython-34m.so750400755editdlrm
_dbm.cpython-34m.so131360755editdlrm
_decimal.cpython-34m.so2964720755editdlrm
_elementtree.cpython-34m.so539840755editdlrm
_gdbm.cpython-34m.so198560755editdlrm
_hashlib.cpython-34m.so215200755editdlrm
_heapq.cpython-34m.so185120755editdlrm
_json.cpython-34m.so384560755editdlrm
_lsprof.cpython-34m.so178320755editdlrm
_lzma.cpython-34m.so292800755editdlrm
_md5.cpython-34m.so129760755editdlrm
_multibytecodec.cpython-34m.so320560755editdlrm
_multiprocessing.cpython-34m.so164480755editdlrm
_opcode.cpython-34m.so59360755editdlrm
_pickle.cpython-34m.so935360755editdlrm
_posixsubprocess.cpython-34m.so163440755editdlrm
_random.cpython-34m.so118560755editdlrm
_sha1.cpython-34m.so122080755editdlrm
_sha256.cpython-34m.so210400755editdlrm
_sha512.cpython-34m.so251360755editdlrm
_socket.cpython-34m.so836960755editdlrm
_sqlite3.cpython-34m.so818240755editdlrm
_ssl.cpython-34m.so952480755editdlrm
_struct.cpython-34m.so399040755editdlrm
Edit: /opt/alt/python34/lib64/python3.4/lib-dynload/_heapq.cpython-34m.so (18512B)
ELF> @A@8@T T X X X ( 8  $$Ptd@@@ddQtdGNUe8koXtB~ H |CEqXl sc + Du""5MT^@ @ @   x? ~__gmon_start___init_fini__cxa_finalize_Jv_RegisterClassesPyInit__heapqPyModule_Create2PyUnicode_DecodeUTF8PyModule_AddObjectPyObject_RichCompareBoolPyExc_IndexErrorPyErr_SetStringPyArg_ParseTuplePyObject_GetIterPyList_NewPyIter_NextPyList_AppendPyErr_OccurredPyList_SortPyExc_RuntimeError_Py_NoneStructPyExc_TypeErrorPyList_ReversePyArg_UnpackTuplePyList_SetSlicelibpython3.4m.so.1.0libpthread.so.0libc.so.6_edata__bss_start_end/opt/alt/python34/lib64:/opt/alt/sqlite/usr/lib64:/opt/alt/openssl11/lib64GLIBC_2.2.5ui   (? 0? 5 @? ? ? ? ? : ? ? `? ; ? ?  ? ; ? ? p? @< @  @ P@ > @ (@ 8@ @> @@ H@ X@ > 8" @" H" P"  X"  `" h" " " " " "  "  "  "  " " " " " " " # HeH5 % @% h% h% h%z h%r h%j h%b h%Z hp%R h`%J h P%B h @%: h 0%2 h %* h %" h% hHH= HtHÐU=h3 HATSubH=( t H=O H3 L%$ H=3 L)HHH9s DHH3 AH3 H9r2 [A\fH= UHtH HtH= @ÐSH=81 HHt_H ? H΋H!%tH= DHVHDH1H)H5ZHHH[fAWAVIAUATUSH8LHt$I9JHGHT$Hl$Ld$HIHHHT$ LH?LHH9HT$|If.L$N, H None. Push item onto 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().Pop the smallest item off the heap, maintaining the heap invariant.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) Transform list into a heap, in-place, in O(len(heap)) time.Find the n largest elements in a dataset. Equivalent to: sorted(iterable, reverse=True)[:n] Find the n smallest elements in a dataset. Equivalent to: sorted(iterable)[:n] 5 ? : `;  ; p@< P> @> > _heapq.cpython-34m.so.debug12.shstrtab.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.text.fini.rodata.eh_frame_hdr.eh_frame.ctors.dtors.jcr.data.rel.ro.dynamic.got.got.plt.data.bss.gnu_debuglink $o<( 0#8o<Eo(( THH^H H  h c n txxz2@@dX X h h x x   8" 8"8p" p" # #` @ @@ @