We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
We probably want to benchmark where the best place to bring rayon in would be
I am thinking that we probably want to make checking for a word a single thread, but maybe checking multiple words could be parallel?
If we can do lazy creation & storage in parallel (#54), we need to put our wordlists in a RwLock... but that could be deadlock heavy.
RwLock
We need some good benchmarking before this.
The text was updated successfully, but these errors were encountered:
We could also do some form of sharding - store a [Mutex<HashMap<...>>; 8] and use the first char % 8 to determine which index to use.
[Mutex<HashMap<...>>; 8]
Or https://github.com/xacrimon/dashmap
Sorry, something went wrong.
No branches or pull requests
We probably want to benchmark where the best place to bring rayon in would be
I am thinking that we probably want to make checking for a word a single thread, but maybe checking multiple words could be parallel?
If we can do lazy creation & storage in parallel (#54), we need to put our wordlists in a
RwLock
... but that could be deadlock heavy.We need some good benchmarking before this.
The text was updated successfully, but these errors were encountered: