mirror of
https://github.com/restic/restic.git
synced 2026-02-03 12:29:37 -05:00
The TreeNodeIterator decodes nodes while iterating over a tree blob. This should reduce peak memory usage as now only the serialized tree blob and a single node have to alive at the same time. Using the iterator has implications for the error handling however. Now it is necessary that all loops that iterate through a tree check for errors before using the node returned by the iterator. The other change is that it is no longer possible to iterate over a tree multiple times. Instead it must be loaded a second time. This only affects the tree rewriting code. |
||
|---|---|---|
| .. | ||
| dir.go | ||
| file.go | ||
| fuse_test.go | ||
| inode.go | ||
| link.go | ||
| other.go | ||
| root.go | ||
| snapshots_dir.go | ||
| snapshots_dirstruct.go | ||
| snapshots_dirstruct_test.go | ||
| tree_cache.go | ||
| xattr.go | ||