Tommy Hofmann
Tommy Hofmann
Here are some breadcrumbs (I wrote this for an Oscar user, who wanted to call these functions). It can be made free of Oscar, but I am too lazy right...
To get no false positives for valgrind. I once suspected leaks in some julia program, but without `flint_cleanup_master` there are too many false positives. See [https://github.com/flintlib/flint/issues/1163](https://github.com/flintlib/flint/issues/1290#issuecomment-1477417554) and the discussion there....
Sounds ok to me
The problem is that there are methods in Base which use hashing without explicitly documenting it. Since this is an implementation detail, there might even be methods which start using...
The old code has a lot of root for improvements (for example, not using `is_zero` but `is_zero_entry`). Do you have an example for benchmarking? P.S.: I am asking, because 200x200...
If `S = grade(R, ...)` with 1), we cannot make the canonical maps `R -> S` and `S -> R` work as in the following example, right? ``` julia> R,...
> * If one has mathematically identical rings with different gradings, one can use `forget_grading` and type casting to move elements between the rings (efficiently!). Maybe there is room for...
Can you try with #100?
It is basically the same as #54. I have some local branch for better macro support, but it requires #100.
I don't see how this could be made work with the current approach. I think `@isdefined` needs to be added to https://github.com/JuliaDynamics/ResumableFunctions.jl?tab=readme-ov-file#caveats.