Home | Trees | Indices | Help |
|
---|
|
object --+ | dict --+ | Cache
A dictionary like cache. inv: len(self._usage) <= self.size len(self.data) <= self.size
Instance Methods | |||
new empty dictionary |
|
||
(k, v), remove and return some (key, value) pair as a |
|
||
D.get(k,d), also set D[k]=d if k not in D |
|
||
None |
|
||
Inherited from Inherited from |
Properties | |
Inherited from |
Method Details |
Warning : Cache.__init__() != dict.__init__(). Constructor does not take any arguments beside size.
|
2-tuple; but raise KeyError if D is empty
|
|
Update D from E and F: for k in E: D[k] = E[k] (if E has keys else: for (k, v) in E: D[k] = v) then: for k in F: D[k] = F[k]
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Fri Jun 11 21:52:20 2010 | http://epydoc.sourceforge.net |