GitLab

fix: slightly reduce memory usage when walking large directory trees

fix: return ErrLinkNotFound when the _link_ isn't found

ipld.ErrNotFound should only be used when the underlying node isn't found

fix: include root in searches by default

1. Walk implies walking the entire graph.
2. Avoids a _silent_ breaking change.

rework the graph walking functions with functional options

This commit:
- reduce the API to 2 simpler functions
- add consistent and clear control over if the root should be visited
- add control over the concurrency factor

fix inconsistent EnumerateChildrenAsync behavior

This fixes the inconsistent EnumerateChildrenAsync behavior by renaming
everything.

1. EnumerateChildrenAsync has been renamed to WalkParallel because (a) it
visited the root so EnumerateChildren was incorrect and (b) it isn't async.
2. EnumerateChildren has been renamed to Walk and now _also_ visits the root for
consistency.

Anyone needing to skip the root can do so manually (`if c.Equals(root)` ...).

add function to marshal raw nodes to json

fixes https://github.com/ipfs/go-ipfs/issues/6076

add gomod support // tag v0.0.1.

License: MIT
Signed-off-by: Jakub Sztandera <kubuxu@protonmail.ch>

fix some performance regressions when reading protobuf nodes

gx publish 1.1.36

Increase FetchGraphConcurrency to 32

gx publish 1.1.30

Given all the bitswap session improvements, I think it's time to give our users
some candy. This should allow us to actually take advantage of the increased
wantlist sizes.