| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2025-01-26 | Put all coretests in a separate crate | bjorn3 | -173/+0 | |
| 2024-09-22 | Reformat using the new identifier sorting from rustfmt | Michael Goulet | -1/+1 | |
| 2024-07-29 | Reformat `use` declarations. | Nicholas Nethercote | -2/+2 | |
| The previous commit updated `rustfmt.toml` appropriately. This commit is the outcome of running `x fmt --all` with the new formatting options. | ||||
| 2024-01-02 | Adjust library tests for unused_tuple_struct_fields -> dead_code | Jake Goulding | -2/+2 | |
| 2023-06-12 | add benchmark | The 8472 | -0/+9 | |
| 2022-02-21 | Stop manually SIMDing in swap_nonoverlapping | Scott McMurray | -4/+39 | |
| Like I previously did for `reverse`, this leaves it to LLVM to pick how to vectorize it, since it can know better the chunk size to use, compared to the "32 bytes always" approach we currently have. It does still need logic to type-erase where appropriate, though, as while LLVM is now smart enough to vectorize over slices of things like `[u8; 4]`, it fails to do so over slices of `[u8; 3]`. As a bonus, this also means one no longer gets the spurious `memcpy`(s?) at the end up swapping a slice of `__m256`s: <https://rust.godbolt.org/z/joofr4v8Y> | ||||
| 2021-03-18 | add bench | The8472 | -0/+13 | |
| 2021-01-30 | Improve slice.binary_search_by()'s best-case performance to O(1) | Folyd | -6/+38 | |
| 2020-07-27 | mv std libs to library/ | mark | -0/+84 | |
