Peter Blackson
Peter Blackson
I believe the fst (Finite State Machine) crate may help, specifically its `Levenshtein`: https://github.com/BurntSushi/fst
I volunteer to do this task. I would check for programmatic scrolling in GTK.
Does the checkbox "Don't select all records in group" resolve this use case?
The Rust standard library already uses efficient sorting algorithms.
I have the same issue.
Yes, exposing names of private fields doesn't sit well. There's another way. Composite lifetimes allow separate borrows of individual parts of a type. Two mutable borrows with composite lifetimes `'(a,...
Madness? This is Sparta! :100: :100: :100:
I approve!!!
The trick is processing an entire module at once. I might make an attempt at implementation. ``` rust #[lua-userdata] mod bar { struct Foo { value: int, } impl Foo...
A linux program called baobab does exactly this.