chethega

>You might still find that, once compiled, the methods run quite quickly. This is not the problem here: ``` julia> using StaticArrays julia> N=500;r=rand(N); julia> @time MVector{N}(r); 1.555657 seconds (1.07...

>It is a vulnerability, but with most actual uses, the garbage collector will create random time intervals I believe. Per [rfc6455 10.3](https://tools.ietf.org/html/rfc6455#section-10.3), this should not be too urgent to fix....

@Sacha0 So you are saying new functions `storedinds` and `storedvals` that are only defined for sparse vectors, sparse column views (and potentially transposes of sparse vectors / sparse column views)?...

>While it would, in theory, be nice to be able to grow an UnsafeVector, overwriting the parent array would be just a bit too unsafe ... :-) Why? I have...

Ok, you're right; mutable is the way to go for this. foobar from discourse is actually me, btw. I tend to use new pseudonyms for every account I make.

>Somewhat amusingly, femtolisp implements the union-find algorithm for this already. Nice! >To clarify, this means that hash values would change from Julia 1.x to 1.(x+1) right? Not that hash values...