You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Since Rust 1.36, this is now the HashMap implementation for the Rust standard library. However you may still want to use this crate instead since it works in environments without std, such as embedded systems and kernels.
The text was updated successfully, but these errors were encountered:
The size is known in advance and the required memory could be allocated statically.
It's only known if the LFSR is using a maximum length characteristic polynomial. But I guess this is the case for all LFSR-based time codes and in the worst case we allocate too much. So I'll look into it.
It should be possible to use this library in a no-std (bare metal) environment.
The only heap allocation that is needed is for the lookup table. The size is known in advance and the required memory could be allocated statically.
By switching to hashbrown::HashMap this should be possible.
The text was updated successfully, but these errors were encountered: