ELF > @ P: @ 8 @ % % % % % % % % $ $ Ptd X" X" X" Qtd GNU EY7
+ H + - / |CEqX 3s ` T m + B 2 # M y h " f H _ w : j H / `9 H9 H9 ` ? __gmon_start__ _init _fini __cxa_finalize _Jv_RegisterClasses initgdbm PyType_Type Py_InitModule4_64 PyModule_GetDict PyErr_NewException PyDict_SetItemString PyString_FromString PyArg_Parse __errno_location gdbm_store PyErr_SetFromErrno gdbm_errno gdbm_strerror PyErr_SetString gdbm_delete PyExc_KeyError PyExc_TypeError gdbm_fetch PyString_FromStringAndSize free gdbm_exists PyErr_Format gdbm_firstkey _Py_NoneStruct gdbm_nextkey PyArg_ParseTuple PyOS_snprintf _PyObject_New gdbm_open __stack_chk_fail Py_FindMethod gdbm_sync gdbm_reorganize PyInt_FromLong PyList_New PyList_Append _PyErr_BadInternalCall gdbm_close PyObject_Free libgdbm.so.2 libpthread.so.0 libc.so.6 _edata __bss_start _end GLIBC_2.2.5 GLIBC_2.4 ui ii
ui % % 6 T! 06 @6 h6 8 p6 09 6 * 7 ! 7 7 @, 7 ^! 7 P 7 1 8 d! 8 8 @1 8 5! (8 @ 88 1 @8 i! H8 @ X8 1 `8 ! h8 x8 2 8 r! 8 p 8 4 8 }! 8 0 8 5 8 9 09 89 @9 P ' ' ' ' ' ' ' ' ! ' ' ' ' ' ( (
(
( ( (( 0( 8( @( H( P( X( `( h( p( x( ( ( ( ( ( " ( # ( $ ( % ( & ( ' ( ( ( ) ( * HG - H5J %L @ %J h %B h %: h %2 h %* h %" h % h % h p%
h `% h P% h
@% h 0% h % h
% h % h % h % h % h % h % h % h % h % h p% h `% h P%z h @%r h 0%j h %b h %Z h %R h %J h %B h! HH HtHÐU=p% HATSubH= t H= H L% HE% L)HHH9s D HH%% AH% H9r% [A\f H=x UHtH# HtH=_ @ ÐUHx H5# H= 1A SHH HW! HtiHH= 11HBHHx$ tBH5 HHH= H5 HHHHHHHt H[] D HCHH@0H[]ffff. ATIH5 1UHLSHH HT$HJ- H} B HE HL$H5T 1HH 4 H}A H $DD$HHt$T$x1H []A\ tH=K# H []A\Hy 8*H=## H;H []A\ D H}Ht$T$FyH+ It$$H8rf D H H5B H8L H H5
H8$H=" H5
H\$Hl$HLd$HHH5 HT$1HHE1HJtNH}Ht]T$Ht$HH$T$HD$ HD$HHD$(tHHct$(HHILH\$0Hl$8Ld$@HHÐH=! H5
H Hs$E1H8HHHtYHF t&HF$H$HVHƉT$Hf. HPH H5 H81 HH=+! H5| ? D SH0HHtjeHHD$T$HD$ HD$HHD$(t-Hct$(HHHD$HD$H0[ H H H0[ H= H5 1ÐLd$H\$IHl$Ll$HhHH AT$Hcx H\$HHl$PLd$XLl$`Hh T$HT$HHD$HD$0HA HT$8u p AHŋ\$8I|$HHl$ ډ\$(T$HT$HHD$HD$0HT$8t tHHD$HD$ IcEl$G1E0H= H5 H!ffff. U11SHHH5 H8HT$ HJ3tNH{HtnT$(Ht$ XHH$T$HD$HD$HHD$t)Hct$HHHH8H[] H-9
HE H8H[]fH= H5 ff. H: H\$Hl$Ld$Ll$HLt$HxH5. dH%( HD$H1HT$HL$HT$LD$ D$ 17 HD$nt c A A HPHT$H Hs` uG f H\$ H ɾ( 1HpH= H1HT$HdH3%( H H\$PHl$XLd$`Ll$hLt$pHxfrt+wA RH=] H5& 1o D E1. AHD$H'H= Dt$ Hl$HHtW@E11 DDHIjHHC A<$ tDH= HHHHtH1 @ A@c A S2H
8tH=m HHCH1P0f. HHH= fffff. HHHtFHo
H Hf D H= H5J
1ސHl$H\$HH H g H}Hx!H
H H\$Hl$H t"H= 1H\$Hl$H D H 8ZH=S Hk1H\$Hl$HfH=1 H5 E1xf D SHHH5 1HHL$H1t H{Ht H4$T$YHc1H[ H= H5 1f AUATUHSHHH: H3 H9G) H F 1HI H}T$HT$HHD$HD$0HT$8 HZ @ H}T$8HH\$0CHD$T$HHD$ HD$HD$(H\$ HD$(HH\$0HD$8tnHct$8HHIt=HLIU HHIU uIULD$R0D$c HI$HHI$tWE1HHL[]A\A]f D H=6 E1THHL[]A\A]f D H=) H5z E1:ID$LE1P0SHHHtvHO HC H [f SHHHtFH[UHSHH HtH HHHuH[ÐHH gdbm.error open_flags s# s#:nextkey s|si:open Flag '%c' is not supported. s#:has_key ./Modules/gdbmmodule.c gdbm.gdbm close keys firstkey reorganize sync gdbm mappings have string indices only GDBM object has already been closed gdbm mappings have string elements only gdbm key must be string, not %.100s First flag must be one of 'r', 'w', 'c' or 'n' ; ( 0 hX x x X 0 H h X (0 zR x 4 A^D
AAF OAA T T BMG G@
AABD V
FABA a
FABF $ ` MIP
B { D m
O e
A , h AD@Q
AI O
AH $ $ MNpq
D 4 L AEQPd
DAH P
DAC $ HV g
C ? D]
G , N B
H b
F m
C $ Hg AS w
AD L < BBA D(Dp3
(D ABBG X
(D ABBG ' Ae AU % x `
o
' 0 0
o o o ^ o $ % . > N ^ n ~ . > N ^ n ~ This module provides an interface to the GNU DBM (GDBM) library.
This module is quite similar to the dbm module, but uses GDBM instead to
provide some additional functionality. Please note that the file formats
created by GDBM and dbm are incompatible.
GDBM objects behave like mappings (dictionaries), except that keys and
values are always strings. Printing a GDBM object doesn't print the
keys and values, and the items() and values() methods are not
supported. rwcnfsu This object represents a GDBM database.
GDBM objects behave like mappings (dictionaries), except that keys and
values are always strings. Printing a GDBM object doesn't print the
keys and values, and the items() and values() methods are not
supported.
GDBM objects also support additional operations such as firstkey,
nextkey, reorganize, and sync. open(filename, [flags, [mode]]) -> dbm_object
Open a dbm database and return a dbm object. The filename argument is
the name of the database file.
The optional flags argument can be 'r' (to open an existing database
for reading only -- default), 'w' (to open an existing database for
reading and writing), 'c' (which creates the database if it doesn't
exist), or 'n' (which always creates a new empty database).
Some versions of gdbm support additional flags which must be
appended to one of the flags described above. The module constant
'open_flags' is a string of valid additional flags. The 'f' flag
opens the database in fast mode; altered data will not automatically
be written to the disk after every change. This results in faster
writes to the database, but may result in an inconsistent database
if the program crashes while the database is still open. Use the
sync() method to force any unwritten data to be written to the disk.
The 's' flag causes all database operations to be synchronized to
disk. The 'u' flag disables locking of the database file.
The optional mode argument is the Unix mode of the file, used only
when the database has to be created. It defaults to octal 0666. close() -> None
Closes the database. keys() -> list_of_keys
Get a list of all keys in the database. has_key(key) -> boolean
Find out whether or not the database contains a given key. firstkey() -> key
It's possible to loop over every key in the database using this method
and the nextkey() method. The traversal is ordered by GDBM's internal
hash values, and won't be sorted by the key values. This method
returns the starting key. nextkey(key) -> next_key
Returns the key that follows key in the traversal.
The following code prints every key in the database db, without having
to create a list in memory that contains them all:
k = db.firstkey()
while k != None:
print k
k = db.nextkey(k) reorganize() -> None
If you have carried out a lot of deletions and would like to shrink
the space used by the GDBM file, this routine will reorganize the
database. GDBM will not shorten the length of a database file except
by using this reorganization; otherwise, deleted file space will be
kept and reused as new (key,value) pairs are added. sync() -> None
When the database has been opened in fast mode, this method forces
any unwritten data to be written to the disk. T! 8 09 * ! @, ^! P 1 d! @1 5! @ 1 i! @ 1 ! 2 r! p 4 }! 0 5 P gdbmmodule.so.debug exc| .data .rodata .shstrtab .dynamic .note.gnu.build-id .eh_frame .gnu.hash .fini .gnu_debuglink .dynsym .gnu.version .rela.dyn .data.rel.ro .gnu.version_r .jcr .eh_frame_hdr .dynstr .ctors .dtors .bss .init .rela.plt .got.plt .got .text " $ ? o < ^ f o ^ ^ b o P s
0 0 0
` ` x x 0 (
I 2 p X" X" 5 " " % % % % % % } % % % % ' ' @ ' ' ( ) ) H H9 H9 O H9 `9