We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0f5d8ed commit fe5ee43Copy full SHA for fe5ee43
diskcache/persistent.py
@@ -533,12 +533,13 @@ def reverse(self):
533
# GrantJ 2019-03-22 Consider using an algorithm that swaps the values
534
# at two keys. Like self._cache.swap(key1, key2, retry=True) The swap
535
# method would exchange the values at two given keys. Then, using a
536
- # forward iterator and a reverse iterator, the reversis method could
+ # forward iterator and a reverse iterator, the reverse method could
537
# avoid making copies of the values.
538
temp = Deque(iterable=reversed(self))
539
self.clear()
540
self.extend(temp)
541
directory = temp.directory
542
+ temp.close()
543
del temp
544
rmtree(directory)
545
0 commit comments