peter7891
peter7891
> Hi, I found this while looking for a lower memory usage alternative to anknown/ahocorasick. > > I have a dataset of around 6 million strings. The total memory usage,...
> After some thoughts I think that this isn't the way to fix the issue. I suspect that the issue is that the `leftmostFindAtNoStateImp` overrides the `lastmatch` with an invalid...
> Yes, you're correct. `Rooted` will survive a heap clean (and acts as the 'root' of an object tree) whereas `Handle` will not. If you have a stack VM, items...
I tried this with one of my other projects, it works for the other project but not this one. This is very weird.
The only difference between the 2 projects is, the one that is not working is a workspace with multiple crates.
> Thanks for the request @peter7891! > > There are a few things to consider when choosing a hash function for a hash table. Hash functions with a poor output...
> That looks pretty good. I wonder, how would `aHash` perform in Go. https://github.com/tkaitchuck/aHash/blob/master/compare/readme.md
> What is your environment like OS, Rust version, etc.? > > At least, simply printing strings with `cargo run` seems to work on my machine with macOS Ventura 13.6,...
> Do you use NaN boxing or pointer tagging? I'm assuming a VM for dynamic programming languages. Do you have a public repo? I am using pointer tagging. I do...
When i am interpreting the following code ```go type User struct { name string } func main() { a := []*User{} for i := 0; i