Hi Stephen,
Thanks for the review.
No particular reason, will change it to uint32_t in v2.
On 09/09/2024 01:11, Stephen Hemminger wrote:
On Fri, 6 Sep 2024 16:53:16 +
Vladimir Medvedkin wrote:
+struct divisors {
+ int n; /* number of divisors */
+ int div_arr[MAX_DIVISORS];
On Fri, 6 Sep 2024 16:53:16 +
Vladimir Medvedkin wrote:
> +struct divisors {
> + int n; /* number of divisors */
> + int div_arr[MAX_DIVISORS];
> +};
Why int instead of a fixed size unsigned, like uint32_t?
Current polynomial table has the following limitations:
1. It has polynomials up to degree 16
2. For each degree there are only 4 polynomials
The above results in less entropy when generating Toeplitz hash key
subsequences.
This patch replaces the current static table approach with dynamic
polyn
3 matches
Mail list logo
