mirror of
https://github.com/restic/restic.git
synced 2026-02-03 04:20:45 -05:00
350f29d921
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. |
||
|---|---|---|
| .. | ||
| archiver | ||
| backend | ||
| bloblru | ||
| checker | ||
| crypto | ||
| data | ||
| debug | ||
| dump | ||
| errors | ||
| feature | ||
| filter | ||
| fs | ||
| fuse | ||
| global | ||
| migrations | ||
| options | ||
| repository | ||
| restic | ||
| restorer | ||
| selfupdate | ||
| terminal | ||
| test | ||
| textfile | ||
| ui | ||
| walker | ||