Comments on: LRU cache solution: a case for linked lists in Python http://www.algorithm.co.il/blogs/challenges/lru-cache-solution-a-case-for-linked-lists-in-python/ Algorithms, for the heck of it Tue, 21 Jun 2011 21:07:08 +0000 hourly 1 http://wordpress.org/?v=3.1.3 By: lorg http://www.algorithm.co.il/blogs/challenges/lru-cache-solution-a-case-for-linked-lists-in-python/#comment-72 lorg Mon, 25 May 2009 15:53:03 +0000 http://www.algorithm.co.il/blogs/index.php/programming/python/lru-cache-solution-a-case-for-linked-lists-in-python/#comment-72 I finally uploaded the fixed version. Thanks for the fix Aaron! I finally uploaded the fixed version. Thanks for the fix Aaron!

]]> By: Bob http://www.algorithm.co.il/blogs/challenges/lru-cache-solution-a-case-for-linked-lists-in-python/#comment-71 Bob Thu, 07 May 2009 17:33:16 +0000 http://www.algorithm.co.il/blogs/index.php/programming/python/lru-cache-solution-a-case-for-linked-lists-in-python/#comment-71 The Python list type is not an array in the sense that you are probably thinking of. It is a complex data type optimized for typical use cases. The Python list type is not an array in the sense that you are probably thinking of. It is a complex data type optimized for typical use cases.

]]> By: Aaron Digulla http://www.algorithm.co.il/blogs/challenges/lru-cache-solution-a-case-for-linked-lists-in-python/#comment-70 Aaron Digulla Sat, 18 Apr 2009 08:45:07 +0000 http://www.algorithm.co.il/blogs/index.php/programming/python/lru-cache-solution-a-case-for-linked-lists-in-python/#comment-70 I tried your LRU implementation but after a while, I get: File "/home/digulla/packages/scanner/lru.py", line 145, in get self.age_list.remove(link) File "/home/digulla/packages/scanner/lru.py", line 110, in remove old_prev.next = old_next ReferenceError: weakly-referenced object no longer exists I'm not 100% sure if this is a bug in your code or mine; I'm using the LRUMap in two threads but I've added locks in get() and put(). That didn't help. When I remove the weakrefs, it works. So I'm wondering: why are you using proxy() in the linked list implementation? I tried your LRU implementation but after a while, I get:

File “/home/digulla/packages/scanner/lru.py”, line 145, in get
self.age_list.remove(link)
File “/home/digulla/packages/scanner/lru.py”, line 110, in remove
old_prev.next = old_next
ReferenceError: weakly-referenced object no longer exists

I’m not 100% sure if this is a bug in your code or mine; I’m using the LRUMap in two threads but I’ve added locks in get() and put(). That didn’t help.

When I remove the weakrefs, it works. So I’m wondering: why are you using proxy() in the linked list implementation?

]]>