Mason Protter
Mason Protter
Most functional languages with pattern matching have a mechanism to check if a pattern matching expression is 'exhaustive'. I'm imagining something like if I wrote ```julia @match x :: Union{Int,...
This is currently incomplete, but it's in at least a somewhat working state. It still requires at the very least - [ ] Docs - [ ] Tests and maybe...
Currently, we have that `Add` can only be used for symtypes that are `
Before this fix: ```julia julia> SymbolicUtils.show_call(stdout, (-), 1) 1 ``` After this fix: ```julia julia> SymbolicUtils.show_call(stdout, (-), 1) -(1) ```
```julia julia> @acrule(-1 - ~x => "match")(-1 - x) julia> @rule(-1 - ~x => "match")(-1 - x) ``` ref https://julialang.zulipchat.com/#narrow/stream/274208-helpdesk-(published)/topic/Symbolics.2Ejl.20derivative.20cot(x)
I suspect that most functions which are called in the process of `simplify` should be marked with `@nospecialize`, otherwise the compiler is going to be doing a *ton* of unnecessary...
Currently, we set a random seed in the test suite so that they are deterministic. It'd be good if we had a bot that cloned `master` once a day and...
Currently, I don't think there's an easy way yo get back to the repository from the website. It'd be good to have a big obvious link at the top or...
Suppose I have ```julia @theory Eq{T} begin eq(x::T, y::T) :: Bool neq(x::T, y::T) :: Bool end ``` it'd be nice if I could specify that all instances of `Eq{T}` automatically...
I'm not sure if this is something that `@avx` is supposed to be able to handle, but when I write ```julia using LoopVectorization function matmul!(u::AbstractVector{T}, A::Tridiagonal{T}, v::AbstractVector{T}) where {T} @assert...