Home | Trees | Indices | Help |
---|
|
Codec --+ | MEGICodec
FORMAT: C_Alpha code = len(Ns) 1-bit flag = counts? (T/F)=(1/0) C_Alpha code = sum(counts) (optional) for each integer: d-leading zeros = each zero means one add one to the bit width ?-bits for integer = width of integer equal to sum of leading zeros seen so far + 1 C_Alpha code = counts(optiona)
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
>>> S=RandomDict(200,N=600) >>> Ss=[RandomDict(200,N=600) for x in xrange(100)]if counts=False, then only the keys are stored, and returned as a set. >>> G=MEGICodec() >>> set(S.keys())==G.decode(G(S)) 1Otherwise, a dictionary is returned. >>> G=MEGICodec(counts=True) >>> G.decode(G(S))==S 1
|
|
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0beta1 on Thu Nov 8 17:49:33 2007 | http://epydoc.sourceforge.net |