Lukas Bergdoll
Lukas Bergdoll
For example ```rust pub unsafe fn ptr_0(&mut self) -> *mut String { let inner = self.inner.as_mut_ptr(); &raw mut (*inner).a } ``` A reference in Rust gurantees that the memory is...
```rust #[derive(Builder, Debug)] struct Orange { a: String, b: String, } fn main() { let orange = Orange::builder() .set_a("xxx".into()) .set_b(panic!()) .build(); dbg!(orange); } ``` ``` cargo +nightly miri run The...
This reworks the internals of slice::sort. Mainly: - Introduce branchless swap_next_if and optimized sortX functions - Speedup core batch extension with sort16 - Many small tweaks to reduce the amount...
Hi, I've recently been doing research on sort implementations and noticed that dmsort exhibits stacked borrow violations when sorting random inputs. It should be relatively easy to reproduce by sorting...
Running this program via `RUSTFLAGS=-Zsanitizer=address cargo run` yields a use-after-free with dmsort: ```rust use std::cell::Cell; fn main() { struct ValWithBox { val: i32, heap_val: Cell, } let pattern = [...
Among the claims you make, are: "Fault tolerance (immune to corruption, partial writes, process races, etc)" and "Consistency guarantees on read and write (full data verification)". These two claims stand...
### Description Recently I ran into https://github.com/colour-science/colour/issues/958 while wanting to use manim and colour-science in the same Python project. The workaround is not great. I'd appreciate it if you could...
The fundamental branchless swap_if code produces suboptimal code on x86-64. I ported it to Rust and noticed that changing it yielded a 50% performance uplift for that function on Zen3,...
Opening this link https://play.rust-lang.org/?version=nightly&mode=debug&edition=2021&gist=99d1c3ef5b3e76f316d032f75abcf913 Yields: ``` Unexpected token '
- Stable sort uses a simple merge-sort that re-uses the existing - rather gnarly - merge function. - Unstable sort jumps directly to the branchless heapsort fallback. - select_nth_unstable jumps...