update getrandom to 0.4#177
Conversation
|
Maybe we don't want a duplicate |
|
Hello @Ludea Unless there's a CVE, I don't think bumping dependencies without a particular motivation is really useful. Not dismissing the PR, there maybe is a completely valid reason As for the double dependency, yes it's an issue we should try to avoid, although this repo contains snapshots of the upstream libraries for both divan and criterion, the closer we stay to their trunk the better. This is definitely something we could improve in the repo structure. |
|
0.4 support wasip{1, 2 3} target (even if wasip3 is not yet released. With updating to this version, we can use this lib on these target. I don't use directly codspeed but a lib which depend on it. |
eb3194c to
5bb8070
Compare
Greptile SummaryThis PR upgrades
Confidence Score: 5/5Safe to merge — the getrandom API rename is mechanical and correct, and all secondary changes are compiler lint fixes with no functional impact. All changes are straightforward: the getrandom::fill rename is the documented replacement for getrandom::getrandom in v0.4, the MSRV bump to 1.85 exactly matches getrandom 0.4's stated minimum, and the remaining changes are clippy/rustfmt housekeeping in the criterion and divan forks. Both getrandom versions coexist correctly in Cargo.lock because rand_core 0.6 still pins 0.2. No files require special attention. Important Files Changed
|
5bb8070 to
f4c2f16
Compare
|
Merging like this, the duplicate getrandom is just a dev dependency for criterion's test suite. As much as we can we try to not introduce diff to upstream libs to ease maintenance. |
Merging this PR will improve performance by 6.38%
|
| Mode | Benchmark | BASE |
HEAD |
Efficiency | |
|---|---|---|---|---|---|
| ❌ | WallTime | recursive_memoized[HashMap<u64, u64>, 0] |
15 ns | 143 ns | -89.51% |
| ❌ | WallTime | iterative[0] |
1 ns | 3 ns | -66.67% |
| ❌ | WallTime | from_elem_decimal[1024] |
84 ns | 203 ns | -58.62% |
| ❌ | WallTime | from_elem[1024] |
83 ns | 167 ns | -50.3% |
| ❌ | WallTime | rem |
3 ns | 6 ns | -50% |
| ❌ | Simulation | permutations[5] |
33.7 µs | 66.1 µs | -49.06% |
| ❌ | Simulation | from_elem_decimal[1024] |
1.9 µs | 3.1 µs | -39.07% |
| ❌ | WallTime | mul |
2 ns | 3 ns | -33.33% |
| ❌ | Simulation | from_elem[1024] |
1.9 µs | 2.8 µs | -32.55% |
| ❌ | WallTime | find_highest_set_bit[65535] |
5 ns | 7 ns | -28.57% |
| ❌ | Simulation | from_elem[2048] |
3.4 µs | 4.6 µs | -25.87% |
| ❌ | Simulation | from_elem_decimal[2048] |
3.4 µs | 4.6 µs | -25.87% |
| ❌ | Simulation | iterative[0] |
119.2 ns | 148.3 ns | -19.66% |
| ❌ | Simulation | process_items_with_counter |
865 ns | 1,021.1 ns | -15.29% |
| ❌ | WallTime | sort |
120.2 µs | 140.7 µs | -14.6% |
| ❌ | WallTime | subset_sum[16] |
4 µs | 4.6 µs | -12.34% |
| ❌ | WallTime | subset_sum[14] |
2.1 µs | 2.4 µs | -12.25% |
| ❌ | WallTime | subset_sum[10] |
1 µs | 1.1 µs | -12.02% |
| ❌ | WallTime | subset_sum[12] |
1.9 µs | 2.2 µs | -11.96% |
| ❌ | WallTime | iterative[10] |
16 ns | 18 ns | -11.11% |
| ... | ... | ... | ... | ... | ... |
ℹ️ Only the first 20 benchmarks are displayed. Go to the app to view all benchmarks.
Tip
Investigate this regression by commenting @codspeedbot fix this regression on this PR, or directly use the CodSpeed MCP with your agent.
Comparing Ludea:getrandom (b79f040) with main (b30ce7d)
Signed-off-by: Guillaume Lagrange <guillaume@glagrange.eu>
f4c2f16 to
b79f040
Compare
Update getrandom to 0.4