Bump the all group with 3 updates

[dependabot]

Bumps the all group with 3 updates: rstar, faer and thiserror.

Updates rstar from 0.11.0 to 0.12.0

Release notes

Sourced from rstar's releases.

v0.12.0 release

What's Changed

• Fix a stack overflow error in DrainIterator by @​nickguletskii in georust/rstar#127
• Remove actually unused depth parameter and make Clippy happy. by @​adamreichold in georust/rstar#130
• Update rstar-benches geo dependency by @​michaelkirk in georust/rstar#131
• add mint feature for Point trait impl for mint::Point2 and mint::Point3 by @​ripytide in georust/rstar#134
• Better distance_2 docs by @​urschrei in georust/rstar#136
• Add cached envelope benchmark by @​urschrei in georust/rstar#137
• update to heapless=0.8 by @​rursprung in georust/rstar#140
• Update CI as a precursor to enabling merge queues by @​urschrei in georust/rstar#143
• Minor doc updates by @​urschrei in georust/rstar#144
• Implement an owning iterator and IntoIter for RTree by @​adamreichold in georust/rstar#146
• Hash and Default impls, and some type coverage tests by @​pthariensflame in georust/rstar#150
• Losslessly shrink rtree-example.png by @​pthariensflame in georust/rstar#152
• Update the scaling discussion for bulk_load by @​jerabaul29 in georust/rstar#156
• Use SmallHeap also for the iterator-based nearest neighbour search and optimize its spill implementation. by @​adamreichold in georust/rstar#154

New Contributors

• @​nickguletskii made their first contribution in georust/rstar#127
• @​ripytide made their first contribution in georust/rstar#134
• @​rursprung made their first contribution in georust/rstar#140
• @​pthariensflame made their first contribution in georust/rstar#150
• @​jerabaul29 made their first contribution in georust/rstar#156

Full Changelog: georust/rstar@v0.11.0...v0.12.0

Commits

