Oscar Smith
Oscar Smith
This uses a slightly different definition of the jacobian than ForwardDiff. For jacobian(f:N×M->P) it will return a result of shape `P×N×M` while ForwardDiff will return `P×(N⋅M)`
Right now Cthulhu will show the inlining costs of all instructions called, but it would be nice if at the top, it had the sum of costs for all calls...
With the function ``` function f() var"1"=2 return 1 end ``` running `@enter f()` followed by `fr` gives the result: ``` | 1::Int64 = 2 ``` Ideally, this would print...
This would be the equivalent of `p x` in gdb. Having ` is nice, but, a lot of the time, I just want to look at a single variable, and...
The following code ``` isa_control_flow(::Type{T}, x) where {T} = isa(x, T) ? x : T(x) @interpret Diffractor.PrimeDerivativeBack(x->sum(isa_control_flow(Matrix{Float64}, x)))(Float32[1 2;]) ```` fails with ``` ERROR: BoundsError: attempt to access Core.Argument at...
Google scholar lists 3750 articles citing the main Julia paper (https://scholar.google.com/scholar?cites=12373977815425691465&as_sdt=40000005&sciodt=0,22&hl=en) and semantic scholar shows 38000 papers with Julia as a keyword since 2012, and of the first 10 pages,...
Are there plans to allow reading of `syzygy` or `gaviota` TBs from this library? Imo, if that was added, this would be at feature parity with Python Chess.
Before `_primesmask(2^30)` took 2.726 seconds after it took `2.358s`. Although this is a relatively small improvement overall, it removes ~100% of the time for the small primes (250ms vs 30ms)...
idea comes from https://en.algorithmica.org/hpc/algorithms/factorization/. Lenstra will still be better for numbers larger than `Int64`, but getting extra speed is always nice.