chethega
chethega
It would be nice to implement various algorithms for qualitative analysis of chemical reaction networks. So, this issue is for brainstorming: 1. What kind of qualitative analyses would you like...
``` julia> using Distances julia> d = Minkowski(0.5); julia> a=[1.0,0.0]; b=[0.0,1.0]; c=[0.0,0.0]; julia> evaluate(d, a, b) - evaluate(d,a,c) - evaluate(d,c,b) 2.0 julia> d isa Metric true ``` This violates the...
I take the lack of further response to [https://github.com/JuliaIO/JLD2.jl/issues/115](https://github.com/JuliaIO/JLD2.jl/issues/115) as "yes, potential security issues can currently go on the public bugtracker and don't warrant coordinated disclosure / non-public patch development...
Consider the [this](https://github.com/JuliaWeb/WebSockets.jl/blob/207c4424b9e5ebbcc3b69de33ff66c3f43fb9c16/src/WebSockets.jl#L555) line. Here, we use the base `rand`, which uses Mersenne twister. This is not a cryptographically secure random source. Per [rfc6455](https://tools.ietf.org/html/rfc6455#section-5.3), "The masking key needs to be...
As far as I know, we currently export access to nonzero values to sparse vectors and sparse column views, via `SparseArrays.nonzeros`. However, the corresponding `SparseArrays.nonzeroinds` is not exported, which makes...
Generating nonces is a very typical need. This is rather inconvenient with the currently existing exports. The issue came up when looking for a fix for https://github.com/GenieFramework/Genie.jl/issues/162 . Tangentially related...
An unsafe vector could also provide `push!`, `pop!`, etc which grow/shrink the view, respectively, overwriting entries of the parent. This would be used via `uview = push!(uview, val)`. These can...
We recently discovered in [https://github.com/JuliaLang/julia/pull/29888](https://github.com/JuliaLang/julia/pull/29888) a somewhat surprising fact about modern CPU: The branch-predictor is capable of remembering astoundingly long periodic patterns. If we run a benchmark loop, then each...
`hash`, `isequal` and `==` are currently unable to handle self-referential recursive structures: ``` A=Any[]; push!(A,A); B=deepcopy(A); isequal(A,B) A==A hash(A) ``` all give `StackOverflowError`. What should we do? We already have...