• 3b32701 Prepare for 0.12.0 release (#157)
• 1812101 Use SmallHeap also for the iterator-based nearest neighbour search and optimi...
• f9973cf Update the scaling discussion for bulk_load (#156)
• c7d53c8 Optimize image rtree-example.png (#152)
• f1407dd Hash and Default impls, and some type coverage tests (#150)
• 6c23af0 Implement an owning iterator and IntoIter for RTree (#146)
• a8904d2 More doc updates (#144)
• 54e7eb0 Update CI as a precursor to enabling merge queues (#143)
• c16c1e9 update to heapless=0.8
• 9f8c6b6 Add cached envelope benchmark (#137)
• Additional commits viewable in compare view

Updates faer from 0.14.1 to 0.18.2

Changelog

Sourced from faer's changelog.

0.18

• Refactored the project so that faer contains all the core and decomposition implementations. faer-{core,cholesky,lu,qr,svd,evd,sparse} are now deprecated and will no longer be updated.
• Improved the multithreaded performance of the Eigenvalue decomposition for large matrices.
• Decomposition solve functions now accept column vectors as well as matrices.
• Implemented the L1 norm, and the squared L2 norm.
• Implemented conversions from sparse to dense matrices, by calling mat.to_dense().
• Sparse matrices now support duplicated entries. Note that faer will not add duplicated entries to a matrix unless the opposite is explicitly mentioned in the function documentation. faer also will deduplicate entries when created with Sparse{Col,Row}Mat::try_new_from_indices and other similar functions.
• Implemented conversions from unsorted to sorted sparse matrices by calling mat.to_sorted() (or mat.sort_indices() for owned matrices).
• Implemented {Col,Row}::try_as_slice[_mut] functions that return data as a slice if it is contiguous.
• Implemented .for_each_with_index and .map_with_index for the matrix zipping API, which passes the matrix row and column indices as well as the values.
• Added rand support for randomly generating matrices in the faer::stats module, as well as for faer::complex_native::{c32,c64}.
• Implemented a pseudoinverse helper for the high level SVD and thin SVD decompositions.

0.17

• Implemented sparse matrix arithmetic operators (other than sparse-sparse matrix multiplication), and added mutable sparse views as well as owning sparse matrix containers.
• Implemented try_from_triplets for sparse matrices.
• Re-exported subcrates in faer::modules.
• Improved performance of the SVD decomposition for small matrices.
• Implemented col!, row! and concat! macros. Thanks @​DeliciousHair for the contribution.
• Implemented more c32/c64 operations. Thanks @​edyounis for the contribution.
• Implemented the Kronecker product in faer_core. Thanks @​edyounis for the contribution.
• Implemented (de)serialization of Mat. Thanks @​cramt for the contribution.

0.16

• Implemented the index operator for row and column structures. Thanks @​DeliciousHair for the contribution.
• Exposed a few sparse matrix operations in the high level API.
• Implemented sparse LU and QR, and exposed sparse decompositions in the high level API.
• Better assertion error messages in no_std mode.

0.15

• Implemented initial API of Row/RowRef/RowMut and Col/ColRef/ColMut structs for handling matrices with a single row or column.
• Implemented [Mat|Col|Row]::norm_l2 and [Mat|Col|Row]::norm_max for computing the L2 norm of a matrix or its maximum absolute value.
• Fixed several bugs in the eigenvalue decompositions. Special thanks to @​AlexMath for tracking down the errors.
• Updated zipped! macro API, which now requires a matching unzipped! for matching the closure arguments.
• Removed the limitation on the number of matrices that can be passed to zipped!.
• Added a zipped!(...).map(|unzipped!(...)| { ... }) API to allow mapping a zipped pack of matrices and returns the result as a matrix.
• Updated polars dependency to 0.34.
• Speed improvements for complex matrix multiplication on AMD cpus.
• New SIMD functions in the Entity trait for aligned loads and stores.
• Renamed multiple methods such as MatMut::transpose to MatMut::transpose_mut.

0.14

• Implemented sparse data structures in faer_core::sparse.
• Implemented sparse Cholesky decompositions, simplicial and supernodal. Only the low level API is currently exposed in faer-sparse.
• Implemented dynamic regularization for the Bunch-Kaufman Cholesky decomposition.
• Implemented diagonal wrappers that can be used to interpret a matrix as a diagonal matrix, using {MatRef,MatMut}::diagonal and {MatRef,MatMut}::column_vector_as_diagonal.
• Implemented matrix multiplication syntax sugar for diagonal wrappers, and permutation matrices.
• Implemented compute_thin_r and compute_thin_q in faer::solvers::{Qr,ColPivQr}.
• Implemented initial SIMD support for aarch64.

... (truncated)

Commits

• See full diff in compare view

Updates thiserror from 1.0.50 to 1.0.58

Release notes

Sourced from thiserror's releases.

1.0.58

• Make backtrace support available when using -Dwarnings (#292)

1.0.57

• Generate more efficient Display impl for error message which do not contain any interpolated value (#286, thanks @​nyurik)

1.0.56

• Update proc-macro2 to fix caching issue when using a rustc-wrapper such as sccache

1.0.55

• Work around improperly cached build script result by sccache – second attempt (#280)

1.0.54

• Work around improperly cached build script result by sccache – first attempt (#279)

1.0.53

• Reduce spurious rebuilds under RustRover IDE when using a nightly toolchain (#270)

1.0.52

• Fix interaction with RUSTC_BOOTSTRAP (#269)

1.0.51

• Improve diagnostics when an invalid attribute previously caused thiserror to generate no Error impl (#266)

Commits

• df8bffa Release 1.0.58
• 14be209 Merge pull request #292 from dtolnay/deadcode
• 15a1d64 Make compatible with -Dwarnings
• f55a5d2 Ignore mixed_attributes_style clippy lint
• f770921 Resolve assigning_clones clippy lint
• 1d106b1 Release 1.0.57
• 8a5c4d1 Use write_str when args only consists of trailing comma
• f790bee Phrase flag in terms of whether core::fmt machinery is required
• d43b759 Ignore needless_raw_string_hashes pedantic clippy lint in test
• d09c418 Touch up PR 286
• 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 show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore <dependency name> major version will close this group update PR and stop Dependabot creating any more for the specific dependency's major version (unless you unignore this specific dependency's major version or upgrade to it yourself)
• @dependabot ignore <dependency name> minor version will close this group update PR and stop Dependabot creating any more for the specific dependency's minor version (unless you unignore this specific dependency's minor version or upgrade to it yourself)
• @dependabot ignore <dependency name> will close this group update PR and stop Dependabot creating any more for the specific dependency (unless you unignore this specific dependency or upgrade to it yourself)
• @dependabot unignore <dependency name> will remove all of the ignore conditions of the specified dependency
• @dependabot unignore <dependency name> <ignore condition> will remove the ignore condition of the specified dependency and ignore conditions