mhostetter
mhostetter
Unfortunately the `dtype` solution doesn't work for custom ufuncs. See below for details ```python In [6]: GF = galois.GF(2**10, compile="jit-calculate") In [7]: c = galois.irreducible_poly(2**10, 3); c Out[7]: Poly(x^3 +...
I also tried ```python class UFunc: # ... @property def python_calculate(self) -> Callable: """ A pure-Python ufunc implemented using explicit calculation. """ if self.override: return self.override # From return lambda...
Thanks for this -- another well-executed PR. Let me just think about this a bit more before I merge it in.
Another potential option here is to remove that kwarg from the constructor. This would force someone to do `Poly(coeffs[::-1])` instead of `Poly(coeffs, order/ordering="asc")`. Depending on what is decided with #193...
Perhaps do this after v1.0.0?
It should be possible to support Laurent polynomials. However, it would likely need to be a new class -- `LaurentPoly`, perhaps. May I ask: what do you wish to do...
I see. I'll leave this marked as a feature request and maybe get around to it in a bit.
PR #123 speeds up prime factorization of perfect powers.
PR #141 adds and improves several integer factorization algorithms.
Potentially create a custom dtype for finite field types. For `GF(p^m)` it could be a subarray dtype with `m` items from `GF(p)`? https://numpy.org/devdocs/reference/generated/numpy.dtype.subdtype.html#