summaryrefslogtreecommitdiff
path: root/NEWS
diff options
context:
space:
mode:
authorLars Wirzenius <liw@liw.fi>2015-10-24 14:32:01 +0300
committerLars Wirzenius <liw@liw.fi>2015-10-24 16:25:17 +0300
commit28fbb8fab29b4488aa03ec95c18a80b97010f278 (patch)
tree6fa73c6a8ec91deb8b34666313d5b7ed857b14f0 /NEWS
parentfafe2b5078641c9f6a637bdaa7521d2ac0df130e (diff)
downloadobnam-28fbb8fab29b4488aa03ec95c18a80b97010f278.tar.gz
Reimplement scan_tree without recursion
Previously, scan_tree would, when encountering a very deep directory tree, crash due to Python's maximal stack depth limit. To avoid that, avoid recursion and use an explicit list of unprocessed items.
Diffstat (limited to 'NEWS')
-rw-r--r--NEWS4
1 files changed, 4 insertions, 0 deletions
diff --git a/NEWS b/NEWS
index e4886325..8bdf9a95 100644
--- a/NEWS
+++ b/NEWS
@@ -30,6 +30,10 @@ Version 1.18, released UNRELEASED
* Henri Sivonen improved the compression code to not compress if the
result would be larger.
+* Lars Wirzenius changed the `scan_tree` code to not be recursive, to
+ avoid problems with directory trees that are deeper than Python's
+ call stack limit allows.
+
Version 1.17, released 2015-09-12
---------------------------------