- Original Message -
From: Florian Lindner [EMAIL PROTECTED]
Hello,
I am building a object cache in python, The cache has a maximum size and
the
items have expiration dates.
At the moment I'm doing like that:
What possible you see to optimize this lookup? Or anything else you see
Hello,
I am building a object cache in python, The cache has a maximum size and the
items have expiration dates.
At the moment I'm doing like that:
cache = {} # create dictionary
cache[ID] = (object, timestamp) # Save a tuple with the object itself and a
timestamp (from datetime.datetime.now())
Florian Lindner [EMAIL PROTECTED] writes:
What possible you see to optimize this lookup? Or anything else you see to
make it better?
Use the heapq module.
--
http://mail.python.org/mailman/listinfo/python-list
i think ring buffer
http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/68429
--
http://mail.python.org/mailman/listinfo/python-list
Florian Lindner [EMAIL PROTECTED] writes:
What possible you see to optimize this lookup? Or anything else you see to
make it better?
Do you need to update the timestamp of cached entries when you access
them? If yes, use the heapq module. If no, is the cache something
different from a simple
a ring buffer?
http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/68429
--
http://mail.python.org/mailman/listinfo/python-list
