/usr/lib64/python2.6/site-packages/mx/BeeBase
Edit: /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyo (49018B)
Ñò
½ÿGc @ s‚ d Z d d k Z d d k Z d d k Z d d k Z d d k l Z e i Z d d k Te i Z e i
Z
d Z d e i f d „ ƒ YZ
d e
f d „ ƒ YZ d
e f d „ ƒ YZ d e
f d
„ ƒ YZ d Z d Z d Z d Z d f d „ ƒ YZ y e Wn, e j
o d e i f d „ ƒ YZ n Xd f d „ ƒ YZ d f d „ ƒ YZ d f d „ ƒ YZ d e f d „ ƒ YZ d e f d „ ƒ YZ e e ƒ d e f d! „ ƒ YZ e e ƒ d" e f d# „ ƒ YZ e e ƒ d$ e f d% „ ƒ YZ e e ƒ d& „ Z e! d' j okd d k" Z" d( GHe d) ƒ Z# d* e# d+
.dat and .idx.
keysize gives the maximal size of the key strings used as
index keys. This is only useful for string based keys.
min_recordsize is passed to the BeeStorage as indicator of
the minimum size for data records.
readonly can be set to true to open the files in read-only
mode, preventing any disk modifications.
To open the dictionary in recovery mode, pass a keyword
recover=1. Then run .recover() and reopen using the normal
settings.
If autocommit is true the cache control will do an
automatic .commit() whenever the transaction log
overflows.
If validate is true, the dictionary will run a validation
check after having successfully opened storage and index.
RecreateIndexError or RecoverError exceptions could be
raised in case inconsistencies are found.
index gives the constructor to use for the .index. The
constructors BeeIntegerIndex and BeeStringIndex from the
BeeIndex module are supported.
maxcachesize defines the maximum size of the in-memory
transaction cache. It defaults to MAXCACHESIZE if not
given.
s .datt lockt cachei t min_recordsizet readonlyt recoveri i i i i iI i iž i s keysize %i is too larges .idxt dupkeyst filemodet
sectorsizes unknown index type: %ss% Index for %s "%s" could not be openedN( t nameR t Nonet maxcachesizet
BeeStoraget BeeKeyValueStoraget storaget is_newt BeeIndext BeeStringIndext BeeFixedLengthStringIndexR t indext BeeIntegerIndext
BeeFloatIndext reprt IOErrort closeR R R t
autocommitt validate_indext validate_storage(
t selfR t keysizeR
R R R# t validateR R R R t why( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt __init__] sj )
c C sG | d j o d S| d j o d S| d j o d St d | ‚ d S( s> Calculate the sectorsize given the keysize.
i i iI i iž i s keysize %i is too largeN( R ( R& R' ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt _calc_sectorsizeÖ s
c C s6 | i ƒ t i | i d ƒ t i | i d ƒ d S( sÅ Deletes the storage and index files used for the instance.
Closes the on-disk dictionary before proceeding with the
removal.
USE WITH CARE !
s .dats .idxN( R" t ost removeR ( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt remove_filesä s
c C s1 | i o | i ƒ o
t d ‚ n t | i ƒ S( sV This only gives correct results if no modifications
are pending.
s/ uncommitted data exists; can't calculate length( R t changedR t lenR ( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt __len__ò s
c C s] | i pO | i ƒ x5 | i | i f D]! } | d j o | i ƒ q' q' Wd | _ n d S( s¸ Flush buffers and close.
This issues a .rollback(), so the current transaction is
rolled back. It also frees the lock on the used index.
i N( t closedt rollbackR R R R" ( R& t obj( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyR" ü s
c C s6 | i p( y | i ƒ Wq2 | j
o q2 Xn d S( sF Make sure the object is closed and locks are freed.
N( R2 R" ( R& t AttributeError( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt __del__ s
c C sU | i o d S| i d j o | i i ƒ n | i d j o | i i ƒ n d S( s Flush buffers to disk.
N( R2 R R t flushR ( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyR7 s
c C s d | i i | i t | ƒ f S( Ns <%s instance for "%s" at 0x%x>( t __class__R R t id( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt __repr__' s c C s/ | i d j o | i i ƒ n | i ƒ d S( sž Commit all changes and start a new transaction.
This method does not implement any write operation, but
takes care of managing the cache and flushing the storage
and index buffers.
You must override this method to have commit have any
writing effect. The base method must be called after the
cache has been processed.
N( R R t clearR7 ( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt commit- s c C s/ | i d j o | i i ƒ n | i ƒ d S( sï Take back all changes and start a new transaction.
Overriding is normally not needed. This method only takes
care of managing the cache and flushing the storage and
index buffers.
N( R R R; R7 ( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyR3 A s
c C sJ | i o< x9 | i i ƒ D]$ \ } \ } } | | j o d Sq Wn d S( st Return true in case the current transaction includes changes
to the database, false otherwise.
i i ( R t items( R& t modifiedt keyt statet value( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyR/ Q s
c C sÉ | i } x8 | i ƒ D]* \ } \ } } | | j o | | =q q W| | ƒ } | | i j oe | i o | i ƒ d St t d | ƒ | d | i j o$ t t d ƒ | i ƒ t d ‚ qÅ n d S( sš Remove all unmodified entries from the cache.
If self.autocommit and the cache cleanup did not reduce
the size below the .maxcachesize limit, a .commit() will be
executed automatically.
Otherwise the processing continues. If the cache size hits
2 * .maxcachesize, a forced .rollback() is done and an
error raised.
Ns* Cache overflow: %i modified items in cachei s$ Cache overflow: forced a .rollback()s, cache overflow; last transaction rolled back( R R= R R# R< t logt SYSTEM_ERRORR3 R ( R& R0 t
unmodifiedR R? R@ RA t size( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt
free_cache^ s"
c C s
t d ‚ d S( s Read and return the value corresponding to key.
If checkonly is true, only the availability of a value
has to be checked.
Override this method with an implementation that accesses
the disk.
s
key not foundN( t KeyError( R& R? t checkonly( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt read s c C s | | f | i | | | | d | d | d | d | d | d t i d | ƒd S( s Create an instance using name as basename for the
data and index files.
Two files will be created: .dat and .idx.
min_recordsize is passed to the BeeStorage as indicator of
the minimum size for data records. readonly can be set to
true to open the files in read-only mode, preventing any
disk modifications.
To open the dictionary in recovery mode, pass a keyword
recover=1. Then run .recover() and reopen using the normal
settings.
If autocommit is true the cache control will do an
automatic .commit() whenever the transaction log
overflows.
If validate is true, the dictionary will run a validation
check after having successfully opened storage and index.
RecreateIndexError or RecoverError exceptions could be
raised in case inconsistencies are found.
maxcachesize defines the maximum size of the in-memory
transaction cache. It defaults to MAXCACHESIZE if not
given.
R
R R R# R( R R N( R R ( R& R R
R R R# R( R t
basemethod( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyR* ‹ s
! c C sR xK | i ƒ o= | i | j o d S| | i i | i ƒ j o | i Sq Wd S( s¬ Find the address of a key by scanning the hash value
set pointed to by the cursor.
Returns the address of the found key or None.
N( Rx R? R R Rl RA ( R& RT t hashvalueR? ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt find_address² s
c C s² | t j p
| t j o | i i | | ƒ St | ƒ } | i i | d ƒ } | d j o | S| i } | | i i | ƒ j o+ | i | | | ƒ } | d j o | Sn | S( sç Return an index cursor pointing to key.
If key is not given, it defaults to FirstKey. In case the
key is not found, default is returned.
XXX Should use this method in more places...
N(
Ri Ru R RT t hashR RA R Rl R‡ ( R& R? RR R† RT t address( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyt index_cursorÄ s
c C s8 | i } | i } | i } | i } | i } | i } | i }
| i } | i } d }
xÆ| i i
ƒ D]µ\ } \ } } | | j oó | o
t d ‚ n t | ƒ } | | |
ƒ } | |
j oš | i
} | | | ƒ j o) | i d | _ | i | | | ƒ } n |
| | | ƒ } | | j o qg n | |
j o | | | | ƒ qu| | | .dat and .idx.
keysize gives the maximal size of the strings used as
index keys.
min_recordsize gives a hint to the expected typical size
of (key,value) pickles: all records will have at least
this size.
To open the dictionary in recovery mode, pass a keyword
recover=1. Then run .recover() and reopen using the normal
settings.
If autocommit is true the cache control will do an
automatic .commit() whenever the transaction log
overflows.
If validate is true, the dictionary will run a validation
check after having successfully opened storage and index.
RecreateIndexError or RecoverError exceptions could be
raised in case inconsistencies are found.
maxcachesize defines the maximum size of the in-memory
transaction cache. It defaults to MAXCACHESIZE if not
given.
XXX Save keysize in storage file header.
R' R
R R R# R( R R N( R R (
R& R R' R
R R R# R( R R… ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyR* ñ s
$ c C sS | i } | i } | i } | i } | i } | i } d }
xü | i i ƒ D]ë \ } \ } }
| | j om | | |
ƒ } | |
j o4 | | |
| ƒ } | | j o qL n | | | .dat and .idx.
keysize gives the maximal size of the strings used as
index keys.
min_recordsize gives a hint to the expected typical size
of (key,value) pickles: all records will have at least
this size.
To open the dictionary in recovery mode, pass a keyword
recover=1. Then run .recover() and reopen using the normal
settings.
If autocommit is true the cache control will do an
automatic .commit() whenever the transaction log
overflows.
If validate is true, the dictionary will run a validation
check after having successfully opened storage and index.
RecreateIndexError or RecoverError exceptions could be
raised in case inconsistencies are found.
maxcachesize defines the maximum size of the in-memory
transaction cache. It defaults to MAXCACHESIZE if not
given.
XXX Save keysize in storage file header.
R' R
R R R# R( R R N( R R (
R& R R' R
R R R# R( R R… ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyR* Î s
$ N( R R R R R R* ( ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyRŸ Ä s Rž c B s e Z d Z d „ Z d „ Z RS( sF Cursor for BeeStringDict and BeeFixedLengthStringDict instances.
c C s | i S( s^ Reads the key object from the dict to which the cursor
currently points.
( R? ( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyRl s c C s | i | i | i f S( sl Reads the (key, value) item object from the dict to which
the cursor currently points.
( R? R} ( R& ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyRy s ( R R R Rl Ry ( ( ( s8 /usr/lib64/python2.6/site-packages/mx/BeeBase/BeeDict.pyRž ü s c O sÞ y t | | | ƒ } | SWn: t i j
o n& t j
o n t j
o n Xt t d | d ƒ | i ƒ } d | d s”
ÿ ÿ Ž ˆÿ >+
Ù
4
%