Bump github.com/ipld/go-ipld-prime from 0.12.4-0.20211019203807-9ddc75a0c4ae to 0.21.0

[dependabot]

Bumps github.com/ipld/go-ipld-prime from 0.12.4-0.20211019203807-9ddc75a0c4ae to 0.21.0.

Release notes

Sourced from github.com/ipld/go-ipld-prime's releases.

v0.21.0

go-ipld-prime's release policy says that:

even numbers should be easy upgrades; odd numbers may change things

This release is an odd number, and it does change some minor things.

🛠 Breaking

• Build: The minimum version of Go has been bumped from 1.18 to 1.19.
• Dependencies: The go-cid dependency was upgraded from v0.3.2 to v0.4.1. This is a relatively minor change but the introduction of ErrInvalidCid wrapping may be breaking for some users.
• Selectors: Remove hard error when a traversal encounters a slice matcher with a node that is not a string or bytes, by @​rvagg #529

🔦 Features

• Traversal: Preloader functionality, by @​hannahhoward and @​rvagg #452
  • See the traversal package documentation for more information on how a Preloader can be used to introduce parallelism into a traversal. The Lassie project is currently using this functionality to speed up Bitswap block fetching; future releases of go-ipld-prime may include additional functionality being prototyped in Lassie to manage parallelism and caching.
• Schemas: Support listpairs struct representation in DSL parsing, by @​rvagg #514
• Schemas: Support inline union representation in DSL parsing, by @​rvagg #527
• Bindnode: Support listpairs struct representation, by @​rvagg #514
• Selectors: Support negative values for slice matcher's From and To, by @​rvagg #530
  • The slice matcher is currently being used to support byte-range fetching for the IPFS Trustless Gateway specification. Work is ongoing and can be seen in both the Lassie and Frisbii projects.
  • Please note that this feature is currently considered experimental and shoule be used with care and with the expectation that it may change in the near future. Expect a release or two before this feature is considered stable.

🩹 Fixes

• Traversal: StartAtPath work properly for matching walks, by @​rvagg #500
• Traversal: WalkTransforming() work properly, by @​EdSchouten #516
• Basicnode: basic.NewInt() returns a pointer like other constructors, by @​hacdias #525
• Selectors: Cache offsets for sequential reads in slice matcher, by @​rvagg #529

🌟 Thanks!

Thanks to @​hacdias and @​EdSchouten for their first contributions to go-ipld-prime!

v0.20.0

go-ipld-prime's release policy says that:

even numbers should be easy upgrades; odd numbers may change things

As such, v0.20.0 is a relatively minor release with a grab-bag of small improvements and fixes.

2023 February 11

What's Changed

Schema errors can now errors.Is:

• [61c9ab10d4] - feat: support errors.Is for schema errors (Ian Davis) #476

... (truncated)

Changelog

Sourced from github.com/ipld/go-ipld-prime's changelog.

v0.21.0

2023 August 10

go-ipld-prime's release policy says that:

even numbers should be easy upgrades; odd numbers may change things

This release is an odd number, and it does change some minor things.

🛠 Breaking

• Build: The minimum version of Go has been bumped from 1.18 to 1.19.
• Dependencies: The go-cid dependency was upgraded from v0.3.2 to v0.4.1. This is a relatively minor change but the introduction of ErrInvalidCid wrapping may be breaking for some users.
• Selectors: Remove hard error when a traversal encounters a slice matcher with a node that is not a string or bytes, by @​rvagg #529

🔦 Features

• Traversal: Preloader functionality, by @​hannahhoward and @​rvagg #452
  • See the traversal package documentation for more information on how a Preloader can be used to introduce parallelism into a traversal. The Lassie project is currently using this functionality to speed up Bitswap block fetching; future releases of go-ipld-prime may include additional functionality being prototyped in Lassie to manage parallelism and caching.
• Schemas: Support listpairs struct representation in DSL parsing, by @​rvagg #514
• Schemas: Support inline union representation in DSL parsing, by @​rvagg #527
• Bindnode: Support listpairs struct representation, by @​rvagg #514
• Selectors: Support negative values for slice matcher's From and To, by @​rvagg #530
  • The slice matcher is currently being used to support byte-range fetching for the IPFS Trustless Gateway specification. Work is ongoing and can be seen in both the Lassie and Frisbii projects.
  • Please note that this feature is currently considered experimental and shoule be used with care and with the expectation that it may change in the near future. Expect a release or two before this feature is considered stable.

🩹 Fixes

• Traversal: StartAtPath work properly for matching walks, by @​rvagg #500
• Traversal: WalkTransforming() work properly, by @​EdSchouten #516
• Basicnode: basic.NewInt() returns a pointer like other constructors, by @​hacdias #525
• Selectors: Cache offsets for sequential reads in slice matcher, by @​rvagg #529

🌟 Thanks!

Thanks to @​hacdias and @​EdSchouten for their first contributions to go-ipld-prime!

v0.20.0

go-ipld-prime's release policy says that:

even numbers should be easy upgrades; odd numbers may change things

As such, v0.20.0 is a relatively minor release with a grab-bag of small improvements and fixes.

2023 February 11

Schema errors can now errors.Is:

... (truncated)

Commits

• See full diff in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot merge will merge this PR after your CI passes on it
• @dependabot squash and merge will squash and merge this PR after your CI passes on it
• @dependabot cancel merge will cancel a previously requested merge and block automerging
• @dependabot reopen will reopen this PR if it is closed
• @dependabot close will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)