Bump version from 2.11.0 to 3.0.0 - #277
Merged
Merged
Conversation
Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Collaborator
Author
|
The "breaking" changes are rather minor, so we probably could also go with a minor bump, but the numbers get bigger and bigger so why not a major. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Major rather than minor: 2.11.0 was never released (the latest tag is 2.10.0), so one release can cover both breaking changes honestly instead of shipping them as minors.
parse_tlv(): a malformedPENDINGTIMESTAMPorDELAYTIMERnow raisesTLVErrorinstead of parsing into an untyped item, and those two tags decode toTimestamp/DelayTimerrather thanMeshcopTLVItem. Input that previously parsed can now be rejected.create_pending_dataset()refuse while a pending dataset is in place, where it previously replaced it.🤖 Generated with Claude Code