Open ZJaume opened 1 month ago
The main reason I limited enums to a 256 variants is because bitcode 0.6 requires calculating a histogram of all the variants of each enum while deserializing. With 256 variants a [usize; 256]
can be used to calculate the histogram which is quite fast. For an arbitrary number of variants a HashMap<u32, usize>
is required which isn't fast.
requires calculating a histogram
Perhaps an exception can be made for C-style enums, i.e. those that lack fields in their variants, which don't need a histogram.
Is a [usize; 65536]
too much for that histogram?
Is a
[usize; 65536]
too much for that histogram?
Yes, because that would require iterating all 65536 elements to see which ones are non zero which is significant overhead.
This would only be faster than a HashMap<u32, usize>
for calculating a histogram of a very large message where the 1 time cost of iteration does not dominate the runtime.
@finnbear does bring up a good point that histograms are only required non C-style enums so we could support u16
C-style enums easier.
Are there any plans on supporting enums larger than u8? I'm currently developing a language identifier that has 238 variants for the language codes and will probably surpass that amount in the future when more languages are added.
Also, I found the error a bit confusing
because it does not say anything about what is causing the error. So I did not know if it was a limitation from the language, the strum derives or the bitcode derives.
Thank you very much for your library. It was one of the main optimizations I did for my tool and was able to cut down the model loading time more than a half.