Bump core from 1.1.0 to 2.1.0

[dependabot]

Bumps core from 1.1.0 to 2.1.0.

Release notes

Sourced from core's releases.

Core v2.1.0

[2.1.0] - 2022-05-26

Added

• FibonacciHeap: implements PriorityQueue with a Fibonacci heap for both min-heap and max-heap cases.
• FibonacciHeapDouble: implements PriorityQueueDouble with a Fibonacci heap for both min-heap and max-heap cases.
• IntFibonacciHeap: implements IntPriorityQueue with a Fibonacci heap for both min-heap and max-heap cases.
• IntFibonacciHeapDouble: implements IntPriorityQueueDouble with a Fibonacci heap for both min-heap and max-heap cases.
• Added promote and demote methods to the PriorityQueue, PriorityQueueDouble, IntPriorityQueue, IntPriorityQueueDouble interfaces for changing priorities strictly in one direction, and implemented in the various heap classes.

Changed

• Altered change method of the PriorityQueue, PriorityQueueDouble, IntPriorityQueue, IntPriorityQueueDouble interfaces, and of the classes that implement them to return a boolean rather than void.
• Refactored IntBinaryHeap and IntBinaryHeapDouble to improve max-heap implementation.

Fixed

• Bug in BinaryHeap and BinaryHeapDouble with potential to break encapsulation.

Core v2.0.0

[2.0.0] - 2022-05-19

BREAKING CHANGES: See changes section for details. Breaking changes include increasing minimum supported Java version to Java 17.

Added

• DisjointSetForest: representation of disjoint sets of generic objects.
• DisjointIntegerSetForest: representation of disjoint sets of integers with a disjoint set forest.
• PriorityQueue: interface for priority queues with int-valued priorities.
• PriorityQueueDouble: interface for priority queues with double-valued priorities.
• BinaryHeap: implements PriorityQueue with binary heap for both min-heap and max-heap cases.
• BinaryHeapDouble: implements PriorityQueueDouble with binary heap for both min-heap and max-heap cases.
• IntPriorityQueue: interface for priority queues of int elements with int-valued priorities.
• IntPriorityQueueDouble: interface for priority queues of int elements with double-valued priorities.
• IntBinaryHeap: implements IntPriorityQueue with binary heap for both min-heap and max-heap cases.
• IntBinaryHeapDouble: implements IntPriorityQueueDouble with binary heap for both min-heap and max-heap cases.

Changed

• Minimum supported Java version is now Java 17.
• Migrated test cases to JUnit Jupiter 5.8.2.

Changelog

Sourced from core's changelog.

[2.1.0] - 2022-05-26

Added

• FibonacciHeap: implements PriorityQueue with a Fibonacci heap for both min-heap and max-heap cases.
• FibonacciHeapDouble: implements PriorityQueueDouble with a Fibonacci heap for both min-heap and max-heap cases.
• IntFibonacciHeap: implements IntPriorityQueue with a Fibonacci heap for both min-heap and max-heap cases.
• IntFibonacciHeapDouble: implements IntPriorityQueueDouble with a Fibonacci heap for both min-heap and max-heap cases.
• Added promote and demote methods to the PriorityQueue, PriorityQueueDouble, IntPriorityQueue, IntPriorityQueueDouble interfaces for changing priorities strictly in one direction, and implemented in the various heap classes.

Changed

• Altered change method of the PriorityQueue, PriorityQueueDouble, IntPriorityQueue, IntPriorityQueueDouble interfaces, and of the classes that implement them to return a boolean rather than void.
• Refactored IntBinaryHeap and IntBinaryHeapDouble to improve max-heap implementation.

Fixed

• Bug in BinaryHeap and BinaryHeapDouble with potential to break encapsulation.

[2.0.0] - 2022-05-19

BREAKING CHANGES: See changes section for details. Breaking changes include increasing minimum supported Java version to Java 17.

Added

• DisjointSetForest: representation of disjoint sets of generic objects.
• DisjointIntegerSetForest: representation of disjoint sets of integers with a disjoint set forest.
• PriorityQueue: interface for priority queues with int-valued priorities.
• PriorityQueueDouble: interface for priority queues with double-valued priorities.
• BinaryHeap: implements PriorityQueue with binary heap for both min-heap and max-heap cases.
• BinaryHeapDouble: implements PriorityQueueDouble with binary heap for both min-heap and max-heap cases.
• IntPriorityQueue: interface for priority queues of int elements with int-valued priorities.
• IntPriorityQueueDouble: interface for priority queues of int elements with double-valued priorities.
• IntBinaryHeap: implements IntPriorityQueue with binary heap for both min-heap and max-heap cases.
• IntBinaryHeapDouble: implements IntPriorityQueueDouble with binary heap for both min-heap and max-heap cases.

Changed

• Minimum supported Java version is now Java 17.
• Migrated test cases to JUnit Jupiter 5.8.2.

Commits

• a297b39 prep for release
• 9227d16 Merge pull request #60 from cicirello/fix-copy-bug
• 12669f3 random seed for consistent tests
• 669b45b Update CHANGELOG.md
• 516db46 fix copy empty fibonacci heap
• 2a24bbc doc update
• 1d044ba Merge pull request #59 from cicirello/int-fib-heap
• d203198 Update CHANGELOG.md
• f3c26aa Update CHANGELOG.md
• dd15e84 refecator hierarchy
• Additional commits viewable 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 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)

[cicirello]

@dependabot recreate